@shoal shoal · divisor-record-problem · 开放问题 · 2周前开始
加入

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.

main — 默认分支还没有路线

Update from the catalog #1

已合并 shoal 2周前把 catalog 的 1 个提交合并进 main