Formula for primes

Formula for primes

In mathematics, a formula for primes is a formula generating the prime numbers, exactly and without exception. No easily-computable such formula is known. A great deal is known about what, more precisely, such a "formula" can and cannot be.

Prime formulas and polynomial functions

It is known that no non-constant polynomial function "P"("n") exists that evaluates to a prime number for all integers "n". The proof is simple: Suppose such a polynomial existed. Then "P"(1) would evaluate to a prime "p", so P(1) equiv 0 pmod p. But for any "k", P(1+kp) equiv 0 pmod p also, so P(1+kp) cannot also be prime (as it would be divisible by "p") unless it were "p" itself, but the only way P(1+kp) = P(1) for all "k" is if the polynomial function is constant.

Using more algebraic number theory, one can show an even stronger result: no non-constant polynomial function "P"("n") exists that evaluates to a prime number for almost all integers "n".

Euler first noticed (in 1772) that the quadratic polynomial:"P(n) = n2 + n + 41"is prime for all non-negative integers less than 40. The primes for n = 0, 1, 2, 3... are 41, 43, 47, 53, 61, 71... The differences between the terms are 2, 4, 6, 8, 10... For n = 40, it produces a square number, 1681, which is equal to 41×41, the smallest composite number for this formula. In fact if 41 divides "n" it divides "P(n)" too. The phenomenon is related to the Ulam spiral, which is also implicitly quadratic, and the class number;this polynomial is related to the Heegner number 163=4cdot 41-1, and there are analogous polynomials for p=2, 3, 5, 11, mbox{ and } 17, corresponding to other Heegner numbers.

It is known, based on Dirichlet's theorem on arithmetic progressions, that linear polynomial functions L(n) = an + b produce infinitely many primes as long as "a" and "b" are relatively prime (though no such function will assume prime values for all values of "n"). Moreover, the Green-Tao theorem says that for any "k" there exists a pair of "a" and "b" with the property that L(n) = an+b is prime for any "n" from 0 to "k"−1. However, the best known result of such type is for "k" = 25::6171054912832631 + 81737658082080"n" is prime for all "n" from 0 to 24 harv|Andersen|2008.

It is not known whether there exists a univariate polynomial of degree at least 2 that assumes an infinite number of values that are prime.

Formula based on a system of Diophantine equations

A set of Diophantine equations in 26 variables can be used to obtain primes. Harvtxt|Jones|Sato|Wada|Wiens|1976 proved that a given number "k" + 2 is prime if and only if the following system of 14 Diophantine equations has a solution in the natural numbers:

:0 = wz + h + j - q:0 = (gk + 2g + k + 1)(h + j) + h - z:0 = 16(k + 1)^3(k + 2)(n + 1)^2 + 1 - f^2:0 = 2n + p + q + z - e:0 = e^3(e + 2)(a + 1)^2 + 1 - o^2:0 = (a^2 - 1)y^2 + 1 - x^2:0 = 16r^2y^4(a^2 - 1) + 1 - u^2:0 = n + l + v - y:0 = (a^2 - 1)l^2 + 1 - m^2:0 = ai + k + 1 - l - i:0 = ((a + u^2(u^2 - a))^2 - 1)(n + 4dy)^2 + 1 - (x + cu)^2:0 = p + l(a - n - 1) + b(2an + 2a - n^2 - 2n - 2) - m:0 = q + y(a - p - 1) + s(2ap + 2a - p^2 - 2p - 2) - x:0 = z + pl(a - p) + t(2ap - p^2 - 1) - pm.

