On the greatest prime divisor of a binary form (Q5614057)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3336974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the greatest prime divisor of a binary form |
scientific article; zbMATH DE number 3336974 |
Statements
1971
0 references
On the greatest prime divisor of a binary form (English)
0 references
It was well known due to \textit{K. Mahler} [Math. Ann. 107, 691--730 (1933; Zbl 0006.10502)] that the greatest prime divisor \(P=P_{p}(x, y)\) of an irreducible binary form \(f=f(x, y)\) of the degree at least 3 tends to infinity as \(X=\max (|x|,|y|)\) do so \((x, y\) are coprime integers). Recently \textit{J. Coates} [Acta Arith. 16, 399--412 (1970; Zbl 0221.10026)] proved the estimate \[P>C(\log \log X)^{1/4},\quad X>300, \] where \(C=C(f)>0\) is a computable value, dependent only on \(f\). In the present paper the following sharper result is obtained (at any rate for the forms not less than of 5th degree): \[ P > C_1 \frac{\log \log X}{\log \log \log X}, \quad X>X_{1}(f) \] where \(C_1=C_1(f)\) and \(X_1(f)\) are computable values, dependent only on \(f\).
0 references