Prime divisors of nonlinear recurrent sequences. (Q1823971)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1823971 |
scientific article; zbMATH DE number 4116609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Prime divisors of nonlinear recurrent sequences. |
scientific article; zbMATH DE number 4116609 |
Statements
Prime divisors of nonlinear recurrent sequences. (English)
0 references
1987
0 references
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.
0 references
nonlinear recurrences
0 references
finite number of prime divisors
0 references
0.8574866652488708
0 references
0.8240388035774231
0 references