Prime factors of dynamical sequences

From MaRDI portal
Publication:3105804




Abstract: Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference x_{n+1}-x_n has a primitive prime factor for all sufficiently large n. This result provides a new proof of the infinitude of primes for each rational function f of degree at least 2.




Cited in
(25)






This page was built for publication: Prime factors of dynamical sequences

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