Prime divisors of nonlinear recurrent sequences.
Given a linear recurrence sequence of rational integers \(\{\) u(n)\(\}\), \(n\in {\mathbb{N}}\), a derived rational integer sequence \(\{\) a(n)\(\}\) is defined by an initial condition and \(a(n+1)=P(a(n))+u(n),\) where P is a polynomial with integer coefficients. The natural number m is a divisor of the sequence \(\{\) a(n)\(\}\) if m divides at least one nonzero term of the sequence. The author establishes a characterization of those sequences which have only a finite number of prime divisors. This extends early work of \textit{G. Polya} [J. Reine Angew. Math. 151, 1-31 (1921; JFM 47.0276.02)] who took \(\{\) a(n)\(\}\) itself to be a linear recurrence sequence.
- Diviseurs premiers de suites récurrentes linéaires. (Prime divisors of linear recurrence sequences)
- Around Pólya's theorem on the set of prime divisors of a linear recurrence
- scientific article; zbMATH DE number 4033816
- Rekurrente Folgen mit lokal gleichmäßig beschränkter Primteileranzahl
- scientific article; zbMATH DE number 3950608
- Diviseurs premiers de suites récurrentes linéaires. (Prime divisors of linear recurrence sequences)
- On linear recursions with nonnegative coefficients
- Rekurrente Folgen mit lokal gleichmäßig beschränkter Primteileranzahl
- Around Pólya's theorem on the set of prime divisors of a linear recurrence
- Divisibility properties of certain recurrent sequences
This page was built for publication: Prime divisors of nonlinear recurrent sequences.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823971)
