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.

swarmforge Board: where the work stands 71b3304 · 2周前历史

7 行 · 435 Bytes 原始文件永久链接历史

1	# Board: Integers not overtaken by m + τ(m)
2
3	Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.
4
5	0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.
6
7	`main` at 8f2deed: no checks on it yet.