(a) First rewrite the rule. a+d=b+c is the same as
b−a=d−c
so two trips are related exactly when they have the same net climb b−a.
- Reflexive: b−a=b−a, so (a,b)R(a,b).
- Symmetric: if b−a=d−c, then d−c=b−a, so (c,d)R(a,b).
- Transitive: if b−a=d−c and d−c=f−e, then b−a=f−e, so (a,b)R(e,f).
Hence R is an equivalence relation on A×A.
(b) The net climb of (2,5) is 5−2=3. We need every (c,d)∈A×A with d−c=3, that is, d=c+3≤6, so c≤3:
[(2,5)]={(1,4),(2,5),(3,6)}
(c) Each class is fixed by its net climb k=b−a. With floors 1 to 6, k can be any integer from 1−6=−5 to 6−1=5, and each of these values does occur. So there are
5−(−5)+1=11 classes
A class with net climb k contains the trips (a,a+k) with both floors between 1 and 6. There are 6−∣k∣ of them. The largest class is k=0, the six trips (1,1),(2,2),…,(6,6), with 6 trips.
(d) Two trips are related exactly when they lie in the same class. A class with m trips gives m2 ordered pairs. The class sizes for k=−5,…,5 are 1,2,3,4,5,6,5,4,3,2,1, so
∣R∣=2(12+22+32+42+52)+62=2(55)+36=146

(e) With floors 1 to n, the net climb runs from −(n−1) to n−1, so the number of classes is
(n−1)−(−(n−1))+1=2n−1
The class with net climb k has n−∣k∣ trips, so the sizes are 1,2,…,n−1,n,n−1,…,2,1. Using 12+22+⋯+m2=6m(m+1)(2m+1) with m=n−1:
∣R∣=n2+2⋅6(n−1)n(2n−1)=33n2+n(2n2−3n+1)=3n(2n2+1)
Check at n=6: classes 2(6)−1=11, matching (c); and ∣R∣=36(2⋅36+1)=2⋅73=146, matching (d).