Search Results for ""

An arithmetic progression of primes is a set of primes of the form p_1+kd for fixed p_1 and d and consecutive k, i.e., {p_1,p_1+d,p_1+2d,...}. For example, 199, 409, 619, ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

Topology is the mathematical study of the properties that are preserved through deformations, twistings, and stretchings of objects. Tearing, however, is not allowed. A ...

Twin primes are pairs of primes of the form (p, p+2). The term "twin prime" was coined by Paul Stäckel (1862-1919; Tietze 1965, p. 19). The first few twin primes are n+/-1 ...

The 13 Archimedean solids are the convex polyhedra that have a similar arrangement of nonintersecting regular convex polygons of two or more different types arranged in the ...

The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...

A cubic number is a figurate number of the form n^3 with n a positive integer. The first few are 1, 8, 27, 64, 125, 216, 343, ... (OEIS A000578). The protagonist Christopher ...

The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...

The (complete) gamma function Gamma(n) is defined to be an extension of the factorial to complex and real number arguments. It is related to the factorial by Gamma(n)=(n-1)!, ...