Number theory Diophantine equations Conjecture
abc conjecture
Builds on Coprime integersPrime numberMason–Stothers theorem
Statement
For a positive integer , let be the product of the distinct primes that divide . For every real number , there are only finitely many triples of coprime positive integers with and
Remarks
The conjecture was formulated by Joseph Oesterlé and David Masser in 1985. Shinichi Mochizuki announced a proof in 2012; it is not accepted by most experts, and the conjecture is generally treated as open. The analogue for polynomials is a theorem, the Mason–Stothers theorem. The cannot be removed. For each , take , and ; since , the number divides , so . For example, has , and has radical . The conjecture would imply many results, for instance that the Fermat equation has no solutions in positive integers for all large .
Reading path
To understand this page from the ground up, read these 8 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Coprime integers concept
- Field concept
- Formal derivative concept
- Irreducible polynomial concept
- Polynomial ring concept
- Prime number concept
- Mason–Stothers theorem statement
- abc conjecture conjecture
Further reading
About this page
| Tag | G7JH2NXPC0 |
|---|---|
| URI | m2://G7JH2NXPC0 |
| Kind | conjecture |
| Writing | W0 stub |
| MSC | 11D75, 11D41 |
| Status | This copy of the site has no build data. Run m2 status G7JH2NXPC0. |
| About | abc conjecture |
| Uses | Coprime integers, Prime number, Mason–Stothers theorem |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.