Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Theorem 12, p. 462, with its proof on pp. 462--463, of Kurt Mahler, On the lattice points on curves of genus 1, Proc. London Math. Soc. (2) 39 (1935), 431--466, the edition named on the source card.

Read depth. Claims checked: the statement was read clause by clause on p. 462, the proof for its structure. Nothing here is independently reviewed.

Statement

Theorem 12 (p. 462), quoted: "Suppose that f(x)f(x) is a polynomial of exact degree 3 or 4 in xx with rational coefficients, and that t≥1t\ge1 is an integer. Then there is an integer k≠0k\ne0 such that, for at least tt different rational values of xx, the polynomial kf(x)kf(x) is the square of an integer."

The paper notes (p. 462) that Theorem 10 is a special case. Section 27 (p. 463) applies it to obtain Theorems 13 and 14: for every t≥1t\ge1 there is a polynomial a0x2+a1a_0x^2+a_1 (a0a1≠0a_0a_1\ne0) with integer coefficients that is a perfect cube, respectively a perfect fourth power, for at least tt different integer values of xx.

Proof pointer

Pp. 462--463. The case of a multiple root is called trivial; otherwise y2=f(x)y^2=f(x) is a curve of genus 1 with an elliptic uniformization, and a parabola y=Ax2+Bx+Cy=Ax^2+Bx+C meets it in four points whose elliptic arguments sum to a constant. Osculating parabolas give the points with arguments u1,−3u1,9u1,…,(−3)t−1u1u_1,-3u_1,9u_1,\ldots,(-3)^{t-1}u_1, chosen distinct and finite on a curve y2=k1f(x)y^2=k_1f(x) through a suitable rational point; clearing denominators then gives the integer kk.

Dependencies

None outside the paper's own method.

Bears on

No Erdős problem in the corpus.