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 2x=7mod17using the inverse of 2 modulo 7 found in part (a) of Exercise 6.

Short Answer

Expert verified

The congruence is solved

2x=12mod17

Step by step solution

01

Step 1

We have to solve this

2x=7mod17

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

17=(28)+1

So

1=(171)(28)=(171)+((8)2)

02

Step 2

So we can multiply both sides by 9 to obtain that x is equivalent with 12mod17

92x=97(mod17)x63(mod17)

x12(mod17)

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