Lower bounds for numbers of \(ABC\)-hits (Q927737): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2007.06.009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089038507 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An introduction to the geometry of numbers. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound in the \(abc\) conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998724 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Oesterlé-Masser conjecture / rank | |||
Normal rank |
Latest revision as of 11:32, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds for numbers of \(ABC\)-hits |
scientific article |
Statements
Lower bounds for numbers of \(ABC\)-hits (English)
0 references
9 June 2008
0 references
The author considers triplets \((a,b,c)\) of positive integers such that \(a+b=c\) and \(\gcd(a,b,c)=1\). The \(ABC\)-conjecture states that for every \(\varepsilon>0\) there exist at most finitely such triples for which \(c>(\text{rad}(abc))^{1+\varepsilon}\); a triple for which \(\text{rad}(abc)>c\) is called an \(ABC\)-hit. Denote by \(N(X)\) the number of \(ABC\)-hits \((a,b,c)\) with \(c\leq X\). The author proves that for every \(\varepsilon>0\) one has \[ N(X) \gg \exp ((\log X)^{1/2-\varepsilon}). \] Note that \textit{G. Geuze} and \textit{B. de Smit} [Nieuw Arch. Wiskd. (5) 8, No. 1, 26--30 (2007)] proved that \(N(X) \ll X ^{2/3+\varepsilon}\) for every \(\varepsilon>0\).
0 references
ABC conjecture
0 references