google-deepmind / google-deepmind/formal-conjectures
math.CO/0409509 number 65
Open
new conjecture
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 327
Description
### What is the conjecture
The sequence with start values { $a_1,a_2,\dots,a_s$ } and further values $a_{n>s}$ satisfying: $a_n$ is the smallest number $>a_{n-1}$ that builds no three-term arithmetic progression with any $a_k$, $1\le k
Contributor guide
Research direction
Start by verifying the displayed A_3(1,m,n) conjecture and resolving the issue's 'Status: resolved? Find reference and clarify' note. Confirm the statement and its reference before formalizing it in the repository; done means the conjecture is clarified and added to the Lean collection.
Written by the indexing model from the issue text.
Assessment
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100