# Prove that if n is an odd positive integer, then n2 = 1 ## Problem 40E Chapter 4.1

Discrete Mathematics and Its Applications | 7th Edition

• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 0 390 Reviews
23
0
Problem 40E

Prove that if n is an odd positive integer, then n2 = 1 (mod 8).

Step-by-Step Solution:

Solution:Step 1In this question we have to prove that . where, n is an odd positive integer.Step 2Here, we have n is an odd positive integer which can be represented as (2k+1).Where, k is an positive integer.So, we can write Squaring on both side...

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

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 229 students have viewed the full step-by-step answer. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7th. 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.

Unlock Textbook Solution

Prove that if n is an odd positive integer, then n2 = 1

×
Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 4.1 - Problem 40e

Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 4.1 - Problem 40e

I don't want to reset my password

Need help? Contact support

Need an Account? Is not associated with an account
We're here to help