Catalan's conjecture: Difference between revisions
No edit summary |
|||
Line 8: | Line 8: | ||
The conjecture has been proved. | The conjecture has been proved. | ||
==Relation with other facts/conjectures== | |||
{| class="sortable" border="1" | |||
! Conjecture !! Statement of conjecture !! Status | |||
|- | |||
| [[Fermat-Catalan conjecture]] || <math>a^m + b^n = c^k</math> has only finitely many solutions for <math>a,b,c</math> positive integers and <math>\frac{1}{m} + \frac{1}{n} + \frac{1}{k} < 1</math> || open | |||
|- | |||
| [[abc conjecture]] || For every <math>\epsilon</math>, there exists <math>C_{\epsilon}</math> such that if <math>a + b = c</math>, then <math>\max \{ |a|, |b|, |c| \} \le C_\epsilon \prod_{p | abc} p^{1 + \epsilon}</math>, the product over <math>p</math> prime || | |||
|} |
Latest revision as of 17:14, 13 August 2010
Statement
This conjecture states that the solution set to Catalan's Diophantine problem:
,
for positive integers not equal to and positive integers greater than one, has precisely one solution: .
The conjecture has been proved.
Relation with other facts/conjectures
Conjecture | Statement of conjecture | Status |
---|---|---|
Fermat-Catalan conjecture | has only finitely many solutions for positive integers and | open |
abc conjecture | For every , there exists such that if , then , the product over prime |