Using Dynamical Systems to Construct Infinitely Many Primes

2017/08/23 by Granville, Andrew
#11A41 #37F10 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1708.06953

Abstract

Euclid's proof can be reworked to construct infinitely many primes, in many different ways, using ideas from arithmetic dynamics. After acceptance Soundararajan noted the beautiful and fast converging formula: τ= a^1/(d-1) x₀ ⋅ lim_{n→ ∞} ∏_m=1ⁿ (\fracx_max_m-1^d )^1/dm

Related

• There are infinitely many prime numbers in all arithmetic progressions with first term and difference coprime
• Long arithmetic progressions of primes
• Arithmetic progressions and the primes - El Escorial lectures
• Infinitely Many Primes Using Generating Functions
• A Dynamical Proof of the Prime Number Theorem