Runs of Consecutive Integers Having the Same Number of Divisors

Authors

Abstract: Our objective is to provide an upper bound for the length

e l l_{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

l o g e l l_{N} l l (l o g N l o g l o g N)^{l} a m b d a

, where

l a m b d a = 1 / 2

. Using estimates for the Jacobsthal function, we then improve the result to

l a m b d a = 1 / 3

.

This page was built for publication: Runs of Consecutive Integers Having the Same Number of Divisors