Search Results for ""

There are two related conjectures, each called the twin prime conjecture. The first version states that there are an infinite number of pairs of twin primes (Guy 1994, p. ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...

The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...

A double integral is a two-fold multiple integral. Examples of definite double integrals evaluating to simple constants include int_0^1int_0^1(dxdy)/(1-x^2y^2) = 1/8pi^2 (1) ...

Given a positive integer m>1, let its prime factorization be written m=p_1^(a_1)p_2^(a_2)p_3^(a_3)...p_k^(a_k). (1) Define the functions h(n) and H(n) by h(1)=1, H(1)=1, and ...

The polyhedral formula generalized to a surface of genus g, V-E+F=chi(g) where V is the number of polyhedron vertices, E is the number of polyhedron edges, F is the number of ...

In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...

For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.

A Kapteyn series is a series of the form sum_(n=0)^inftyalpha_nJ_(nu+n)[(nu+n)z], (1) where J_n(z) is a Bessel function of the first kind. Examples include Kapteyn's original ...

The function f_theta(z)=z/((1+e^(itheta)z)^2) (1) defined on the unit disk |z|<1. For theta in [0,2pi), the Köbe function is a schlicht function f(z)=z+sum_(j=2)^inftya_jz^j ...