Skip to content

Erdős problem 647

Start work

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

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:8baf4bd2612b4b6ce1a0076ccb27b89802f0656d494c2bab2c35a10bdf4de729
Metadata
sha256:d607e4682276e416568ddd2e9f01c9ab43f6f5233f1735d11908ca34c988c469
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:d9ade7ac9a1e906d79497ee19402654976b4feb85e80e0adcd2ca6a954e32ed1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON