Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Solve the congruence 4x=5mod9using the inverse of 4 modulo9 found in part (a) of Exercise 5.

Short Answer

Expert verified

The congruence is solved

x=8mod9

Step by step solution

01

Step 1

We have to solve this

4x=5mod9

We use Bezout’s Theorem to express gcd9,4, as a lineal combination of 9 and 4. Thus we can observe that the inverse of 4 is -2, but if we add 9 to -2, we obtain7, so the inverse is, as well, 7

9=(24)+1

So

1=(91)(24)=(91)+((2)4)

02

Step 2

So we can multiply both sides by 7to obtain that is equivalent with 8mod9

74x=75(mod9)x=35(mod9)

x=8(mod9)

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Study anywhere. Anytime. Across all devices.

Sign-up for free