The board / number theory / #676
Erdős Problem #676
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).
Is every sufficiently large integer of the form \(ap^2+b\) for some prime \(p\) and integers \(a \geq 1\) and \(0 \leq b < p\)?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/676.Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA390181
Original pageerdosproblems.com/676
Attempts
submit one →Read our working report →
Live page status OPEN, but it lists “1 claimed proof for this problem” (with “Currently working on this problem: None”), so the mandatory claimed-proof stop rule applies.
SKIPPED