Search arXivSearch

arXiv · 2112.15474

Proofs of Chappelon and Alfons\'ın Conjectures On Square Frobenius Numbers and its Relationship to Simultaneous Pell's Equations

Abstract

Recently, Chappelon and Alfons\'ın defined the square Frobenius number of coprime numbers $m$ and $n$ to be the largest perfect square that cannot be expressed in the form $mx+ny$ for nonnegative integers $x$ and $y$. When $m$ and $n$ differ by $1$ or $2$, they found simple expressions if neither $m$ nor $n$ is a perfect square. If either $m$ or $n$ is a perfect square, they formulated some interesting conjectures which have an unexpected close connection with a known recursive sequence, related to the denominators of Farey fraction approximations to $\sqrt{2}$. In this note, we prove these conjectures. Our methods involve solving Pell's equations $x^2-2y^2=1$ and $x^2-2y^2=-1$. Finally, to complete our proofs of these conjectures, we eliminate several cases using a bunch of results related to solutions of simultaneous Pell's equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Damanvir Singh Binner. 2021-12-31. Proofs of Chappelon and Alfons\'ın Conjectures On Square Frobenius Numbers and its Relationship to Simultaneous Pell's Equations. https://arxiv.org/abs/2112.15474

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