Search Results for ""

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

The floor function |_x_|, also called the greatest integer function or integer value (Spanier and Oldham 1987), gives the largest integer less than or equal to x. The name ...

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

The branch of geometry dealing with the properties and invariants of geometric figures under projection. In older literature, projective geometry is sometimes called "higher ...

The Steiner circumellipse is the circumellipse that is the isotomic conjugate of the line at infinity and the isogonal conjugate of the Lemoine axis. It has circumconic ...

A superellipse is a curve with Cartesian equation |x/a|^r+|y/b|^r=1, (1) first discussed in 1818 by Lamé. A superellipse may be described parametrically by x = acos^(2/r)t ...

The first few prime Lucas numbers L_n are 2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, ... (OEIS A005479), corresponding to indices n=0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, ...

product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...

An integer whose decimal digits contain no zeros is said to be zerofree. The first few positive zerofree integers are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, ...

The Cramér conjecture is the unproven conjecture that lim sup_(n->infty)(p_(n+1)-p_n)/((lnp_n)^2)=1, where p_n is the nth prime.