Abstract
It has been known since Erdős that the sum of 1/(nlogn) over numbers n with exactly k prime factors (with repetition) is bounded as k varies. We prove that as k tends to infinity, this sum tends to 1. Banks and Martin have conjectured that these sums decrease monotonically in k, and in earlier papers this has been shown to hold for k up to 3. However, we show that the conjecture is false in general, and in fact a global minimum occurs at k=6.
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.
