Guy, Richard K., Unsolved problems in number theory. Third edition, Problem Books in Mathematics, Springer (2004), xviii+437 pp. Section B29 "Is $x$ determined by the prime divisors of $x+1$, $x+2$, ..., $x+k$?", printed p. 127: Woods's question, "Perhaps $k=3$?", the four ambiguous cases for $k=2$ in which only primes below 23 occur, the largest being $(x+1,x+2)=(75,76)$ or $(1215,1216)$, and the infinite family $(2^n-2,2^n-1)$, $(2^n(2^n-2),(2^n-1)^2)$; B19 "$(m,n+1)$ and $(m+1,n)$ with same set of prime factors. The abc-conjecture.", printed p. 113, has Erdős's two-term question with Mąkowski's pair $m=3\cdot5^2$, $n=3^5\cdot5$. Library home: Guy 2004.

Makowski, Andrzej, On a problem of Erdős. Enseign. Math. (2) (1968), 193.

Shorey, Tarlok N. and Tijdeman, Rob, Arithmetic properties of blocks of consecutive integers. (2016), 455-471.