Let be a set of real numbers satisfying the following:
(a) for all positive integers ;
(b) if and , then .
Prove that every integer can be written as a product of two different elements in .
Solution
We first observe some natural consequences of property (b):
(i) , since if is arbitrary, then .
(ii) If , then .
(iii) If , then .
(iv) If , then for any integer . This follows easily by induction on (for positive ), using (iii). For negative , apply (ii). For , use (i).
So now we know that for all integers and , and all positive integers and .
Let us first try to write the integer 1 as a product of two different elements in : We can find (by inspection) positive integers such that , for example, . (There are many other possibilities as well.) Hence,
a product of two different elements of .
If is an arbitrary integer, then we have
again a product of two elements of . These two elements of are indeed different, since if , then we would have , which is not an integer.