On the number of residues of linear recurrences
An integer sequence \(\mathbf{s}=(s_{n})_{n\geq0}\) is\ called a linear recurrence relation if there are integers \(c_{1},...,c_{r}\in\mathbb{Z}\) such that for every integer \(n\geq r\), we have \[ s_{n}=c_{1}s_{n-1}+c_{2}s_{n-2}+...+c_{r}s_{n-r}. \] The \(r\) values \(s_{0},...,s_{r-1}\) are called the \textit{initial conditions} of the integer sequence \(\mathbf{s}\), and \[ g(X)=X^{r}-c_{1}X^{r-1}-c_{2}X^{r-2}-...-c_{r} \] is called the \textit{characteristic polynomial} of \(\mathbf{s}\). Let \(g\in\mathbb{Z}[X]\) be any nonconstant monic polynomial. Also, let \(\mathfrak{M}(g)\) be the set of positive integers \(m\) such that there exists an integer linear recurrence relation \((s_{n})_{n\geq0}\) with characteristic polynomial \(g\) and a positive integer \(M\) for which \((s_{n})_{n\geq0}\) has exactly \(m\) distinct residues modulo \(M\). \textit{A. Dubickas} and \textit{A. Novikas} [J. Number Theory 215, 120--137 (2020; Zbl 1473.11039)] have shown that \(\mathfrak{M}(X^{2}-X-1)=\mathbb{N}\). The author of the paper under review examines \(\mathfrak{M}(g)\) in the case in which \(g\) is divisible by a monic quadratic polynomial \(f\in\mathbb{Z}[X]\) with roots \(\alpha,\beta\) such that \(\alpha\beta=\pm1\) and \(\alpha/\beta\) is not a root of unity. Also, the author demonstrates that this problem is pertained to the existence of special primitive divisors of certain Lehmer sequences.
- Linear recurrence sequences without zeros
- scientific article; zbMATH DE number 4158706
- scientific article; zbMATH DE number 3865368
- Pure powers in recurrence sequences and some related diophantine equations
- Distribution of \(0\) and \(1\) in the highest level of primitive sequences over \({\mathbb Z}/(2^ e)\). II.
- On Lucas sequence terms of the form kx^2
- On the factorization of \(X^ n - BX - A\)
- scientific article; zbMATH DE number 4061316
- scientific article; zbMATH DE number 3871451
- Degree k linear recursions mod (p) and number fields
- A Distribution Property for Linear Recurrence of the Second Order
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- scientific article; zbMATH DE number 4179436 (Why is no real title available?)
- scientific article; zbMATH DE number 4033820 (Why is no real title available?)
- scientific article; zbMATH DE number 4065065 (Why is no real title available?)
- scientific article; zbMATH DE number 895347 (Why is no real title available?)
- scientific article; zbMATH DE number 3360232 (Why is no real title available?)
- scientific article; zbMATH DE number 3185064 (Why is no real title available?)
- Linear recurrence sequences without zeros
- Lucas and Lehmer numbers without primitive divisor
- Maximal frequencies of elements in second-order linear recurring sequences over a finite field
- On Divisors of Fermat, Fibonacci, Lucas, and Lehmer Numbers
- On moduli for which certain second-order linear recurrences contain a complete system of residues modulo m
- On moduli for which the Lucas numbers contain a complete residue system
- Primitive divisors of some Lehmer-Pierce sequences
- Recurrence with prescribed number of residues
- Uniform distribution of linear recurring sequences modulo prime powers.
This page was built for publication: On the number of residues of linear recurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065753)