Abstract

We show that for integers n, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is Clog⁡log⁡n, where C=(1−e−γ)−1=2.280... and γ is Euler's constant. We explore several applications and resolve a conjecture of Margenstern about practical numbers.

Full Text
Paper version not known

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 call

Disclaimer: 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.