Vela

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_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

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

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 15ea590e8d20dc102c3a6ff9bbf9545d5f2147f564d32f0e9ff65bde576a3d17

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.