"Let p be a prime such that there exists a solution to the congruence [tex]x^2\equiv - 2\mod p[/tex].(adsbygoogle = window.adsbygoogle || []).push({});

THEN there are integers a and b such that [tex]a^2 + 2b^2 = p[/tex] or [tex]a^2 + 2b^2 = 2p[/tex]."

============================

I don't see why this is true. How can we prove this using basic concepts?

We know that there exists some integer x such that p|(x^{2}-2), what's next?

Any help is appreciated!

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

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

# Prime & Congruences

Loading...

Similar Threads - Prime Congruences | Date |
---|---|

Solving Systems of Congruences when mods not pairwise relatively prime | Sep 25, 2011 |

Prime congruence problem | Nov 18, 2010 |

Prime congruence series formula | Jun 17, 2010 |

Congruences and primes | Feb 24, 2010 |

Quadratic congruences with prime modulus | Oct 16, 2006 |

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