Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Proposition 1 of Florian Luca, The Diophantine equation and a result of M. Overholt, Glas. Mat. Ser. III 37(57) (2002), no. 2, 269--273, states that the abc conjecture implies that, for every polynomial of degree , the equation with an integer has only finitely many solutions ; the sentence introducing it and the abstract say integer solutions with . The proof multiplies through to a monic equation , and compares the size and the radical of the terms of that equation, which the abc conjecture bounds, with the growth of . The paper generalizes Overholt's result that a weak form of abc gives finiteness for the Brocard--Ramanujan equation . The source card is Luca 2002.
Consequence for the problem. If in Problem 393, then for some and some containing and , so for one of the finitely many polynomials , each of degree . Under abc each of these equations has finitely many solutions, so for each only finitely many have ; that is, , and in particular only finitely often, which answers with no the question of Erdős and Graham whether a factorial is the product of two consecutive integers infinitely often. The site's remarks record this consequence.
Hypothesis. The claim is conditional on the abc conjecture: for every there is a constant such that coprime nonzero integers satisfy . The conjecture is unproved, so this page derives nothing for the problem's standing; whether infinitely often is open unconditionally.
Acceptance. Refereed: Glasnik Matematički, Series III, volume 37(57), number
2 (2002), pp. 269--273, as the journal's article page records. The site labels
the problem OPEN, so its remark that Luca's result implies under
abc is commentary on an open problem and not acceptance, and no reviewed
evidence is listed. The proof is not checked here.
Depends on. No page of this wiki.