Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting. As on the page of Satz 1: is the set of solutions of with and every prime factor of dividing , is the fundamental pair, and is singular when has the eight elements of the third case of Satz 1 (p. 16).
Satz 2 (p. 20). For every squarefree number there are at most finitely many natural numbers with that are not squares and for which is singular. Consequently, for all sufficiently large the set is either empty or contains only the pairs .
Proof pointer
§§ 11–13, pp. 16–20. For a singular pair, § 9 forces and for some natural (p. 16). For a fixed the paper lists, by the sign of and whether , the possible , and the resulting equations for and (p. 19). Each yields at most finitely many , and each equation has at most finitely many solutions, by Pólya's theorem that the largest prime factor of with tends to infinity, so the polynomial is a pure power of for at most finitely many (p. 20).
Read depth
Claims checked: Satz 2 and the definition of singular pairs were read clause by clause on the page images of the print. The proof was followed but not checked step by step. Nothing here is independently reviewed.
Dependencies
Satz 1 and § 9 of the same paper; Pólya's theorem on the largest prime factor of a quadratic polynomial, cited without reference.
Source. K. Mahler, Über den grössten Primteiler spezieller Polynome zweiten Grades, Archiv for Mathematik og Naturvidenskab 41 (1935), no. 6, pp. 3–26; the edition read is named on the source card.
Bears on
None directly. Satz 2 bounds the singular pairs met in the count of on the way to Satz 3, which bears on Problem 368 and Problem 649.