i am sorry guys, the last time i posted this problem it was completely different but this time if we(adsbygoogle = window.adsbygoogle || []).push({});

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?

**Physics Forums - The Fusion of Science and Community**

# Prime number algorithm

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Prime number algorithm

Loading...

**Physics Forums - The Fusion of Science and Community**