google-deepmind / google-deepmind/formal-conjectures
Green's Open Problems #59
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 327
Description
### What is the conjecture
https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf#problem.59
Is every $n \leq N$ the sum of two integers, all of whose prime factors are at most $N^\varepsilon$?
### [AMS categories](https://github.com/google-deepmind/formal-conjectures/labels?q=ams-)
* ams-11
### Choose either option
- [ ] I plan on adding this conjecture to the repository
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else
Contributor guide
Research direction
Start with Green's Open Problems PDF, specifically problem 59, and inspect the repository's existing formalized conjecture statements for the expected style. Formalize the stated conjecture in Lean and verify that the resulting statement is accepted by the repository; completion means the conjecture has been added as a compiling formal statement.
Written by the indexing model from the issue text.
Assessment
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100