3. Prove that if n is odd, then 8 divides n2- 1. Prove that 6 divides n п. 4. Let n and k be two positive integers with n 2. Prove that (n-1)² divides n-1 if and only if n-1 divides k.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.2: Mathematical Induction
Problem 7E
icon
Related questions
Question

3

 

3. Prove that if n is odd, then 8 divides n2 – 1. Prove that 6 divides n3
- п.
|
4. Let n and k be two positive integers with n > 2. Prove that (n - 1)² divides nk
-1 if
and only if n - 1 divides k.
Transcribed Image Text:3. Prove that if n is odd, then 8 divides n2 – 1. Prove that 6 divides n3 - п. | 4. Let n and k be two positive integers with n > 2. Prove that (n - 1)² divides nk -1 if and only if n - 1 divides k.
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning