Search Results for "Lucas Lehmer Primality Test"

A primitive Pythagorean triple is a Pythagorean triple (a,b,c) such that GCD(a,b,c)=1, where GCD is the greatest common divisor. A right triangle whose side lengths give a ...

Baer's criterion, also known as Baer's test, states that a module M over a unit ring R is injective iff every module homomorphism from an ideal of R to M can be extended to a ...

A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...

Also known as the alternating series test. Given a series sum_(n=1)^infty(-1)^(n+1)a_n with a_n>0, if a_n is monotonic decreasing as n->infty and lim_(n->infty)a_n=0, then ...

The Lehmer-Mahler is the following integral representation for the Legendre polynomial P_n(x): P_n(costheta) = 1/piint_0^pi(costheta+isinthetacosphi)^ndphi (1) = ...

A point of a function or surface which is a stationary point but not an extremum. An example of a one-dimensional function with a saddle point is f(x)=x^3, which has f^'(x) = ...

The tower of Hanoi (commonly also known as the "towers of Hanoi"), is a puzzle invented by E. Lucas in 1883. It is also known as the Tower of Brahma puzzle and appeared as an ...

A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...