If a is a quadratic nonresidue of the odd primes p and q, then is the congruence [itex] x^2 \equiv a (\text{mod } pq) [/itex] solvable?(adsbygoogle = window.adsbygoogle || []).push({});

Obviously, we want to evaluate [itex] \left( \frac{a}{pq} \right) [/itex]. I factored a into its prime factors and used the law of QR and Euler's Criterion to get rid of the legendre symbols needed to evaluate [itex]\left( \frac{a}{pq}\right)[/itex]. I don't believe that this helped, though, because I get that it is conditionally solvable, which I don't think is possible from the way the question is worded. (To be exact, I concluded that if a has only one prime factor, then it is unsolvable unless it is 2. It is solvable for every other case.)

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!

# Quadratic Reciprocity

Loading...

Similar Threads - Quadratic Reciprocity | Date |
---|---|

I Quadratic Polynomials and Irreducibles and Primes ... | Apr 2, 2017 |

A Representation number via quad forms of theta quadratic form | Dec 17, 2016 |

Quadratic form is nover zero? | Apr 29, 2015 |

Algorithm to find square root of a quadratic residue mod p | Feb 14, 2015 |

Proof question: the sum of the reciprocals of the primes diverges | Jun 13, 2014 |

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