Authors and affiliations
It is shown that prime sequences of arbitrary length, of which the prime pairs, (p, p+2), the prime triplet conjecture, (p, p+2, p+6) are simple examples, are true and that prime sequences of arbitrary length can be found and shown to repeat indefinitely. Asymptotic formulae comparable to the prime number theorem are derived for arbitrary length sequences. An elementary proof is also derived for the prime number theorem and Dirichlet’s Theorem on the arithmetic progression of primes.
- Everest, G., & Ward, T. (2005) An Introduction to Number Theory. Springer-Verlag, London.
- Hardy, G.H., & Wright, E.M. (1959) An Introduction to the Theory of Numbers. Oxford University Press, London.
- Oliveira e Silva, T. (2008). “Tables of values of pi(x) and of pi2(x)”, Aveiro University. http://sweet.ua.pt/tos/primes.html (retrieved 7 January 2011).
Cite this paperAPA
Garvie, C. L. (2016). Asymptotic formulae for the number of repeating prime sequences less than N. Notes on Number Theory and Discrete Mathematics, 22(4), 29-40.Chicago
Garvie, Christopher L. “Asymptotic Formulae for the Number of Repeating Prime Sequences less than N.” Notes on Number Theory and Discrete Mathematics 22, no. 4 (2016): 29-40.MLA
Garvie, Christopher L. “Asymptotic Formulae for the Number of Repeating Prime Sequences less than N.” Notes on Number Theory and Discrete Mathematics 22.4 (2016): 29-40. Print.