Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let . Is it true that, for any distinct integers such that
we must have ?
Source: erdosproblems.com/287
No claim settles this problem.
Falsifiable on the site: the label is FALSIFIABLE (page last edited 23 January 2026), which the site explains as open but refutable by one finite counterexample. The standing in the frontmatter derives from the claim pages, both pending partial claims: the Lean developments Pr_Huang 2026 (largest denominator up to , then about ) and Ramji 2026 (up to about , then a 959-digit limit) claim the statement for every representation whose largest denominator is below their limits, which would settle every up to about a third of the limit, and nothing claims the statement for all or a counterexample. The site's proof-claim tab is empty.