1. (a) Prove that for all integers n, 2 divides n
2 + n.
(b) Prove that for all odd integers n, n
2 ≡ 1(mod 8). with proper working
Mathbot Says...
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.
1. (a) Prove that for all integers n, 2 divides n
2 + n.
(b) Prove that for all odd integers n, n
2 ≡ 1(mod 8). with proper working
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.