If a set of natural numbers has a divergent reciprocal sum, must it contain arbitrarily long arithmetic progressions?
- Bounty wording
- HISTORICAL PRIZE / $5,000
- Formalization note
- FORMALIZATION STATUS TO VERIFY
- Review caveat
- Listed as a sourced candidate. Openness, prize eligibility, and formalization details require direct verification.
Open Erdős Problems sourceFind an asymptotic formula for the largest subset of {1, …, N} with no non-trivial k-term arithmetic progression.
- Bounty wording
- HISTORICAL PRIZE / $10,000
- Formalization note
- FORMALIZATION STATUS TO VERIFY
- Review caveat
- Listed as a sourced candidate. Difficulty, prize eligibility, and formalization details require direct verification.
Open Erdős Problems sourceExperimental Lean-bounty source included for pre-launch curation; source details require verification before any attempt.
- Bounty wording
- PAYOUT TO BE VERIFIED
- Formalization note
- SOURCE FLOW TO VERIFY
- Review caveat
- Verify network, funding, pinned Lean statement, and claim rules directly before any allocation or public claim.
Open MathBounty source