HackerPapers

arXiv:1605.08929math.NT

A variant of the Euclid-Mullin sequence containing every prime

Andrew R. Booker

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We consider a generalization of Euclid's proof of the infinitude of primes and show that it leads to variants of the Euclid-Mullin sequence that provably contain every prime number.

arXiv comments
5 pages, submitted
Journal reference
Journal of Integer Sequences, Volume 19 (2016), Article 16.6.4
DOI
Subjects
math.NTNumber Theory

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2019 to May 2019.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. A Curious Sequence of Prime Numbers 1 comment

    • A way less interesting comment on the Euclid–Mullin sequence, for anyone who's just learned about it in a math class: it is common to take away the wrong lesson "the product of all the primes so far, plus 1, is always prime." (Even if it's totally obvious to you that this is…

      JadeNBView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.