google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 467
Open
ams-11: Number theory
erdos-problems
new conjecture
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 328
Description
### What is the conjecture
https://www.erdosproblems.com/467
Prove the following for all large $x$: there is a choice of congruence classes $a_p$ for all primes $p\leq x$ and a decomposition $\\{p\leq x\\}=A\sqcup B$ into two non-empty sets such that, for all $n
Contributor guide
Assessment
This issue has not been assessed yet.