Catalan's conjecture: Difference between revisions

From Number
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:

xpyq=1,

for x,y positive integers not equal to 0,1 and p,q positive integers greater than one, has precisely one solution: x=3,y=2,p=2,q=3.

The conjecture has been proved.

Relation with other facts/conjectures

Conjecture Statement of conjecture Status
Fermat-Catalan conjecture am+bn=ck has only finitely many solutions for a,b,c positive integers and 1m+1n+1k<1 open
abc conjecture For every ϵ, there exists Cϵ such that if a+b=c, then max{|a|,|b|,|c|}Cϵp|abcp1+ϵ, the product over p prime