Using Dynamical Systems to Construct Infinitely Many Primes

DOI10.1080/00029890.2018.1447732MaRDI QIDQ4577088zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrew Granville

Publication date 11 July 2018

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.06953

Mathematics Subject Classification ID

Primes (11A41) Arithmetic and non-Archimedean dynamical systems involving polynomial and rational maps (37P05)

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: ${\displaystyle }$ au = a^{1/(d-1)} x_0 cdot lim_{n o infty} prod_{m=1}^n left(frac{x_m}{ax_{m-1}^d} ight)^{1/d^m} ${\displaystyle }$

Recommendations

• Toward a dynamical model for prime numbers
• A Dynamical Proof of the Prime Number Theorem
• A dynamical system linked to the sequence of prime numbers
• Dynamical systems on arithmetic functions determined by primes
• Dynamics of a function related to the primes
• A fractal proof of the infinitude of primes
• Diophantine sequences containing an infinite number of primes
• Fractals and discrete dynamics associated to prime numbers
• scientific article; zbMATH DE number 7198769
• Prime factors of dynamical sequences

Cites work

• \(ABC\) implies primitive prime divisors in arithmetic dynamics
• A prime-representing function
• scientific article; zbMATH DE number 529985 (Why is no real title available?)
• scientific article; zbMATH DE number 5171555 (Why is no real title available?)
• Infinite Coprime Sequences
• Primitive divisors in arithmetic dynamics
• The arithmetic of dynamical systems

Cited in

(1)

• A Dynamical Proof of the Prime Number Theorem

This page was built for publication: Using Dynamical Systems to Construct Infinitely Many Primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577088)