Abstract
Recently, Chappelon and Alfons\'ı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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.