Search Results for ""

The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...

A Latin square is said to be odd if it contains an odd number of rows and columns that are odd permutations. Otherwise, it is said to be even. Let the number of even Latin ...

It is conjectured that any convex body in n-dimensional Euclidean space has an interior point lying on normals through 2n distinct boundary points (Croft et al. 1991). This ...

Defining p_0=2, p_n as the nth odd prime, and the nth prime gap as g_n=p_(n+1)-p_n, then the Cramér-Granville conjecture states that g_n<M(lnp_n)^2 for some constant M>1.

There are infinitely many primes m which divide some value of the partition function P.

Erdős offered a $3000 prize for a proof of the proposition that "If the sum of reciprocals of a set of integers diverges, then that set contains arbitrarily long arithmetic ...

Let (x_1,x_2) and (y_1,y_2) be two sets of complex numbers linearly independent over the rationals. Then the four exponential conjecture posits that at least one of ...

The nontrivial zeros of the Riemann zeta function correspond to the eigenvalues of some Hermitian operator (Derbyshire 2004, pp. 277-278).

Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...

A perfect power is a number n of the form m^k, where m>1 is a positive integer and k>=2. If the prime factorization of n is n=p_1^(a_1)p_2^(a_2)...p_k^(a_k), then n is a ...