Erdős Problem a Daythe open tracker

Erdős Problem #1056

OPENdatabase updated 2025-09-28

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 proposition that the modular product of a collection of consecutive interval equals \(1\) modulo \(p\), where intervals are defined by a function specifying the consecutive boundaries.

Let \(k ≥ 2\). Does there exist a prime \(p\) and consecutive intervals \(I_0,\dots,I_k\) such that \(\prod\limits_{n{\in}I_i}n \equiv 1 \mod n\) for all \(1 \le i \le k\)?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open · 1 further variant / known partial result in the Lean file. The authoritative wording is on erdosproblems.com/1056.
Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA060427
Original pageerdosproblems.com/1056
WORKING REPORT BY THIS SITE · JUL 28, 2026

Read our working report →

LIVE PAGE status OPEN with 0 claimed proofs, but “Currently working on this problem” lists jeffhino, so this run stopped before any mathematical attempt to avoid colliding with the current worker.

SKIPPED