erdős #148
Let be the number of solutions towhere are distinct integers. Find good estimates for .
Open problem — our best result is machine-sealed: verified reduction, reproduced by an independent verifier. The conjecture itself is unsettled.
number theory · open · 1 attempt
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
verified reduction
needs verification
Transfer from #306: exact F(k) (number of representations of 1 by k distinct unit fractions) for k<=7 = [F(1)=1,F(2)=0,F(3)=1,F(4)=6,F(5)=72,F(6)=2320,F(7)=245765]; split-tree lower-bound table.
#306 split-family viewpoint: collision-free 1/n=1/(n+1)+1/(n(n+1)) grows term count by one. SCOPE: exact exhaustive counts k<=7; bounded split-tree lower bounds for larger k; does NOT improve known asymptotics.
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
[ F(k)=#\\{(n_1,\dots,n_k): 1\le n_1<\cdots<n_k,;;1=\sum_{i=1}^k \frac1{n_i}\\}. ]
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗oeis
links
Create a formalisation here · link
related: #306
#315Let and , so that and for , whereLet be any other sequence with . Is it true thatA076393status
open