This can be used to produce a prime-generating polynomial. Denote the right-hand sides of the above equations by α1, …, α14. Then : (k+2)(1-alpha_1^2-alpha_2^2-cdots-alpha_{14}^2) ie:: (k+2)(1 - ( wz + h + j - q)^2 - ( (gk + 2g + k + 1)(h + j) + h - z)^2 - ( 16(k + 1)^3(k + 2)(n + 1)^2 + 1 - f^2)^2 - ( 2n + p + q + z - e)^2 - ( e^3(e + 2)(a + 1)^2 + 1 - o^2)^2 - ( (a^2 - 1)y^2 + 1 - x^2)^2 - ( 16r^2y^4(a^2 - 1) + 1 - u^2)^2 - ( n + l + v - y)^2 - ( (a^2 - 1)l^2 + 1 - m^2)^2 - ( ai + k + 1 - l - i)^2 - ( ((a + u^2(u^2 - a))^2 - 1)(n + 4dy)^2 + 1 - (x + cu)^2)^2 - ( p + l(a - n - 1) + b(2an + 2a - n^2 - 2n - 2) - m)^2 - ( q + y(a - p - 1) + s(2ap + 2a - p^2 - 2p - 2) - x)^2 - ( z + pl(a - p) + t(2ap - p^2 - 1) - pm)^2) is a polynomial in 26 variables, and the set of prime numbers is identical to the set of positive values taken on by this polynomial as the variables "a", "b", …, "z" range over the nonnegative integers.

A general theorem of Matiyasevich says that if a set is defined by a system of Diophantine equations, it can also be defined by a system of Diophantine equations in only 9 variables. Hence, there is a prime-generating polynomial as above with only 10 variables. However, its degree is large (in the order of 1045). On the other hand, there also exists such a set of equations of degree only 4, but in 58 variables harv|Jones|1982.

Formulas using the floor function

Using the floor function lfloor x floor (defined to be the largest integer less than or equal to the real number "x"), one can construct several formulas that take only prime numbers as values for all positive integers "n".

Mills's formula

The first such formula known was established in 1947 by W. H. Mills, who proved that there exists a real number "A" such that

