Proving Modular Relations: b ≡ 1 (mod 2) ⇒ b² ≡ 1 (mod 8)

  • Thread starter Thread starter John112
  • Start date Start date
  • Tags Tags
    Relations
John112
Messages
19
Reaction score
0
\forall b\in Z b \equiv 1 (mod 2) \Rightarrow b^{2} \equiv 1 (mod 8)

How do I go about proving this? Can the Chinese Remainder Theorem be used to prove this or is there something easier?
 
Physics news on Phys.org
Directly from the definition, b\conguent 1 (mod 2) means that b= 1+ 2k[/tex] for some integer k. Then b^2= 4k^2+ 4k+ 1= 4(k^2+ k)+ 1

Now consider two cases:
1) k is even: k= 2n for some integer n. What is 4(k^2+ k)+ 1 in this case?

2) k is odd: k= 2n+ 1 for some integer n. What is 4(k^2+ k)+ 1 in this case?
 
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