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

Use Fermat’s little theorem to evaluate9200mod19

Short Answer

Expert verified

9200mod19=5

Step by step solution

01

Fermat’s little Theorem

Which says that,Ifpis a prime,m is any integer andp/m thenmp-11(modp).

02

Evaluating 9200 mod 19

Here we have m=9, andp=19

Now, by Fermat’s little theorem we have,

9181(mod19)

Now,

9200=9(1811)+2=9(1811)92192(mod19)81(mod19)5(mod19)

Hence, 9200mod19=5.

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