- **General Math**
(*http://www.physicsforums.com/forumdisplay.php?f=73*)

- - **prime number algorithm**
(*http://www.physicsforums.com/showthread.php?t=308463*)

prime number algorithmi 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? |

All times are GMT -5. The time now is 03:38 AM. |

Powered by vBulletin Copyright ©2000 - 2014, Jelsoft Enterprises Ltd.

© 2014 Physics Forums