Search Results for ""

Let p_i denote the ith prime, and write m=product_(i)p_i^(v_i). Then the exponent vector is v(m)=(v_1,v_2,...).

An exponential generating function for the integer sequence a_0, a_1, ... is a function E(x) such that E(x) = sum_(k=0)^(infty)a_k(x^k)/(k!) (1) = ...

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