Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Problem 850
claims/: The 1 claim page of Problem 850, one per claimant's result; the problem's standing derives from them.
Statement. Can there exist two distinct integers and such that have the same prime factors, have the same prime factors, and also have the same prime factors?
Formulation. The site leaves the range of and implicit. Its curator states in the problem's forum thread (19 January 2026) that is meant. The formal-conjectures statement takes and to be natural numbers, and zero adds no solution. Over all integers the question has the trivial answer yes (, : the pairs , and each have the same prime factors), but that is not the problem asked. This page reads the problem for positive integers.
Status. Open.
Source. erdosproblems.com/850, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #850, https://www.erdosproblems.com/850.
References.
- [Gu04] Guy, Richard K., Unsolved problems in number theory. Third edition, Problem Books in Mathematics, Springer (2004), xviii+437 pp. Section B29 "Is determined by the prime divisors of , , ..., ?", printed p. 127: Woods's question, "Perhaps ?", the four ambiguous cases for in which only primes below 23 occur, the largest being or , and the infinite family , ; B19 " and with same set of prime factors. The abc-conjecture.", printed p. 113, has Erdős's two-term question with Mąkowski's pair , . Library home: guy_2004_unsolved_problems_number_theory.
- [Ma68] Makowski, Andrzej, On a problem of Erdős. Enseign. Math. (2) (1968), 193.
- [ShTi16] Shorey, Tarlok N. and Tijdeman, Rob, Arithmetic properties of blocks of consecutive integers. (2016), 455-471.
Formalization. Statement in formal-conjectures.
Current assessment
The status above is imported from the dated site record. Shorey and Tijdeman prove that the answer is no under Baker's explicit form of the abc conjecture; their claim page records that conditional result, which gives no unconditional answer. The note below records an author-recorded reconstruction from a research folder and is not independently reviewed. This page records no current literature search or independent assessment of proof coverage.
Known Results
Lemma 3.2 of Pollack, Pomerance and Treviño, reconstructed on its page, bounds the number of with and sharing their prime factors by for each fixed .
Linked library material
These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.