Let a , b >= 1 and x ∈ Z. Prove that if xb ≡ 1 (mod a) then gcd(x, a) = 1

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.3: Divisibility
Problem 20E: Let a,b,c and d be integers such that ab and cd. Prove that acbd.
icon
Related questions
Question
  1. Let a , b >= 1 and x ∈ Z. Prove that if xb ≡ 1 (mod a) then gcd(x, a) = 1 
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning