Hostname: page-component-848d4c4894-4hhp2 Total loading time: 0 Render date: 2024-06-03T07:41:30.872Z Has data issue: false hasContentIssue false
  • English
  • Français

On a sequence of prime numbers

Published online by Cambridge University Press:  09 April 2009

C. D. Cox  and
A. J. Van Der Poorten
C. D. Cox
Affiliation:
School of Mathematics University of N.S.W., Australia
A. J. Van Der Poorten
Affiliation:
School of Mathematics University of N.S.W., Australia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Euclid's scheme for proving the infinitude of the primes generates, amongst others, the following sequence defined by p1 = 2 and pn+1 is the highest prime factor of p1p2…pn+1.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 8 , Issue 3 , August 1968 , pp. 571 - 574
Copyright
Copyright © Australian Mathematical Society 1968