In this problem we work out step-by-step the procedure for checking an equivalence relation. Denote by the set of all integers. Declare that two integers are related if is an integer multiple of . In symbols:


We want to check if this is an equivalence relation. That means we need to check if is
(1) Reflexive
(2) Symmetric
(3) Transitive

We begin with (1). This means checking to make sure that for all integers , we have . Recall the definition of for this problem and we see that this is equivalent to saying that for all integers , we have that is an integer multiple of .

Is this true? If so, enter Y; if not, enter an integer for which this is false.

Next, we check (2). This means checking to make sure that for all integers , we have . Unwind the definition of as we have done for (1) and we see that

for some integer

for some integer

Based on that, is (2) true? If so, enter Y; if not, enter a pair of integers for which this is false.


Finally, we check (3). This means checking to make sure that for all integers , if and then .

Is this true? If so, enter Y; if not, give a triple of integers for which this fails.

Finally, based on this calculation, is an equivalence relation on the set of integers? Enter Y or N.

You can earn partial credit on this problem.