Reprint: On the number of integers which can be represented by a binary form (1938) (Q1996502)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reprint: On the number of integers which can be represented by a binary form (1938) |
scientific article; zbMATH DE number 7317818
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reprint: On the number of integers which can be represented by a binary form (1938) |
scientific article; zbMATH DE number 7317818 |
Statements
Reprint: On the number of integers which can be represented by a binary form (1938) (English)
0 references
5 March 2021
0 references
Summary: Let \(F(x,y)\) be a binary form of degree \(n\ge 3\) with integer coefficients and non-vanishing discriminant, and let \(A(u)\) be the number of different positive integers \(k\le u\), for which \(|F(x,y)|=k\) has at least one solution in integers \(x,y\). In this paper, using Mahler's \(p\)-adic generalisation of the Thue-Siegel theorem, Erdős and Mahler prove that \[\liminf_{u\to\infty} A(u)u^{-2/n}>0.\] Reprint of the authors' paper [J. Lond. Math. Soc. 13, 134--139 (1938; Zbl 0018.34401; JFM 64.0116.01)].
0 references