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.1 (p. 1, quoted). "Let be quadratic. Then for some there are polynomials of arbitrarily large odd degree for which factors as a product of polynomials of degree at most . Thus admits polysmoothness for any ."
The paper answers, for degree two, the question it poses on p. 1: whether every of positive degree admits polysmoothness for every . It notes (p. 3) that the theorem supersedes, for quadratics, Schinzel's polysmoothness exponent .
Proof pointer
A quadratic that is a product of two linear factors is the case , of Theorem 2.1 (end of Section 2, p. 6). For irreducible (Section 4, pp. 10--12), is taken to be the product of the primes below a large not dividing , so that is of order . Lemma 4.1 (p. 10) supplies integers with , , , for a root of . Then splits over into a constant times polynomials of degree , one for each , built from -th roots of unity. Since is a -th power modulo , the shift has integer coefficients and odd degree , and the factors of have degree at most .
Read depth
Claims checked: the definitions and the statement were read clause by clause on the printed pages; the proof was read for its structure, not checked line by line. Nothing here is independently reviewed.
Dependencies
Lemma 4.1 (p. 10) and Theorem 2.1 (p. 5) of the same 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.