Catalan's conjecture

From Number
Revision as of 17:14, 13 August 2010 by Vipul (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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