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 (x_{1},x_{2}) 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**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Prime number algorithm

Loading...

Similar Threads - Prime number algorithm | Date |
---|---|

A Equation with three consecutive prime numbers | Apr 11, 2016 |

Largest Prime Number | Feb 6, 2013 |

A big number modulo a prime | Dec 12, 2012 |

Modulo and prime numbers | Nov 4, 2012 |

Prime Number Algorithm | Feb 2, 2012 |

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