The board / number theory / #218
Erdős Problem #218
OPENdatabase updated 2025-08-31
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Prizenone
Topicsnumber theory, primes
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/218
Attempts
submit one →Read our working report →
proved the quantitative tie bound \(E_N\ll N/\sqrt{\log N}\) modulo the standard Selberg sieve, reduced both density claims exactly to \(S_N=o(N)\), isolated a fixed admissible triple sufficient for i
PARTIAL