Misplaced Pages

Formula for primes: Difference between revisions

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 00:27, 8 August 2007 edit67.142.130.46 (talk) →Another approach using the floor function← Previous edit Revision as of 00:59, 8 August 2007 edit undoPrimeHunter (talk | contribs)Administrators79,302 edits revert latest edit. Very complicated formula with no explanation. Sums 2^n numbers to find nth prime. Must be among the slowest ever if it worksNext edit →
Line 76: Line 76:


:<math>p_n = 1 + \sum_{k=1}^{2(\lfloor n \ln(n)\rfloor+1)} \left(1 - \left\lfloor{\pi(k) \over n} \right\rfloor\right). </math> :<math>p_n = 1 + \sum_{k=1}^{2(\lfloor n \ln(n)\rfloor+1)} \left(1 - \left\lfloor{\pi(k) \over n} \right\rfloor\right). </math>

==== Formula elaborated by Lainé Jean Lhermite Junior ====

<math>P_n = \sum_{i=1}^{2^n}h(i) </math>

visit : http://www.institutionscle.nombrespremiers.net


<math>P_n = \sum_{i=1}^{2^n}\left(\left\lfloor\frac {1+ \sum_{m=1}^{i}{\left( 1-\left\lfloor{\frac{\left\lfloor{\frac{\left(m!\right)^2}{m^3}}\right\rfloor}{\frac{\left(m!\right)^2}{m^3}}}\right\rfloor\right)}}{n+1}\right\rfloor\times{\left\lfloor\frac{n+1}{1+ \sum_{m=1}^{i}{\left( 1-\left\lfloor{\frac{\left\lfloor{\frac{\left(m!\right)^2}{m^3}}\right\rfloor}{\frac{\left(m!\right)^2}{m^3}}}\right\rfloor\right)}}\right\rfloor}\times{i}\times{\left({1-\left\lfloor{\frac{\left\lfloor(\frac{\left(i!\right)^2}{i^3}\right\rfloor}{\frac{\left(i!\right)^2}{i^3}}}\right\rfloor}\right)}\right) </math>


==Other formulas== ==Other formulas==

Revision as of 00:59, 8 August 2007

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 ) ≡ 0 ( mod p ) {\displaystyle P(1)\equiv 0{\pmod {p}}} . But for any k, P ( 1 + k p ) ≡ 0 ( mod p ) {\displaystyle P(1+kp)\equiv 0{\pmod {p}}} also, so P ( 1 + k p ) {\displaystyle 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 + k p ) = P ( 1 ) {\displaystyle 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) = n + 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.

It is known, based on Dirichlet's theorem on arithmetic progressions, that linear polynomial functions L ( n ) = a n + b {\displaystyle 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 ) = a n + b {\displaystyle 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 = 24:

P(n) = 45872132836530n + 468395662504823; prime for all n from 0 to 23.

