TOPICS
Search

Search Results for ""


231 - 240 of 453 for Lucas Lehmer Primality TestSearch Results
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.
A Fibonacci prime is a Fibonacci number F_n that is also a prime number. Every F_n that is prime must have a prime index n, with the exception of F_4=3. However, the converse ...
A figurate number of the form P_n^((4))=1/6n(n+1)(2n+1), (1) corresponding to a configuration of points which form a square pyramid, is called a square pyramidal number (or ...
The Jacobian of the derivatives partialf/partialx_1, partialf/partialx_2, ..., partialf/partialx_n of a function f(x_1,x_2,...,x_n) with respect to x_1, x_2, ..., x_n is ...
Let delta=z>=z_(observed). A value 0<=alpha<=1 such that P(delta)<=alpha is considered "significant" (i.e., is not simply due to chance) is known as an alpha value. The ...
Brun's sieve was refined by J. B. Rosser, G. Ricci, and others.
A number n satisfies the Carmichael condition iff (p-1)|(n/p-1) for all prime divisors p of n. This is equivalent to the condition (p-1)|(n-1) for all prime divisors p of n.
A finite, increasing sequence of integers {a_1,...,a_m} such that (a_i-1)|(a_1...a_(m-1)) for i=1, ..., m, where m|n indicates that m divides n. A Carmichael sequence has ...
A finite, increasing sequence of integers {n_1,...,n_m} such that sum_(i=1)^m1/(n_i)-product_(i=1)^m1/(n_i) in N. A sequence is a Giuga sequence iff it satisfies ...
n divides a^n-a for all integers a iff n is squarefree and (p-1)|(n-1) for all prime divisors p of n. Carmichael numbers satisfy this criterion.
1 ... 21|22|23|24|25|26|27 ... 46 Previous Next

...