Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 4, Chapter I). is a natural number that is not a square and is a nonzero squarefree integer dividing . is the set of all pairs of integers with . The fundamental pair of is the pair of natural numbers with and smallest. is the set of pairs in with and every prime factor of dividing .
Satz 1 (p. 15). If and , then is either empty, or consists of the four pairs , or consists of the eight pairs
where is the fundamental pair of and the signs are taken in all combinations.
The excluded cases (p. 5). For the paper quotes Størmer's theorem (Videnskabsselskabets Skrifter, 1897): is either empty or consists of , , where is the fundamental pair of . For it shows that consists only of , . It adds that is empty for and consists only of , for .
Singular pairs (§ 11, p. 16). The paper calls the pair singular when is the eight-pair set of Satz 1, and regular otherwise. From the formulas of § 11 it derives in § 12 (pp. 17–19; the three statements below are on pp. 18–19):
- every pair is regular, so for every non-square natural the set is empty or consists of the four pairs ; the paper identifies this sharpening of Satz 1 with Størmer's second theorem mentioned on p. 5;
- every pair is regular;
- there are exactly three singular pairs , namely , with , and ; for every other the set is empty or consists of (under the standing assumption of § 2, which excludes ).
A table of singular pairs for is printed on p. 20.
Proof pointer
§§ 2–10, pp. 5–15. A result of D. Schepel (Nieuw Archief voor Wiskunde, 1935), quoted on pp. 6–7, describes for , through the fundamental pair: the solutions are , where . So the question becomes which odd give a with only prime factors dividing ; the set of such is written (p. 8). Since divides when divides , the set is closed under odd divisors. Writing , , with (§ 5, pp. 9–10), a binomial expansion of and congruences modulo , and show that every element of is a power of (§§ 6–7, pp. 10–13) and that is not an element (§§ 8–9, pp. 13–14). Hence is empty, or (§ 10, pp. 14–15), the three cases of Satz 1.
Read depth
Claims checked: the setting, Satz 1, the excluded cases and the consequences of § 12 were read clause by clause on the page images of the print; the three singular pairs were checked against here. The proof was followed but not checked step by step. Nothing here is independently reviewed.
Dependencies
External inputs named by the paper: Schepel's description of and Størmer's theorem for .
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 1, with Størmer's theorem for , is the step that makes the set of Satz 3 computable, and Satz 3 bears on Problem 368 and Problem 649.