It is not known whether there exists a univariate polynomial of degree greater 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. Jones et al. (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 = w z + h + j − q {\displaystyle 0=wz+h+j-q}
0 = ( g k + 2 g + k + 1 ) ( h + j ) + h − z {\displaystyle 0=(gk+2g+k+1)(h+j)+h-z}
0 = 16 ( k + 1 ) 3 ( k + 2 ) ( n + 1 ) 2 + 1 − f 2 {\displaystyle 0=16(k+1)^{3}(k+2)(n+1)^{2}+1-f^{2}}
0 = 2 n + p + q + z − e {\displaystyle 0=2n+p+q+z-e}
0 = e 3 ( e + 2 ) ( a + 1 ) 2 + 1 − o 2 {\displaystyle 0=e^{3}(e+2)(a+1)^{2}+1-o^{2}}
0 = ( a 2 − 1 ) y 2 + 1 − x 2 {\displaystyle 0=(a^{2}-1)y^{2}+1-x^{2}}
0 = 16 r 2 y 4 ( a 2 − 1 ) + 1 − u 2 {\displaystyle 0=16r^{2}y^{4}(a^{2}-1)+1-u^{2}}
0 = n + l + v − y {\displaystyle 0=n+l+v-y}
0 = ( a 2 − 1 ) l 2 + 1 − m 2 {\displaystyle 0=(a^{2}-1)l^{2}+1-m^{2}}
0 = a i + k + 1 − l − i {\displaystyle 0=ai+k+1-l-i}
0 = ( ( a + u 2 ( u 2 − a ) ) 2 − 1 ) ( n + 4 d y ) 2 + 1 − ( x + c u ) 2 {\displaystyle 0=((a+u^{2}(u^{2}-a))^{2}-1)(n+4dy)^{2}+1-(x+cu)^{2}}
0 = p + l ( a − n − 1 ) + b ( 2 a n + 2 a − n 2 − 2 n − 2 ) − m {\displaystyle 0=p+l(a-n-1)+b(2an+2a-n^{2}-2n-2)-m}
0 = q + y ( a − p − 1 ) + s ( 2 a p + 2 a − p 2 − 2 p − 2 ) − x {\displaystyle 0=q+y(a-p-1)+s(2ap+2a-p^{2}-2p-2)-x}
0 = z + p l ( a − p ) + t ( 2 a p − p 2 − 1 ) − p m . {\displaystyle 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 − α 1 2 − α 2 2 − ⋯ − α 14 2 ) {\displaystyle (k+2)(1-\alpha _{1}^{2}-\alpha _{2}^{2}-\cdots -\alpha _{14}^{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 10). On the other hand, there also exists such a set of equations of degree only 4, but in 58 variables (Jones 1982).

Formulas using the floor function

Using the floor function ⌊ x ⌋ {\displaystyle \lfloor x\rfloor } (defined to be the largest integer less than or equal to the real number x), one can construct several formulas for the nth prime.

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

⌊ A 3 n ⌋ {\displaystyle \lfloor A^{3^{n}}\;\rfloor }

is a prime number for all positive integers n. The smallest such A has a value of around 1.3063... and is known as Mills's 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

π ( m ) = ∑ j = 2 m sin 2 ⁡ ( π j ( j − 1 ) ! 2 ) sin 2 ⁡ ( π j ) {\displaystyle \pi (m)=\sum _{j=2}^{m}{\frac {\sin ^{2}({\pi \over j}(j-1)!^{2})}{\sin ^{2}({\pi \over j})}}}

or, alternatively,

π ( m ) = ∑ j = 2 m ⌊ ( j − 1 ) ! + 1 j − ⌊ ( j − 1 ) ! j ⌋ ⌋ . {\displaystyle \pi (m)=\sum _{j=2}^{m}\left\lfloor {(j-1)!+1 \over j}-\left\lfloor {(j-1)! \over j}\right\rfloor \right\rfloor .}

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

p n = 1 + ∑ m = 1 2 n ⌊ ⌊ n 1 + π ( m ) ⌋ 1 n ⌋ . {\displaystyle p_{n}=1+\sum _{m=1}^{2^{n}}\left\lfloor \left\lfloor {n \over 1+\pi (m)}\right\rfloor ^{1 \over n}\right\rfloor .}

Another approach using the floor function

Another approach does not use factorials and Wilson's theorem, but also heavily employs the floor function (S. M. Ruiz 2000): first define

π ( k ) = k − 1 + ∑ j = 2 k ⌊ 2 j ( 1 + ∑ s = 1 ⌊ j ⌋ ( ⌊ j − 1 s ⌋ − ⌊ j s ⌋ ) ) ⌋ {\displaystyle \pi (k)=k-1+\sum _{j=2}^{k}\left\lfloor {2 \over j}\left(1+\sum _{s=1}^{\left\lfloor {\sqrt {j}}\right\rfloor }\left(\left\lfloor {j-1 \over s}\right\rfloor -\left\lfloor {j \over s}\right\rfloor \right)\right)\right\rfloor }

and then

p n = 1 + ∑ k = 1 2 ( ⌊ n ln ⁡ ( n ) ⌋ + 1 ) ( 1 − ⌊ π ( k ) n ⌋ ) . {\displaystyle p_{n}=1+\sum _{k=1}^{2(\lfloor n\ln(n)\rfloor +1)}\left(1-\left\lfloor {\pi (k) \over n}\right\rfloor \right).}

Other formulas

The following function yields all the primes, and only primes, for non-negative integers n:

f ( n ) = 2 + ( 2 n ! mod ⁡ ( n + 1 ) ) . {\displaystyle f(n)=2+(2n!\,\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.)

References

  • Jones, James P.; Sato, Daihachiro; Wada, Hideo; Wiens, Douglas (1976), "Diophantine representation of the set of prime numbers", American Mathematical Monthly, 83: 449–464.
  • Jones, James P. (1982), "Universal diophantine equation", Journal of Symbolic Logic, 47: 549–571.

External links

Category:
Formula for primes: Difference between revisions Add topic