Search Results for ""

Just as many interesting integer sequences can be defined and their properties studied, it is often of interest to additionally determine which of their elements are prime. ...

The Lucas-Lehmer test is an efficient deterministic primality test for determining if a Mersenne number M_n is prime. Since it is known that Mersenne numbers can only be ...

Two numbers are homogeneous if they have identical prime factors. An example of a homogeneous pair is (6, 72), both of which share prime factors 2 and 3: 6 = 2·3 (1) 72 = ...

A totative is a positive integer less than or equal to a number n which is also relatively prime to n, where 1 is counted as being relatively prime to all numbers. The number ...

Every compact 3-manifold is the connected sum of a unique collection of prime 3-manifolds.

For any positive integer k, there exists a prime arithmetic progression of length k. The proof is an extension of Szemerédi's theorem.

The twin primes constant Pi_2 (sometimes also denoted C_2) is defined by Pi_2 = product_(p>2; p prime)[1-1/((p-1)^2)] (1) = product_(p>2; p prime)(p(p-2))/((p-1)^2) (2) = ...

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

The Feller-Tornier constant is the density of integers that have an even number of prime factors p_i^(a_i) with a_1>1 in their prime factorization. It is given by ...

A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.