ProveFor any integer p with p1 p is prime iff for all rs tha

Prove:For any integer p with p>1,

p is prime iff for all r,s that is an integer,if r>1 and s>1, then rs is not equal to p.

Thanks.

Solution

. If p is composite, say p = rs with 1 < r < p , 1 < s < p then rs is 0 in Zp but r and s are nonzero, so Zp is not a field.

If p is prime and a is not zero in Zp then the greatest common divisor of a and p is 1, and consequently there are integers x and y such that ax + py = 1.

In Zp this becomes ax = 1, so that every nonzero element in Zp has an inverse in Zp, proving that Zp is a field.

Prove:For any integer p with p>1, p is prime iff for all r,s that is an integer,if r>1 and s>1, then rs is not equal to p. Thanks.Solution. If p is com

Get Help Now

Submit a Take Down Notice

Tutor
Tutor: Dr Jack
Most rated tutor on our site