Search Results for ""

A prime number obtained by reading digits around an analog clock. In a clockwise direction, the primes are 2, 3, 5, 7, 11, 23, 67, 89, 4567, 23456789, 23456789101112123, ... ...

A Smarandache-Wellin number that is prime is known as a Smarandache-Wellin prime. Concatenations of the first n=1, 2, 4, 128, 174, 342, 435, 1429 (OEIS A046035; Ibstedt 1998, ...

A prime field is a finite field GF(p) for p is prime.

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

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

A "law of large numbers" is one of several theorems expressing the idea that as the number of trials of a random process increases, the percentage difference between the ...

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

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

Let F_n be the nth Fibonacci number, and let (p|5) be a Legendre symbol so that e_p=(p/5)={1 for p=1,4 (mod 5); -1 for p=2,3 (mod 5). (1) A prime p is called a Wall-Sun-Sun ...

Consider the Euclid numbers defined by E_k=1+p_k#, where p_k is the kth prime and p# is the primorial. The first few values of E_k are 3, 7, 31, 211, 2311, 30031, 510511, ... ...