Search Results for ""

If, in an interval of x, sum_(r=1)^(n)a_r(x) is uniformly bounded with respect to n and x, and {v_r} is a sequence of positive non-increasing quantities tending to zero, then ...

For a prime constellation, the Hardy-Littlewood constant for that constellation is the coefficient of the leading term of the (conjectured) asymptotic estimate of its ...

The first Hardy-Littlewood conjecture is called the k-tuple conjecture. It states that the asymptotic number of prime constellations can be computed explicitly. A particular ...

Let omega(n) be the number of distinct prime factors of n. If Psi(x) tends steadily to infinity with x, then lnlnx-Psi(x)sqrt(lnlnx)<omega(n)<lnlnx+Psi(x)sqrt(lnlnx) for ...

The smallest nontrivial taxicab number, i.e., the smallest number representable in two ways as a sum of two cubes. It is given by 1729=1^3+12^3=9^3+10^3. The number derives ...

The hyperbolic cosine is defined as coshz=1/2(e^z+e^(-z)). (1) The notation chx is sometimes also used (Gradshteyn and Ryzhik 2000, p. xxix). This function describes the ...

Draw antiparallels through the symmedian point K. The points where these lines intersect the sides then lie on a circle, known as the cosine circle (or sometimes the second ...

Let a be the angle between v and x, b the angle between v and y, and c the angle between v and z. Then the direction cosines are equivalent to the (x,y,z) coordinates of a ...

If f(x) is an even function, then b_n=0 and the Fourier series collapses to f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx), (1) where a_0 = 1/piint_(-pi)^pif(x)dx (2) = ...

The Fourier cosine transform of a real function is the real part of the full complex Fourier transform, F_x^((c))[f(x)](k) = R[F_x[f(x)](k)] (1) = ...