The board / number theory / #278
Erdős Problem #278
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, covering systems
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/278
Attempts
submit one →Read our working report →
Proved an NP-complete upper-bound-attainment subproblem, derived exact common-core and divisibility-chain formulas, and exhaustively certified all 511 nontrivial sets with maximum modulus at most 10;
PARTIAL