Search Results for ""

The Greek problems of antiquity were a set of geometric problems whose solution was sought using only compass and straightedge: 1. circle squaring. 2. cube duplication. 3. ...

A Pierpont prime is a prime number of the form p=2^k·3^l+1. The first few Pierpont primes are 2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, ... ...

Rather surprisingly, trigonometric functions of npi/17 for n an integer can be expressed in terms of sums, products, and finite root extractions because 17 is a Fermat prime. ...

Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...

The sine function sinx is one of the basic functions encountered in trigonometry (the others being the cosecant, cosine, cotangent, secant, and tangent). Let theta be an ...

There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...

Let the divisor function d(n) be the number of divisors of n (including n itself). For a prime p, d(p)=2. In general, sum_(k=1)^nd(k)=nlnn+(2gamma-1)n+O(n^theta), where gamma ...

The Jacobi theta functions are the elliptic analogs of the exponential function, and may be used to express the Jacobi elliptic functions. The theta functions are ...

The largest value of a set, function, etc. The maximum value of a set of elements A={a_i}_(i=1)^N is denoted maxA or max_(i)a_i, and is equal to the last element of a sorted ...

"The" Smarandache constant is the smallest solution to the generalized Andrica's conjecture, x approx 0.567148 (OEIS A038458). The first Smarandache constant is defined as ...