Prove that if n is an odd positive integer, then n2 = 1 (mod 8).
Solution:Step 1In this question we have to prove that . where, n is an odd positive integer.
Textbook: Discrete Mathematics and Its Applications
Author: Kenneth Rosen
The full step-by-step solution to problem: 40E from chapter: 4.1 was answered by , our top Math solution expert on 06/21/17, 07:45AM. The answer to “Prove that if n is an odd positive integer, then n2 = 1 (mod 8).” is broken down into a number of easy to follow steps, and 15 words. Since the solution to 40E from 4.1 chapter was answered, more than 280 students have viewed the full step-by-step answer. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. This full solution covers the following key subjects: Integer, mod, odd, Positive, prove. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095.