Search arXivSearch

arXiv · 1703.10047

Distribution of integral values for the ratio of two linear recurrences

Abstract

Let $F$ and $G$ be linear recurrences over a number field $\mathbb{K}$, and let $\mathfrak{R}$ be a finitely generated subring of $\mathbb{K}$. Furthermore, let $\mathcal{N}$ be the set of positive integers $n$ such that $G(n) \neq 0$ and $F(n) / G(n) \in \mathfrak{R}$. Under mild hypothesis, Corvaja and Zannier proved that $\mathcal{N}$ has zero asymptotic density. We prove that $\#(\mathcal{N} \cap [1, x]) \ll x \cdot (\log\log x / \log x)^h$ for all $x \geq 3$, where $h$ is a positive integer that can be computed in terms of $F$ and $G$. Assuming the Hardy-Littlewood $k$-tuple conjecture, our result is optimal except for the term $\log \log x$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carlo Sanna. 2017-03-29. Distribution of integral values for the ratio of two linear recurrences. https://doi.org/10.1016/j.jnt.2017.04.015

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT