number-theory / Number Theory, Irrationality

Erdős Problem #267

If $n_1 < n_2 < \cdots$ with $n_{k+1}/n_k \ge c > 1$, must $\sum_k 1/F_{n_k}$ be irrational? The proposed proof closes the range $1 < c < 2$ left open by earlier criteria.

10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

number-theoryJul 13, 2026Significance 10/100Registry: lean verified

Erdős Problem #267

Prior state unknownproved

If $n_1 < n_2 < \cdots$ with $n_{k+1}/n_k \ge c > 1$, must $\sum_k 1/F_{n_k}$ be irrational? The proposed proof closes the range $1 < c < 2$ left open by earlier criteria.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

If $n_1 < n_2 < \cdots$ with $n_{k+1}/n_k \ge c > 1$, must $\sum_k 1/F_{n_k}$ be irrational? The proposed proof closes the range $1 < c < 2$ left open by earlier criteria.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.