Erdős problem 647 · problems.science

Let $\tau(n)$ count the number of divisors of $n$ . Is there some $n > 24$ such that $\max_{m < n}(m + \tau(m)) \leq n + 2?$

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:8baf4bd2612b4b6ce1a0076ccb27b89802f0656d494c2bab2c35a10bdf4de729
Metadata: sha256:d607e4682276e416568ddd2e9f01c9ab43f6f5233f1735d11908ca34c988c469
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:d9ade7ac9a1e906d79497ee19402654976b4feb85e80e0adcd2ca6a954e32ed1

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207