Erdős Problem #388
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 full write-up →
Can two disjoint blocks of consecutive integers, both length >3, ever have equal products? 8·9·⋯·14 = 63·64·65·66 = 17,297,280 is the only known example. Round 1 established fixed-pair finiteness. Round 2: a real corollary narrows it further (fixed length RATIO is also finite, so any infinite family needs infinitely many distinct ratios), a 2024 paper's computer search conjectures this IS the complete classification, and a search reaching 10 million found nothing else across 1.4 billion comparisons. Round 3: a follow-up wrote out the actual proof of the fixed-unequal-length finiteness Round 2 had only cited — a clean Kulkarni–Sury case-elimination we verified by exact computation — and caught a subtle error in the naive root-comparison argument. It proves no uniform bound, so the full problem stays open; everything below the uniformity step is now settled.
LIVE