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

  • Thread starter Thread starter John112
  • Start date Start date
  • Tags Tags
    Relations
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 1K views
John112
Messages
19
Reaction score
0
[itex]\forall[/itex] b[itex]\in[/itex] [itex]Z[/itex] b [itex]\equiv[/itex] 1 (mod 2) [itex]\Rightarrow[/itex] b[itex]^{2}[/itex] [itex]\equiv[/itex] 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, [tex]b\conguent 1 (mod 2)[/tex] means that b= 1+ 2k[/tex] for some integer k. Then [itex]b^2= 4k^2+ 4k+ 1= 4(k^2+ k)+ 1[/itex]

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

2) k is odd: k= 2n+ 1 for some integer n. What is [itex]4(k^2+ k)+ 1[/itex] in this case?