(a) All three of R, S and T are reflexive.
- R: a≤a is true for every a, so (a,a)∈R for a=1,2,3,4,5.
- S: a+a=2a, which is even for every a, so (a,a)∈S.
- T: a−a=0, which is even, so (a,a)∈T.
(b) Only S and T are symmetric.
- R: not symmetric. (1,2)∈R since 1≤2, but (2,1)∈/R since 2≤1.
- S: symmetric. a+b=b+a, so if a+b is even then b+a is the same even number.
- T: symmetric. If a−b is even then b−a=−(a−b) is even too.
(c) All three of R, S and T are transitive.
- R: if a≤b and b≤c then a≤c.
- S: suppose a+b is even and b+c is even. Add the two:
(a+b)+(b+c)=(a+c)+2b.
The left-hand side is a sum of two even numbers, so it is even; and 2b is even. Therefore a+c is even, and (a,c)∈S.
This is the step most often got wrong. The parity of a+c does not depend on b, because b enters only through 2b, which is even whatever b is.
- T: suppose a−b and b−c are even. Add them: (a−b)+(b−c)=a−c, a sum of two even numbers, so a−c is even and (a,c)∈T.
(d) S and T are equivalence relations; R is not.
An equivalence relation must be reflexive, symmetric and transitive. Collecting parts (a)–(c):
| Relation | Reflexive | Symmetric | Transitive | Equivalence relation |
|---|
| R: a≤b | Yes | No | Yes | No |
| S: a+b even | Yes | Yes | Yes | Yes |
| T: a−b even | Yes | Yes | Yes | Yes |
R fails only on symmetry, and that one failure is enough.
(e)
First, S=T. For any integers a and b,
(a+b)−(a−b)=2b,
which is even. Two numbers that differ by an even number have the same parity, so a+b is even exactly when a−b is even. Both conditions say the same thing: a and b are either both odd or both even. Hence S and T contain precisely the same pairs — they are one relation written two ways.
Writing that relation out on A={1,2,3,4,5}:
S=T={(1,1),(1,3),(1,5),(3,1),(3,3),(3,5),(5,1),(5,3),(5,5),(2,2),(2,4),(4,2),(4,4)},
which is 9 pairs among the odds and 4 among the evens, 13 in all.
Now the classes. The class of an element collects everything related to it.
[1]={1,3,5},[3]={1,3,5},[5]={1,3,5},[2]={2,4},[4]={2,4}.
Only two distinct classes appear: {1,3,5} and {2,4}.
The two classes are disjoint and their union is the whole of A — they partition A into its odd and its even members, which is exactly what an equivalence relation always does.

A remark on why the question asks about S and not R. Equivalence classes only exist for an equivalence relation. R (a≤b) is not symmetric, so it is not an equivalence relation and has no equivalence classes. Since S=T, the classes above are also the equivalence classes of T.