Saturday, 7 January 2017

Modular Arithmetic Homework



Find an integer $ m \ge 2 $ so that the equation $ x^2 \equiv 1 $ in $\mathbb{Z}/ m$ has more than two solutions.




In a previous part I proved that there are two solutions $x=1,-1$ when $m$ is prime. I'm not sure if that is of any relevance here?



I'm not sure how to even start this, I was thinking maybe this has something to do with the $\text{gcd}(x, m)$?


Answer



Your observation is certainly relevant, since when $m$ is prime there are only 2 solutions - so it means that the example you are looking for cannot have $m$ prime.



So you need to start looking at values of $m$ which are not prime.



A good place to start might be looking at the squares of all elements when $m=8$ ...


No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...