google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 981
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 327
Description
### What is the conjecture
https://www.erdosproblems.com/981
Let $\epsilon>0$ and $f_\epsilon(p)$ be the smallest integer $m$ such that $\sum_{n\leq m}
\left(\frac{n}{p}\right)<\epsilon m$. Prove that
$$\sum_{p0$.
Status: solved
### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else
Contributor guide
Research direction
Read the conjecture at https://www.erdosproblems.com/981 and inspect the formal-conjectures repository for existing Erdős problem entries and contribution conventions. No file or test is named in the issue; done means adding a Lean formalization of the stated conjecture that fits the repository and compiles.
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
- 25/100