Search Results for ""

A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...

A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...

A repunit prime is a repunit (i.e., a number consisting of copies of the single digit 1) that is also a prime number. The base-10 repunit (possibly probable) primes ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that is ...

A number of the form a_0+a_1zeta+...+a_(p-1)zeta^(p-1), where zeta=e^(2pii/p) is a de Moivre number and p is a prime number. Unique factorizations of cyclotomic integers fail ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

The property of being the only possible solution (perhaps modulo a constant, class of transformation, etc.).

Number Theory

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...