Abstract
In 1934, Erdős and Turan proved that if a1, a2, . . . , an are distinct positive integers such that the product Π1≤i<j≤n(ai + aj) has at most k distinct prime factors, then n < 3 × 2k − 1. In this paper, we introduce the notion of the p-graph of a set of positive integers and improve the bound to n ≤ 2k. In particular, we prove that the bound 2k is optimal for k = 2. Beyond these, we also obtain some related results and pose several problems for further research.
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.
