Search arXivSearch

arXiv · 1807.04116

Sharp bounds on the number of squares in recurrence sequences and solutions of $X^{2}-\left( a^{2}+b \right) Y^{4}=-b$

Abstract

We obtain best possible results for the number of coprime positive integer solutions of the equation in the title when $a$ is a positive integer, $b=p^{m}$, $2p^{m}$ or $4p^{m}$, where $m$ is a non-negative integer, $p$ is prime, $\gcd \left( a^{2}, b \right)$ is squarefree and $X^{2}- \left( a^{2}+b \right) Y^{2}=-4$ has a solution in positive integers. We prove our results by establishing best possible bounds for the number of distinct squares in certain binary recurrence sequences, including those associated with such equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul M Voutier. 2026-04-16. Sharp bounds on the number of squares in recurrence sequences and solutions of $X^{2}-\left( a^{2}+b \right) Y^{4}=-b$. https://doi.org/10.1007/s40993-026-00712-7

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