Proofs of Chappelon and Alfons\'{\i}n Conjectures On Square Frobenius Numbers and its Relationship to Simultaneous Pell's Equations
Damanvir Singh Binner

TL;DR
This paper proves conjectures by Chappelon and Alfonsín regarding the square Frobenius number for coprime pairs, revealing a deep connection with solutions to Pell's equations and Farey fraction approximations to √2.
Contribution
It provides the first complete proofs of these conjectures, employing solutions to Pell's equations and analyzing simultaneous Pell's equations.
Findings
Confirmed conjectures for cases where m or n is a perfect square
Established links between Frobenius numbers and Pell's equations
Connected the problem to Farey fraction approximations to √2
Abstract
Recently, Chappelon and Alfons\'{\i}n defined the square Frobenius number of coprime numbers and to be the largest perfect square that cannot be expressed in the form for nonnegative integers and . When and differ by or , they found simple expressions if neither nor is a perfect square. If either or 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 . In this note, we prove these conjectures. Our methods involve solving Pell's equations and . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Tensor decomposition and applications · Advanced Mathematical Identities
