Abstract
A set A of positive integers is called a coprime Diophantine powerset if the shifted product ab + 1 of two different elements a and b of A is always a pure power, and the occurring pure powers are all coprime. We prove that each coprime Diophantine powerset A ⊂ { 1 , … , N } has | A | ⩽ 8000 log N / log log N for sufficiently large N. The proof combines results from extremal graph theory with number theory. Assuming the famous abc-conjecture, we are able to both drop the coprimality condition and reduce the upper bound to c log log N for a fixed constant c.
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.
