Search Results for ""

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

The Lehmer mean of a set of n numbers {a_k}_(k=1)^n is defined by L_p(a_1,...,a_n)=(sum_(k=1)^(n)a_k^p)/(sum_(k=1)^(n)a_k^(p-1)) (Havil 2003, p. 121).

The Lehmer cotangent expansion for which the convergence is slowest occurs when the inequality in the recurrence equation b_k>=b_(k-1)^2+b_(k-1)+1. (1) for ...

A test for the primality of Fermat numbers F_n=2^(2^n)+1, with n>=2 and k>=2. Then the two following conditions are equivalent: 1. F_n is prime and (k/F_n)=-1, where (n/k) is ...

Lehmer's formula is a formula for the prime counting function, pi(x) = (1) where |_x_| is the floor function, a = pi(x^(1/4)) (2) b = pi(x^(1/2)) (3) b_i = pi(sqrt(x/p_i)) ...

Lehmer's totient problem asks if there exist any composite numbers n such that phi(n)|(n-1), where phi(n) is the totient function? No such numbers are known. However, any ...

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

Let P, Q be integers satisfying D=P^2-4Q>0. (1) Then roots of x^2-Px+Q=0 (2) are a = 1/2(P+sqrt(D)) (3) b = 1/2(P-sqrt(D)), (4) so a+b = P (5) ab = 1/4(P^2-D) (6) = Q (7) a-b ...

The appearance of nontrivial zeros (i.e., those along the critical strip with R[z]=1/2) of the Riemann zeta function zeta(z) very close together. An example is the pair of ...

A statistical test making use of the statistical ranks of data points. Examples include the Kolmogorov-Smirnov test and Wilcoxon signed rank test.