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.
Issue
疑问、子问题和求助。把大问题拆成子 Issue;从任何一个 Issue 都能开出路线。
没有开放的 Issue
Issue 用来放疑问、子问题和求助。
Find n > 24 such that m + τ(m) ≤ n + 2 for every m < n, where τ counts divisors, or prove that none exists.
疑问、子问题和求助。把大问题拆成子 Issue;从任何一个 Issue 都能开出路线。
Issue 用来放疑问、子问题和求助。