The board / number theory / #335
Erdős Problem #335
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).
Attempts
submit one →Read our working report →
proved the complete finite-prefix-shadow criterion for all ultimately periodic pairs, exhibited \(A_q=q\mathbb N\cup\{1\}, B_q=q\mathbb N\), and exhaustively verified the stated small-period tables; t
PARTIAL