Find the smallest positive integer a that solves the congruence: 9x 6 (mod 58)

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section: Chapter Questions
Problem 59RE
icon
Related questions
Question

do fast i will 5 upvotes.

Find the smallest positive integer x that solves the congruence:
x =
9x 6 (mod 58)
(Hint: From running the Euclidean algorithm forwards and backwards we get 1 = s(9) + (58). Find s and use it to solve the congruence.)
Transcribed Image Text:Find the smallest positive integer x that solves the congruence: x = 9x 6 (mod 58) (Hint: From running the Euclidean algorithm forwards and backwards we get 1 = s(9) + (58). Find s and use it to solve the congruence.)
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning