Abstract
Our objective is to provide an upper bound for the length ℓN of the longest run of consecutive integers smaller than N which have the same number of divisors. We prove in an elementary way that log ℓN << (log N log log N)λ, where λ=1/2. Using estimates for the Jacobsthal function, we then improve the result to λ=1/3.
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.
