Figure this one out...

[Outrider]

That would be called a palindrome. ;)

Huh, so it was just a simple reverse binomial expansion. Nice. :o

It's actually not a palindrome, since it's not identical from back to front (the exponents are switched). Only the coefficients form a palindrome.

Was referring to the values Bryant listed as examples. ;)

[kjeopardy]

That would be called a palindrome. ;)

Huh, so it was just a simple reverse binomial expansion. Nice. :o

It's actually not a palindrome, since it's not identical from back to front (the exponents are switched). Only the coefficients form a palindrome.

Was referring to the values Bryant listed as examples. ;)

I see. Carry on

[kjeopardy]

Well, I guess its time for a new problem for SWGO to solve. If anyone's got a problem, post it.

Here we go.

Let p be a prime number greater than 5. Prove that (p-4) isn't the 4th power of an integer.

We really don't want a computer solution to this, although someone could write a program to check this for the first gazillion values of p-4.

[Darth Crater]

This is equivalent to proving that (x^4) + 4 is not prime for all integer x. Not sure if this helps the solving.

[kjeopardy]

This is equivalent to proving that (x^4) + 4 is not prime for all integer x. Not sure if this helps the solving.

Yes it is. You have the equation p-4 = n^4, for some integer n. Just add 4 to both sides to get p = n^4+4. You now have to prove that "4 plus any fourth power isn't prime."

This is the first step in the proof.