Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the number of residues of certain second-order linear recurrences

Published 15 Jan 2024 in math.NT | (2401.07661v1)

Abstract: For every monic polynomial $f \in \mathbb{Z}[X]$ with $\operatorname{deg}(f) \geq 1$, let $\mathcal{L}(f)$ be the set of all linear recurrences with values in $\mathbb{Z}$ and characteristic polynomial $f$, and let \begin{equation*} \mathcal{R}(f) := \big{\rho(\mathbf{x}; m) : \mathbf{x} \in \mathcal{L}(f), \, m \in \mathbb{Z}+ \big} , \end{equation*} where $\rho(\mathbf{x}; m)$ is the number of distinct residues of $\mathbf{x}$ modulo $m$. Dubickas and Novikas proved that $\mathcal{R}(X2 - X - 1) = \mathbb{Z}+$. We generalize this result by showing that $\mathcal{R}(X2 - a_1 X - 1) = \mathbb{Z}+$ for every nonzero integer $a_1$. As a corollary, we deduce that for all integers $a_1 \geq 1$ and $k \geq 4$ there exists $\xi \in \mathbb{R}$ such that the sequence of fractional parts $\big(!\operatorname{frac}(\xi \alphan)\big)_{n \geq 0}$, where $\alpha := \big(a_1 + \sqrt{a_12 + 4}\,\big) / 2$, has exactly $k$ limit points. Our proofs are constructive and employ some results on the existence of special primitive divisors of certain Lehmer sequences.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.