Search Results for ""

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

Yahtzee is a game played with five 6-sided dice. Players take turns rolling the dice, and trying to get certain types of rolls, each with an assigned point value, as ...

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).

A cubic number is a figurate number of the form n^3 with n a positive integer. The first few are 1, 8, 27, 64, 125, 216, 343, ... (OEIS A000578). The protagonist Christopher ...

The constant s_0 in Schnirelmann's theorem such that every integer >1 is a sum of at most s_0 primes. Of course, by Vinogradov's theorem, it is known that 4 primes suffice ...

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 ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

The first few terms in the continued fraction of the Champernowne constant are [0; 8, 9, 1, 149083, 1, 1, 1, 4, 1, 1, 1, 3, 4, 1, 1, 1, 15, 45754...10987, 6, 1, 1, 21, ...] ...