i am sorry guys, the last time i posted this problem it was completely different but this time if we
Let x_{1}^{2}+x_{2}^{2}=1 be a unit circle upon a finite field Zp where p is prime. Is there any algorithm which can give all the possible solutions (x1,x2) an element of Zp*Zp as well as the total number of such solutions? If exists, what is the complexity of it?
