Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 1). An integer is -smooth when each of its prime divisors is at most . A polynomial of positive degree admits smoothness when is -smooth for infinitely many integers , and admits polysmoothness when some non-constant makes every irreducible factor of of degree at most . The paper remarks (p. 1) that polysmoothness implies smoothness for every , by looking at the values for large integers .
Theorem 1.5 (p. 4). Let be a natural number.
- (i) If with and , then admits polysmoothness .
- (ii) If with and , then admits polysmoothness .
No irreducibility is assumed. The paper illustrates (ii) with , irreducible for every by Selmer: taking to be the product of the first primes and letting , the exponent tends to (p. 4).
Proof pointer
Pp. 12--13, by cyclotomic factorization. For (i), with one has , a constant times , whose factors have degree at most out of . For (ii), with one has , which splits as into factors of degree out of .
Read depth
Claims checked: the statement was read clause by clause on the printed page and the two factorizations were followed. Nothing here is independently reviewed.
Dependencies
None within the paper.
Source. J. W. Bober, D. Fretwell, G. Martin and T. D. Wooley, Smooth values of polynomials, J. Aust. Math. Soc. 108 (2020), no. 2, 245--261, doi:10.1017/S1446788718000320; the arXiv version 1 print (arXiv:1710.01970v1, 5 October 2017) is the edition read, and its labels and pages are cited here, as named on the source card.