Total Posts:3|Showing Posts:1-3
Jump to topic:

Bored

BasicLogic
Posts: 170
Add as Friend
Challenge to a Debate
Send a Message
5/5/2014 11:17:17 PM
Posted: 2 years ago
To illustrate, the solution has bases with a common factor of 3, the solution has bases with a common factor of 7, and has bases with a common factor of 2. Indeed the equation has infinitely many solutions where the bases share a common factor, including generalizations of the above three examples, respectively

and

Furthermore, for each solution (with or without coprime bases), there are infinitely many solutions with the same set of exponents and an increasing set of coprime bases. That is, for solution

we additionally have

where

Any solutions to the Beal conjecture will necessarily involve three terms all of which are 3-powerful numbers, i.e. numbers where the exponent of every prime factor is at least three. It is known that there are an infinite number of such sums involving coprime 3-powerful numbers;[6] however, such sums are rare. The smallest two examples are:

What distinguishes Beal's conjecture is that it requires each of the three terms to be expressible as a single power.

Relation to other conjectures[edit]
Fermat's Last Theorem established that has no solutions for n > 2 for positive integers A, B, and C. If any solutions had existed to Fermat's Last Theorem, then by dividing out every common factor, there would also exist solutions with A, B, and C coprime. Hence, Fermat's Last Theorem can be seen as a special case of the Beal conjecture restricted to x = y = z.

The Fermat"Catalan conjecture is that has only finitely many solutions with A, B, and C being positive integers with no common prime factor and x, y, and z being positive integers satisfying Beal's conjecture can be restated as "All Fermat"Catalan conjecture solutions will use 2 as an exponent."

The abc conjecture, if true, implies that there are at most finitely many counterexamples to Beal's conjecture.

Partial results[edit]
In the cases below where 2 is an exponent, multiples of 2 are also proven, since a power can be squared.

The case x = y = z is Fermat's Last Theorem, proven to have no solutions by Andrew Wiles in 1994.[7]
The case gcd(x,y,z) > 2 is implied by Fermat's Last Theorem.
The case (x, y, z) = (2, 4, 4) was proven to have no solutions by Pierre de Fermat in the 1600s. (See one proof here.)
The case y = z = 4 has been proven for all x.[2]
The case (x, y, z) = (2, 3, 7) and all its permutations were proven to have only four solutions, none of them involving an even power greater than 2, by Bjorn Poonen, Edward F. Schaefer, and Michael Stoll in 2005.[8]
The case (x, y, z) = (2, 3, 8) and all its permutations are known to have only three solutions, none of them involving an even power greater than 2.[2]
The case (x, y, z) = (2, 3, 9) and all its permutations are known to have only two solutions, neither of them involving an even power greater than 2.[2][9]
The case (x, y, z) = (2, 3, 10) was proved by David Brown in 2009.[10]
The case (x, y, z) = (2, 3, 15) was proved by Samir Siksek and Michael Stoll in 2013.[11]
The case (x, y, z) = (2, 4, n) was proved for n X05; 4 by Michael Bennet, Jordan Ellenberg, and Nathan Ng in 2009.[12]
The case (x, y, z) = (n, n, 2) has been proven for n equal to 6, 9, or any prime X05; 5.[2]
The case (x, y, z) = (n, n, 3) has been proven for n equal to 4 or any prime X05; 3.[2]
The case (x, y, z) = (3, 3, n) has been proven for n equal to 4, 5, or 17 X04; n X04; 10000.[2]
The cases (5, 5, 7), (5, 5, 19) and (7, 7, 5) were proved by Sander R. Dahmen and Samir Siksek in 2013.[13]
The case A = 1 is implied by Catalan's conjecture, proven in 2002 by Preda Mihăilescu.
Faltings' theorem implies that for every specific choice of exponents (x,y,z), there are at most finitely many solutions.[14]
Peter Norvig, Director of Research at Google, reported having conducted a series of numerical searches for counterexamples to Beal's conjecture. Among his results, he excluded all possible solutions having each of x, y, z X04; 7 and each of A, B, C X04; 250,000, as well as possible solutions having each of x, y, z X04; 100 and each of A, B, C X04; 10,000.[15]
Invalid variants[edit]
The counterexamples and show that the conjecture would be false if one of the exponents were allowed to be 2. The Fermat"Catalan conjecture covers cases of this sort.

A variation of the conjecture asserting that x, y, z (instead of A, B, C) must have a common prime factor is not true. A counterexample is in which 4, 3, and 7 have no common prime factor. (In fact, the maximum common prime factor of the exponents that is valid is 2; a common factor greater than 2 would be a counterexample to Fermat's Last Theorem.)

The conjecture is not valid over the larger domain of Gaussian integers. After a prize of $50 was offered for a counterexample, Fred W. Helenius provided [16]

See also[edit]
WheezySquash8
Posts: 130
Add as Friend
Challenge to a Debate
Send a Message
5/14/2014 5:11:26 AM
Posted: 2 years ago
At 5/5/2014 3:02:16 PM, PotBelliedGeek wrote:
I'm bored. Someone say something funny.

Wanna hear a funny joke? Congress. Hahahaha. Get it?
Pacifist Since 3/12/14
Wheezy