Originally Posted by
drounds67 I'm having trouble understanding the concept of quadratic residue. I know you are supposed to take the integers lower than your mod number and square them and reduce via the mod number. My question is how do you know if you have a solution? For example 2^2 \equiv 4(mod 13) is not a solution but 3^2 \equiv 9(mod 13) is a solution. I don't understand why one is and not the other. Both 4 and 9 are squares of an integer. I know I'm misunderstanding something fundamnetal but I can't find any simple answers in my book or on the net. Thanks for any help.
David