Search Results for ""

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

Values one step outside the hinges are called inner fences, and values two steps outside the hinges are called outer fences. Tukey calls values outside the outer fences far ...

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

Define G(a,n)=1/aint_0^infty[1-e^(aEi(-t))sum_(k=0)^(n-1)((-a)^k[Ei(-t)]^k)/(k!)]. Then the Flajolet-Odlyzko constant is defined as G(1/2,1)=0.757823011268... (OEIS A143297).

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

Gieseking's constant is defined by G = int_0^(2pi/3)ln(2cos(1/2x))dx (1) = Cl_2(1/3pi) (2) = (3sqrt(3))/4[1-sum_(k=0)^(infty)1/((3k+2)^2)+sum_(k=1)^(infty)1/((3k+1)^2)] (3) = ...