ABC conjecture: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(Start article: ABC conjecture)
mNo edit summary
 
(6 intermediate revisions by one other user not shown)
Line 3: Line 3:


==Statement==
==Statement==
Define the ''radical'' of a number to be the product of its distinct prime factors
Define the ''radical'' of an integer to be the product of its distinct prime factors


:<math> r(n) = \prod_{p|n} p \ . </math>
:<math> r(n) = \prod_{p|n} p \ . </math>


Suppose now that the equation <math>A + B = C</math> holds for positive coprime integers <math>A,B,C</math>.  The conjecture asserts that for every <math>\epsilon > 0</math> there exists <math>\kappa(\epsilon) > 0</math> such that
Suppose now that the equation <math>A + B + C = 0</math> holds for coprime integers <math>A,B,C</math>.  The conjecture asserts that for every <math>\epsilon > 0</math> there exists <math>\kappa(\epsilon) > 0</math> such that


:<math> |A|, |B|, |C| < \kappa(\epsilon) r(ABC)^{1+\epsilon} \ . </math>
:<math> |A|, |B|, |C| < \kappa(\epsilon) r(ABC)^{1+\epsilon} \ . </math>
A weaker form of the conjecture states that
:<math> (|A| \cdot |B| \cdot |C|)^{1/3} < \kappa(\epsilon) r(ABC)^{1+\epsilon} \ . </math>
If we define
:<math> \kappa(\epsilon) = \inf_{A+B+C=0,\ (A,B)=1} \frac{\max\{|A|,|B|,|C|\}}{N^{1+\epsilon}} \ , </math>
then it is known that <math>\kappa \rightarrow \infty</math> as <math>\epsilon \rightarrow 0</math>.
Baker introduced a more refined version of the conjecture in 1998.  Assume as before that <math>A + B + C = 0</math> holds for coprime integers <math>A,B,C</math>.  Let <math>N</math> be the radical of <math>ABC</math> and <math>\omega</math> the number of distinct prime factors of <math>ABC</math>.  Then there is an absolute constant <math>c</math> such that
:<math> |A|, |B|, |C| < c (\epsilon^{-\omega} N)^{1+\epsilon} \ . </math>
This form of the conjecture would give very strong bounds in the [[method of linear forms in logarithms]].
==Results==
It is known that there is an effectively computable <math>\kappa(\epsilon)</math> such that
:<math> |A|, |B|, |C| < \exp\left({ \kappa(\epsilon) N^{1/3} (\log N)^3 }\right) \ . </math>[[Category:Suggestion Bot Tag]]

Latest revision as of 12:00, 4 July 2024

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

In mathematics, the ABC conjecture relates the prime factors of two integers to those of their sum. It was proposed by David Masser and Joseph Oesterlé in 1985. It is connected with other problems of number theory: for example, the truth of the ABC conjecture would provide a new proof of Fermat's Last Theorem.

Statement

Define the radical of an integer to be the product of its distinct prime factors

Suppose now that the equation holds for coprime integers . The conjecture asserts that for every there exists such that

A weaker form of the conjecture states that

If we define

then it is known that as .

Baker introduced a more refined version of the conjecture in 1998. Assume as before that holds for coprime integers . Let be the radical of and the number of distinct prime factors of . Then there is an absolute constant such that

This form of the conjecture would give very strong bounds in the method of linear forms in logarithms.

Results

It is known that there is an effectively computable such that