English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

Suppose
x^(n) = a^(m) - b^(m)
here n=/=m & a=/=b. n & m both should be greater then 2.
I want a solution to this equation where "a" & "b" are coprime ( i.e having no common factor between them) .
Can u help me out?

2006-11-17 23:44:13 · 2 answers · asked by rajesh bhowmick 2 in Science & Mathematics Mathematics

2 answers

If n is contains an odd prime factor, this is part of an unsolved problem called Beal's conjecture. This says that if any
such solution exists, then a and b cannot be coprime.
If n is a power of 2, it is a multiple of 4, since n> 2.
A glance at Wikipedia also shows that this
case is also part of Beal's conjecture.
At the present time no counterexamples to
Beal's conjecture are known.
Incidentally, there is a $100000 prize for the
first proof or counterexample to Beal's conjecture.

2006-11-18 02:43:16 · answer #1 · answered by steiner1745 7 · 0 0

Can't think of any clever approaches. If I had time I would start paddling around working out values of things like
5^3 - 2^3, 5^3 - 3^3, 8^5 - 7^5, but I'm already thinking it won't get anywhere useful. Sorry.

2006-11-18 07:53:23 · answer #2 · answered by Hy 7 · 0 0

fedest.com, questions and answers