(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

X mod m is the remainder when x is divided by m. This value is called a residue. Find all perfect squares from the set of residues mod 16.

3. The attempt at a solution

There was a suggestion that this would become clearer when the definition of perfect square was reviewed and found to be more than just a square rootable number.

I can't find a better definition of a perfect square than a number that has a square root that is an integer. Can anyone point me to an exhaustive definition of a perfect square?

Thanks,

Bernie

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

# Modulus and Squares

Have something to add?

- Similar discussions for: Modulus and Squares

Loading...

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