document.write( "Question 401408: Solve formula for given letter Assume all variables represent non-negative #s. a^+b^=g^ for a \n" ); document.write( "

Algebra.Com's Answer #284083 by richard1234(7193) $\"\"$ $\"About$

You can put this solution on YOUR website!
You used ^ which implies that there is an exponent, but you didn't say what the exponent was. I'll just assume that the exponent is some arbitrary k (you can replace k with whatever the exponent is).\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Isolating the a terms, $\"a%5Ek+=+g%5Ek+-+b%5Ek\"$ . Taking the k-th root of both sides,\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " $\"a+=+root%28k%2C+g%5Ek+-+b%5Ek%29\"$ .\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "In fact, $\"a%5Ek+%2B+b%5Ek+=+g%5Ek\"$ appears to be similar to Fermat's last theorem, but the theorem has more restrictions. Fermat's last theorem says that there are no ordered triples of integers (a, b, g) that satisfy $\"a%5Ek+%2B+b%5Ek+=+g%5Ek\"$ , where k is an integer greater than 2. \n" ); document.write( "

\n" );