Improved upper bounds on Diophantine tuples with the property D(n)
Abstract
Let n be a non-zero integer. A set S of positive integers is a Diophantine tuple with the property D(n) if ab+n is a perfect square for each a,b ∈ S with a ≠ b. It is of special interest to estimate the quantity Mn, the maximum size of a Diophantine tuple with the property D(n). In this notes, we show the contribution of intermediate elements is O( |n|), improving a result by Dujella. As a consequence, we deduce that Mn≤ (2+o(1)) |n|, improving the best-known upper bound on Mn by Becker and Murty.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.