Search Results for ""
321 - 330 of 453 for Lucas Lehmer Primality TestSearch Results

Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...
If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...
Mills' theorem states that there exists a real constant A such that |_A^(3^n)_| is prime for all positive integers n (Mills 1947). While for each value of c>=2.106, there are ...
The odd divisor function sigma_k^((o))(n)=sum_(d|n; d odd)d^k (1) is the sum of kth powers of the odd divisors of a number n. It is the analog of the divisor function for odd ...
A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...
A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...
In the 1980s, Samuel Yates defined a titanic prime to be a prime number of at least 1000 decimal digits. The smallest titanic prime is 10^(999)+7. As of 1990, more than 1400 ...
A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...
Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...
Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...

...