Let p be a prime and k a positive integer such that ak mod p = a mod p for all integers a. Prove that p – 1 divides k – 1.
Let p be a prime and k a positive integer such that ak mod p = a mod p for all integers a. Prove that p – 1 divides k – 1.
Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.4: Prime Factors And Greatest Common Divisor
Problem 19E: Prove that if n is a positive integer greater than 1 such that n is not a prime, then n has a...
Related questions
Question
Let p be a prime and k a positive integer such that ak mod p = a mod p for all integers a. Prove that p – 1 divides k – 1.
Expert Solution
Step 1
Given:
is a prime and is a positive integer such that for all integers .
To Prove:
divides .
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.Recommended textbooks for you
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage