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

Let p be an integer other than 0,±1. Prove that p is prime if and only if it has this property: Whenever r and s are integers such that p=rs, then r=±1or s=±1.

Short Answer

Expert verified

It is proved that if p is prime if and only if it satisfies the property that if p=rs, then r=±1or s=±1.

Step by step solution

01

Prove that if p is prime, then it satisfies the property that if p=rs, then r=±1 or 

According to the given condition, we have p=rs,which is prime.

Then by definition, an integer p satisfies, p0,±1and the only divisors of p are ±pand then that integer p is said to be prime. This implies that s lie in 1,-1,p,-p.

Therefore, r=±1or r=±p,and we have

s=pr=±1.

Hence, it is proved that if p is prime, then it satisfies the property that if p=rs, then p=±1or s=±1.

02

Prove that p is an integer, and it satisfies the property that if p=rs, then r=±1 or s=±1then p is the prime.

Assume that p is not a prime,then it has a divisor r that does not lie in 1,-1,p,-p. This implies that p=rsfor some integer s.

It is given that s=±1or s=±p,thenr=ps and role="math" localid="1646211083470" r=±por±1. The obtained result contradicts the assumption.

Therefore, p is a prime.

Hence,it is proved that if p is prime if and only if satisfies the property that if p=rs, then r=±1or s=±1.

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

Most popular questions from this chapter

The Euclidean Algorithm is an efficient way to find a,b for any positive integers a and b. It only requires you to apply the Division Algorithm several times until you reach the gcd, as illustrated here for 524,148.

(a) Verify that the following statements are correct.

524=148·3+180080<148148=80·1+68068<8080=68·3+12012<6868=12·5+808<1212=8·1+404<88=4·2+0

[The divisor in each line becomes the next line, and the remainder in each line becomes in the next line.]

[As shown in part (b), the last nonzero remainder, namely 4, is the gcd (a,b).

(b) Use part (a) and Exercises 13 and Example 4 to prove that

524,148=148,80=80,68=68,12=12,8=8,4=4,0=4

Use the Euclidean Algorithm to find

(c)1003,456

(d) 322,148

(e) (5858,1436)

The equations in part (a) can be used to express the gcd 4 as a linear combination of 524 and 148 as follows. First, rearrange the first 5 equations in part (a), as shown below.

localid="1645873482628" 80=524-148·3(1)68=148-80(2)12=80-68·3(3)8=68-12·5(4)4=12-8(5)

(f) Equation (1) expresses 80 as a linear combination of 524 and 148. Use this fact and Equation (2) to write 68 as a linear combination of 524 and 148.

(g) Use Equation (1), part (f), and Equation (3) to write 12 as a linear combination of 524 and 148.

(h) Use parts (f) and (g) to write 8 as a linear combination of 524 and 148.

(i) Use parts(g) and (h) to write the gcd 4 as a linear combination of 524 and 148, as desired.

(j) Use the method described in parts (t)-(i) to express the gcd in part (c) as a linear combination of 1003 and 456.

Let a,b,nbe integers with n>1and let d=a,n. Prove that the equation has distinct solution in nas follows.

(a) Show that the solutions listed in exercise 13 (b) are all distinct.

(b) If x=ris any solution of ax=b, show that r=ub1+kn1for some integer kwith 0kd-1.

Let p be an integer other than 0, ±1. Prove that p is prime if and only if eacha eithera,p=1 or p|a.

Prove that a,b=1if and only if there is no prime psuch thatp|a and p|b.

In Exercises 3 and 4, use a calculator to find the quotient q and remainder r when a is divided by b.

(a) a=8,126,493;b=541

(b) a=-9,217,645;b=617

(c)a=171,819,920;b=4321

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free