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

If a,b,c are integers and p is prime that divides both a and a+bc, prove that p|bor p|c.

Short Answer

Expert verified

It is proved that if p is a prime that divides both a anda+bc , thenp|b and p|c .

Step by step solution

01

Consider

It is given that p is a prime that divides both a and a+bc, this means that p|a+bcand p|a. By division algorithm we havethe following:

a=pkanda+bc=pl

This implies,

role="math" localid="1646204473090" pk+bc=plbc=pl-pkbc=pl-k

Therefore,p|bc.

02

p|cStep 2: Show the required result 

Then according tothetheorem, an integer p is prime if and only if p has the property whenever p|bc, then p|bor .

This implies thatp|b and p|c.

Hence,it is provedthat if p is a prime that divides both a anda+bc , then p|band p|c.

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