:lfloor A^{3^{n; floor

is a prime number for all positive integers "n". If the Riemann hypothesis is true, then the smallest such "A" has a value of around 1.3063... and is known as Mills' constant. This formula has no practical value, because very little is known about the constant (not even whether it is rational), and there is no known way of calculating the constant without finding primes in the first place.

Floor function formulas based on Wilson's theorem

By using Wilson's theorem, we may generate several other formulas, given below. These formulas also have little practical value: most primality tests are far more efficient.

In general, we may define :pi(m) = sum_{j=2}^m frac { sin^2 ( {pi over j} (j-1)!^2 ) }{ sin^2( {pi over j} ) }or, alternatively,:pi(m) = sum_{j=2}^m leftlfloor {(j-1)! + 1 over j} - leftlfloor{(j-1)! over j} ight floor ight floor.

These definitions are equivalent; π("m") is the number of primes less than or equal to "m". The "n"-th prime number "p""n" can then be written as

:p_n = 1 + sum_{m=1}^{2^n} leftlfloor leftlfloor { n over 1 + pi(m) } ight floor^{1 over n} ight floor.

A formula by C. P. Willans harv|Bowyer|n.d.::f(j) = leftlfloor cos^2 left( pi{(j-1)!+1 over j} ight) ight floor."f"("j") is 1 if "j" is prime and 0 otherwise. This can be used to build a formula for π("m") or "p""n".

Another approach using the floor function

Another approach, by Sebastián Martín-Ruiz, does not use factorials and Wilson's theorem, but also heavily employs the floor function harv|Rivera|n.d.: first define:pi(k) = k - 1 + sum_{j=2}^k leftlfloor {2 over j} left(1 + sum_{s=1}^{leftlfloorsqrt{j} ight floor} left(leftlfloor{ j-1 over s} ight floor - leftlfloor{j over s} ight floor ight) ight) ight floor

and then

:p_n = 1 + sum_{k=1}^{2(lfloor n ln(n) floor+1)} left(1 - leftlfloor{pi(k) over n} ight floor ight).

Recurrence relation

Another prime generator is defined by the recurrence relation: a_n = a_{n-1} + operatorname{gcd}(n,a_{n-1}), quad a_1 = 7, where gcd("x", "y") denotes the greatest common divisor of "x" and "y". The sequence of differences "a""n" + 1 − "an" starts with 1, 1, 1, 5, 3, 1, 1, 1, 1, 11, 3, 1, 1 OEIS|id=A132199. harvtxt|Rowlands|2008 proved that this sequence contains only ones and prime numbers.

Other formulas

The following function yields all the primes, and only primes, for non-negative integers "n"::f(n) = 2 + (2(n!) ,operatorname{mod} (n+1)).

This formula is based on Wilson's theorem; the number two is generated many times and all other primes are generated exactly once by this function. (In fact a prime "p" is generated for "n" = ("p" − 1) and 2 otherwise; that is, 2 is generated when "n" + 1 is composite.)

ee also

* FRACTRAN

References


*.
*.
*.
*.
*.
*.

External links

*
*
*
*A Venugopalan. "Formula for primes, twinprimes, number of primes and number of twinprimes". Proceedings of the Indian Academy of Sciences – Mathematical Sciences, Vol. 92, No 1, September 1983, pp. 49-52. Page [http://www.ias.ac.in/jarch/mathsci/92/00000050.pdf 49] , [http://www.ias.ac.in/jarch/mathsci/92/00000051.pdf 50] , [http://www.ias.ac.in/jarch/mathsci/92/00000052.pdf 51] , [http://www.ias.ac.in/jarch/mathsci/92/00000053.pdf 52] , [http://www.ias.ac.in/jarch/mathsci/93/00000068.pdf errata] .


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Proof of the Euler product formula for the Riemann zeta function — We will prove that the following formula holds::egin{align} zeta(s) = 1+frac{1}{2^s}+frac{1}{3^s}+frac{1}{4^s}+frac{1}{5^s}+ cdots = prod {p} frac{1}{1 p^{ s end{align}where zeta; denotes the Riemann zeta function and the product extends over… …   Wikipedia

  • Smith–Minkowski–Siegel mass formula — In mathematics, the Smith–Minkowski–Siegel mass formula (or Minkowski–Siegel mass formula) is a formula for the sum of the weights of the lattices (quadratic forms) in a genus, weighted by the reciprocals of the orders of their automorphism… …   Wikipedia

  • On the Number of Primes Less Than a Given Magnitude — Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse (Usual English translation: On the Number of Primes Less Than a Given Magnitude) is a seminal 8 page paper by Bernhard Riemann published in the November 1859 edition of the… …   Wikipedia

  • Proof that the sum of the reciprocals of the primes diverges — In the third century BC, Euclid proved the existence of infinitely many prime numbers. In the 18th century, Leonhard Euler proved a stronger statement: the sum of the reciprocals of all prime numbers diverges. Here, we present a number of proofs… …   Wikipedia

  • Divergence of the sum of the reciprocals of the primes — The sum of the reciprocals of all prime numbers diverges, that is: This was proved by Leonhard Euler in 1737, and strengthens Euclid s 3rd century BC result that there are infinitely many prime numbers. There is a variety of proofs of Euler s… …   Wikipedia

  • Riemann-von Mangoldt formula — In mathematics, the Riemann von Mangoldt formula, named for Bernhard Riemann and Hans Carl Friedrich von Mangoldt, states that the number N ( T ) of zeros of the Riemann zeta function with imaginary part greater than 0 and less than or equal to T …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Mersenne prime — Named after Marin Mersenne Publication year 1536[1] Author of publication Regius, H. Number of known terms 47 Conjectured number of terms Infinite …   Wikipedia

  • Cullen number — In mathematics, a Cullen number is a natural number of the form n · 2n + 1 (written Cn). Cullen numbers were first studied by Fr. James Cullen in 1905. Cullen numbers are special cases of Proth numbers. Properties In 1976 Christopher Hooley… …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”