Prime divisors of sequences of integers

Abstract: In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical result which says that a non-degenerate linear recurrence sequence of integers of order k>1 has infinitely many prime divisors.

This page was built for publication: Prime divisors of sequences of integers

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