(i) For any two sets and , prove that if and only if .
(ii) Let be the set of prime numbers and . Use (i) to find .
Confirming your payment
Practice Questions · Question 32 of 37
(i) For any two sets and , prove that if and only if .
(ii) Let be the set of prime numbers and . Use (i) to find .
(i) Recall that . So always.
() Suppose . We show that .
Suppose some . Then , and since , we get , so .
But also gives . This is a contradiction. So has no element, that is, .
() Suppose . We show that .
We already have . Now let . If , then , which is impossible. So , and therefore . Hence .
Since and , we get .
Hence if and only if .
(ii) Every element of has the form with . Such a number is at least and is divisible by , and is neither nor the number itself. So no multiple of is prime.
By (i), with and ,
that is, is the set of all prime numbers .