Quote:
Originally Posted by retina
So where is the error in the "proof"? I think it would be quite instructive to see where it goes wrong.

Yes, this is far from a standard proof in math. Here it is a big mistake:
"now, if 'p' is any prime divisor of 'R', then a^((Q1)/4) = (a^k)^(2^(n2)) == +/1(mod p) implies that p == +/1 (mod 2^n)"
This is totally false.
And R=Q in the "proof", if you haven't observed it.