Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 0.3.7 ($a^2 + b^2 \not \equiv 3 \pmod 4$)

Exercise 0.3.7 ($a^2 + b^2 \not \equiv 3 \pmod 4$)

Prove for any integers a and b that a 2 + b 2 never leaves a remainder of 3 when divided by 4 (use the previous exercise).

Answers

Proof. If a ¯ denotes the class of a in 4 , then by Exercise 6,

a ¯ 2 { 0 ¯ , 1 ¯ } , b ¯ 2 { 0 ¯ , 1 ¯ } .

Therefore

a ¯ 2 + b ¯ 2 { 0 ¯ + 0 ¯ , 0 ¯ + 1 ¯ , 0 ¯ + 0 ¯ , 1 ¯ + 1 ¯ } = { 0 ¯ , 1 ¯ , 2 ¯ } .

So

a 2 + b 2 ¯ = a ¯ 2 + b ¯ 2 3 ¯ ,

thus, for any integers a and b ,

a 2 + b 2 3 ( 𝑚𝑜𝑑 4 ) .

In other words, a 2 + b 2 never leaves a remainder of 3 when divided by 4 . □

User profile picture
2026-01-07 10:38
Comments