2011Journal für die reine und angewandte Mathematik (Crelles Journal)Open access

Prime factors of dynamical sequences

Xander Faber, Andrew Granville

Open full text 1 citations

Abstract

Let ( t ) ( t ) have degree d 2. For a given rational number x 0 , define x n 1 ( x n ) for each n 0. If this sequence is not eventually periodic, and if does not lie in one of two explicitly determined affine conjugacy classes of rational functions, then x n 1 x n has a primitive prime factor in its numerator for all sufficiently large n . The same result holds for the exceptional maps provided that one looks for primitive prime factors in the denominator of x n 1 x n . Hence the result for each rational function of degree at least 2 implies (a new proof) that there are infinitely many primes. The question of primitive prime factors of x n x n is also discussed for uniformly bounded.

Open-access reader

About this research paper

What this paper is about

Let ( t ) ( t ) have degree d 2. For a given rational number x 0 , define x n 1 ( x n ) for each n 0. If this sequence is not eventually periodic, and if does not lie in one of two explicitly determined affine conjugacy classes of rational functions, then x n 1 x n has a primitive prime factor in its numerator for all sufficiently large n . The same result holds for the exceptional maps provided that one looks for primitive prime factors in the denominator of x n 1 x n . Hence the result for each rational function of degree at least 2 implies (a new proof) that there are infinitely many primes. The question of primitive prime factors of x n x n is also discussed for uniformly bounded.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let ( t ) ( t ) have degree d 2. For a given rational number x 0 , define x n 1 ( x n ) for each n 0. If this sequence is not eventually periodic, and if does not lie in one of two explicitly determined affine conjugacy classes of rational functions, then x n 1 x n has a primitive prime factor in its numerator for all sufficiently large n . The same result holds for the exceptional maps provided that one looks for primitive prime factors in the denominator of x n 1 x n . Hence the result for each rational function of degree at least 2 implies (a new proof) that there are infinitely many primes. The question of primitive prime factors of x n x n is also discussed for uniformly bounded.

Key concepts: Prime (order theory), Degree (music), Mathematics, Rational function, Integer (computer science), Combinatorics, Function (biology), Sequence (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
Prime factors of dynamical sequences — Research Paper | ScholarLens