Show that a^2~0 or a^2~1 in Mod 4

  • Thread starter Thread starter PsychonautQQ
  • Start date Start date
  • Tags Tags
    Integers module
PsychonautQQ
Messages
781
Reaction score
10

Homework Statement


If a I san integer, show that a^2~0 or a^2~1 in mod 4 (~ represent equivalence)


Homework Equations





The Attempt at a Solution


my ATTEMPT:
I started with the division algorithm..
a = 2q + 1 for all odd numbers
a = 2q + 0 for all even numbers
then I squared the formula for even numbers...
a^2 = 4q^2 + 0... but q is arbitrary so
a^2 ~ 0 mod 4 for even numbers

then I did the same for odd numbers
a^2 = 4q^2 + 4q + 1
and then I said since q was arbitrary again I could say
a^2 = 4q + 1
a^2~1 mod 4 for odd numbers


is this the correct approach?
 
Physics news on Phys.org
Yep, clean work.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top