For each integer , let
(i) Show that for every integer .
(ii) Find all integers for which .
(iii) Prove that is never a singleton set.
Confirming your payment
Competency-Based Questions (CBQ) · Question 71 of 80
For each integer , let
(i) Show that for every integer .
(ii) Find all integers for which .
(iii) Prove that is never a singleton set.
(i) If , it is a subset of every set. Otherwise let . Then , which can be written as
Here and is an integer, so is a divisor of . The divisors of are , so .
(ii) By (i), if then , so :
Each of these values works: , , . Hence exactly when .
(iii) If , it is not a singleton. Otherwise take and let , which is a natural number by (i). Then
So as well. If were a singleton, we would need , that is, . No natural number has square . So always has either no element or two different elements, and it is never a singleton.