Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 2, p. 14, of Jean-Marie De Koninck, Florian Luca and Igor E. Shparlinski, Powerful numbers in short intervals, Bull. Austral. Math. Soc. 71 (2005), 11--16, doi:10.1017/S0004972700037953. See the source card.
Read depth. Claims checked: the statement was read clause by clause on the printed page. The proof (pp. 14--15) was read for structure only. Nothing here is independently reviewed.
Statement
The paper's Conjecture 1 (p. 14) is the ABC conjecture in the form: for every there is such that for all integers with and , where is the product of the primes dividing . -full is defined as on Theorem 1, with an integer.
Theorem 2 (p. 14). Assume the ABC conjecture. If and are fixed, there is such that for every the interval contains at most one -full number.
The paper remarks (p. 15) that the best known results towards ABC, those of Stewart and Yu, are too weak to give any nontrivial unconditional estimate of this kind.
Proof pointer
Pp. 14--15. Two -full numbers in the interval have radicals at most and a difference below ; applying ABC with to bounds , and hence , by a constant depending on and only.
Dependencies
The ABC conjecture (the paper's Conjecture 1, p. 14).
Bears on
- Problem 942: none for . The interval then has length , so the conclusion holds trivially and says nothing about powerful numbers between consecutive squares. The paper does not mention the problem.