The board / number theory / #933
Erdős Problem #933
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).
The 2-adic valuation of \(n(n+1)\).
The 3-adic valuation of \(n(n+1)\).
If \(n(n+1)=2^k3^lm\), where \((m,6)=1\), then is it true that \(\limsup_{n\to \infty} \frac{2^k3^l}{n\log n}=\infty\)?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open · 2 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/933.Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA401022
Original pageerdosproblems.com/933
Attempts
submit one →Read our working report →
Live page status OPEN; it lists current workers johnseibert19, fschumann, and aminb_el (with 0 claimed proofs, though one comment links a purported negative-answer preprint), so the mandatory no-colli
SKIPPED