Erdős Problem #320
Prior state unknown→proved
Let $S(N)$ count the distinct values of $\sum_{n\in A} 1/n$ over $A\subseteq\{1,\dots,N\}$. Estimate $S(N)$.
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theory / Number Theory, Unit Fractions
Erdős Problem #320
Let $S(N)$ count the distinct values of $\sum_{n\in A} 1/n$ over $A\subseteq\{1,\dots,N\}$. Estimate $S(N)$.
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
Let $S(N)$ count the distinct values of $\sum_{n\in A} 1/n$ over $A\subseteq\{1,\dots,N\}$. Estimate $S(N)$.
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.