Wiki
Wiki

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 P(x)=n!P(x)=n! 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 P∈Z[X]P\in\mathbb Z[X] of degree d≥2d\ge2, the equation P(x)=n!P(x)=n! with xx an integer has only finitely many solutions (x,n)(x,n); the sentence introducing it and the abstract say integer solutions (x,n)(x,n) with n>0n>0. The proof multiplies through to a monic equation zd+c2zd−2+⋯+cd=c n!z^d+c_2z^{d-2}+\cdots+c_d=c\,n!, and compares the size and the radical of the terms of that equation, which the abc conjecture bounds, with the growth of n!n!. The paper generalizes Overholt's result that a weak form of abc gives finiteness for the Brocard--Ramanujan equation x2−1=n!x^2-1=n!. The source card is Luca 2002.

Consequence for the problem. If f(n)=mf(n)=m in Problem 393, then n!=∏s∈S(a+s)n!=\prod_{s\in S}(a+s) for some a≥1a\ge1 and some S⊆{0,…,m}S\subseteq\{0,\ldots,m\} containing 00 and mm, so n!=PS(a)n!=P_S(a) for one of the finitely many polynomials PS(X)=∏s∈S(X+s)P_S(X)=\prod_{s\in S}(X+s), each of degree ∣S∣≥2|S|\ge2. Under abc each of these equations has finitely many solutions, so for each mm only finitely many nn have f(n)=mf(n)=m; that is, f(n)→∞f(n)\to\infty, and in particular f(n)=1f(n)=1 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 ε>0\varepsilon>0 there is a constant C(ε)C(\varepsilon) such that coprime nonzero integers A+B=CA+B=C satisfy max⁡(∣A∣,∣B∣,∣C∣)<C(ε) rad(ABC)1+ε\max(|A|,|B|,|C|)<C(\varepsilon)\,\mathrm{rad}(ABC)^{1+\varepsilon}. The conjecture is unproved, so this page derives nothing for the problem's standing; whether f(n)=1f(n)=1 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 f(n)→∞f(n)\to\infty 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.