Search Results for ""

The compositeness test consisting of the application of Fermat's little theorem.

The Diophantine equation x^n+y^n=z^n. The assertion that this equation has no nontrivial solutions for n>2 has a long and fascinating history and is known as Fermat's last ...

A set S is said to be GCD-closed if GCD(x_i,x_j) in S for 1<=i,j<=n.

The Machin-like formula 1/4pi=12cot^(-1)18+8cot^(-1)57-5cot^(-1)239.

The generalized Riemann hypothesis conjectures that neither the Riemann zeta function nor any Dirichlet L-series has a zero with real part larger than 1/2. Compare with ...

The Diophantine equation x^2+y^2=p can be solved for p a prime iff p=1 (mod 4) or p=2. The representation is unique except for changes of sign or rearrangements of x and y. ...

A geometric sequence is a sequence {a_k}, k=0, 1, ..., such that each term is given by a multiple r of the previous one. Another equivalent definition is that a sequence is ...

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

A generalization of the Euler L-function associated with a Grössencharakter.

Two numbers are heterogeneous if their prime factors are distinct. For example, 6=2·3 and 24=2^3·3 are not heterogeneous since their factors are each (2, 3).