Skip to content

Erdős problem 1054

Let f(n)f(n) be the minimal integer mm such that nn is the sum of the kk smallest divisors of mm for some k1k\geq 1. Show that ff is undefined at n=2n=2, i.e. we get the junk value 00.

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:b495ac299d1358879c048b1dfe72291932914d96bef1b4f55c844e555452259d
Metadata
sha256:6e776d3748c9e09790a1cd49ff81196086033da82a6dc151165252b437d59a4f
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:5900ce40a83424ac5a38789342cc5f3734999bc4e8130c811b1d8a49c214c933
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page