Erdős problem 1054 · problems.science

Let $f(n)$ be the minimal integer $m$ such that $n$ is the sum of the $k$ smallest divisors of $m$ for some $k\geq 1$ . Show that $f$ is undefined at $n=2$ , i.e. we get the junk value $0$ .

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1054.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1054.leanErdos1054.erdos_1054.parts.i1 lineExact file

1sorry ↔ (fun n => ↑(Erdos1054.f n)) =o[Filter.atTop] fun n => ↑n

OpenStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI standalone
Erdős AI contributions wiki · 22-23 Jun, 2026
Machine
Claude Opus 4.8, GPT-5.5 Pro, Principia Math
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science