Integers not overtaken by m + τ(m)
Find n > 24 such that m + τ(m) ≤ n + 2 for every m < n, where τ counts divisors, or prove that none exists.
Update from the catalog #1
Merged
Find n > 24 such that m + τ(m) ≤ n + 2 for every m < n, where τ counts divisors, or prove that none exists.