Search Results for ""

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

Let Gamma be an algebraic curve in a projective space of dimension n, and let p be the prime ideal defining Gamma, and let chi(p,m) be the number of linearly independent ...

100=10^2. Madachy (1979) gives a number of algebraic equations using the digits 1 to 9 which evaluate to 100, such as (7-5)^2+96+8-4-3-1 = 100 (1) 3^2+91+7+8-6-5-4 = 100 (2) ...

A Fourier series in which there are large gaps between nonzero terms a_n or b_n.

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

Starting with the circle P_1 tangent to the three semicircles forming the arbelos, construct a chain of tangent circles P_i, all tangent to one of the two small interior ...

Let f(z) be an analytic function in an angular domain W:|argz|<alphapi/2. Suppose there is a constant M such that for each epsilon>0, each finite boundary point has a ...

Let p be an odd prime, k be an integer such that pk and 1<=k<=2(p+1), and N=2kp+1. Then the following are equivalent 1. N is prime. 2. There exists an a such that ...

The Riemann-Lebesgue Lemma, sometimes also called Mercer's theorem, states that lim_(n->infty)int_a^bK(lambda,z)Csin(nz)dz=0 (1) for arbitrarily large C and "nice" ...

Let there be x successes out of n Bernoulli trials. The sample proportion is the fraction of samples which were successes, so p^^=x/n. (1) For large n, p^^ has an ...