prime difference function
The prime difference function is an arithmetic function for any positive integer n, denoted as dn and gives the difference
between two consecutive primes pn and pn+1:
dn≡pn+1-pn. |
For example:
-
•
d1=p2-p1=3-2=1,
-
•
d10=p11-p10=31-29=2,
-
•
d100=p101-p100=547-541=6,
-
•
d1000=p1001-p1000=7927-7919=8,
-
•
d10000=p10001-p10000=104743-104729=14 and so forth.
The first few values of dn for n=1,2,3,… are
1,2,2,4,2,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,…
(http://www.research.att.com/ njas/sequences/eisA.cgi?Anum=001223OEIS A001223).
Title | prime difference function |
---|---|
Canonical name | PrimeDifferenceFunction |
Date of creation | 2013-03-22 12:49:16 |
Last modified on | 2013-03-22 12:49:16 |
Owner | XJamRastafire (349) |
Last modified by | XJamRastafire (349) |
Numerical id | 6 |
Author | XJamRastafire (349) |
Entry type | Definition |
Classification | msc 11N05 |
Classification | msc 11A25 |
Classification | msc 11A41 |