Abstract
A Diophantine m-tuple with property D(n), where n is a non-zero integer, is a set of m positive integers {a1,...,am} such that aiaj+n is a perfect square for all 1⩽i<j⩽m. It is known that Mn=sup{|S|:S is a D(n) m-tuple} exists and is O(log|n|). In this paper, we show that the Paley graph conjecture implies that the upper bound can be improved to ≪(log|n|)ϵ, for any ϵ>0.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
