Search Results for ""

A number of the form 2^n-1 obtained by setting x=1 in a Fermat-Lucas polynomial, more commonly known as a Mersenne number.

A figurate number which is equal to the cubic number n^3. The first few are 1, 8, 27, 64, ... (OEIS A000578).

An inaccessible cardinal is a cardinal number which cannot be expressed in terms of a smaller number of smaller cardinals.

A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

Champernowne's constant C=0.12345678910111213... (1) (OEIS A033307) is the number obtained by concatenating the positive integers and interpreting them as decimal digits to ...

The factorization of a number into its constituent primes, also called prime decomposition. Given a positive integer n>=2, the prime factorization is written ...

Consider n intersecting ellipses. The maximal number of regions into which these divide the plane are N(n)=2n^2-2n+2=2(n^2-n+1), giving values for n=1, 2, ... of 2, 6, 14, ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

In his Meditationes algebraicae, Waring (1770, 1782) proposed a generalization of Lagrange's four-square theorem, stating that every rational integer is the sum of a fixed ...