Abstract
Motivated by the gentle exploration of the distribution of prime numbers typical of an undergraduate number theory course, as well as by a recent breakthrough result in arithmetic combinatorics, we explore connections between the counting function, which counts the number of elements up to a threshold x, and the reciprocal sum function, which adds the reciprocals of the elements up to a threshold x, for subsets of the natural numbers.
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.
