Integers Module n

  • #1
784
11

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?
 

Answers and Replies

  • #2
1,335
41
Yep, clean work.
 

Related Threads on Integers Module n

  • Last Post
Replies
3
Views
801
  • Last Post
Replies
2
Views
1K
Replies
5
Views
4K
Replies
4
Views
10K
  • Last Post
Replies
4
Views
2K
Replies
3
Views
2K
  • Last Post
Replies
2
Views
6K
  • Last Post
Replies
7
Views
3K
  • Last Post
Replies
1
Views
3K
Replies
0
Views
1K
Top