google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 404
Open
ams-11: Number theory
erdos-problems
new conjecture
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 2d 4h
- Merged PRs (30d)
- 363
Description
### What is the conjecture
https://www.erdosproblems.com/404
For which integers $a\geq 1$ and primes $p$ is there a finite upper bound on those $k$ such that there are $a=a_1<\cdots
Contributor guide
Research direction
No file, test, or entry point is named. Start by examining the repository's existing formalized conjectures and the Lean project structure, then use the linked Erdős problem as the specification; done means the conjecture is added as a verified Lean statement with the project's expected supporting material.
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
- Needs clarification
- Newbie friendliness
- 25/100