Prove that for p ≥ 3 a prime, there is only one integer among {1, 2, . . . , p} of order 2 modulo p, and this integer is p − 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 5E: Prove that if p and q are distinct primes, then there exist integers m and n such that pm+qn=1.
icon
Related questions
Question

Prove that for p ≥ 3 a prime, there is only one integer among {1, 2, . . . , p}
of order 2 modulo p, and this integer is p − 1.

Expert Solution
steps

Step by step

Solved in 2 steps with 1 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
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage