Search Results for ""

Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers E_n = 1+product_(i=1)^(n)p_i (1) = 1+p_n#, (2) ...

Landau's problems are the four "unattackable" problems mentioned by Landau in the 1912 Fifth Congress of Mathematicians in Cambridge, namely: 1. The Goldbach conjecture, 2. ...

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

A map x|->x^p where p is a prime.

For a prime constellation, the Hardy-Littlewood constant for that constellation is the coefficient of the leading term of the (conjectured) asymptotic estimate of its ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

A Wieferich prime is a prime p which is a solution to the congruence equation 2^(p-1)=1 (mod p^2). (1) Note the similarity of this expression to the special case of Fermat's ...

A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...