Let be a relation defined on as is is a multiple of . Then is
Given the relation on defined by if is a multiple of .
First, we show that is reflexive by checking whether holds. We have , which is clearly divisible by , so is reflexive.
Next, to verify that is symmetric, suppose ; that is, assume for some integer . Consider the expression . We can write
Since this is a multiple of , it follows that , and hence is symmetric.
Finally, to prove transitivity, suppose and , so that and for some integers . Adding these two equations yields
Rewriting, we have
which is a multiple of . Therefore , and is transitive.
Since is reflexive, symmetric, and transitive, it is an equivalence relation. The correct answer is Option D.
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.