(a) Write cl(a) for the class of student a. Then (a,b)∈R means cl(a)=cl(b).
Reflexive: for any student a, cl(a)=cl(a), so (a,a)∈R.
Symmetric: if (a,b)∈R then cl(a)=cl(b), so cl(b)=cl(a), giving (b,a)∈R.
Transitive: if (a,b)∈R and (b,c)∈R then cl(a)=cl(b) and cl(b)=cl(c), so cl(a)=cl(c) and (a,c)∈R.
All three hold, so R is an equivalence relation. The equivalence class of a student a is
[a]={x∈A: cl(x)=cl(a)},
i.e. the set of all students in a's class. So the elements of A/R are exactly the classes of the school — one class, one element of A/R.

(b) Each class is one equivalence class and the classes partition the 500 students into blocks of 50, so
∣A/R∣=50500=10.
π is onto: every class in the school is non-empty (it has 50 students), so pick any student a in a given class X; then π(a)=X. Nothing in A/R is left unused.
π is not one-one: a class holds 50 students. Take two different students a=b in the same class; then π(a)=π(b) although a=b.
There is no contradiction in being onto and not one-one at the same time: ∣A∣=500>10=∣A/R∣, and 500 inputs can cover 10 outputs with plenty of collisions to spare.
(c) Symmetric. Suppose (X,Y)∈S. Then there is a student a in class X whose sibling b studies in class Y, with Y=X. Being a sibling is a mutual relationship, so b is a student of class Y whose sibling a studies in class X, and X=Y. That is exactly the statement (Y,X)∈S. So S is symmetric, whatever the school looks like.
No class is related to itself. For (X,X) to lie in S we would need a student of class X with a sibling in a class different from X which is also X — impossible, since X=X is false. So (X,X)∈/S for every class X.
Hence S is not transitive when it is non-empty. Suppose S=∅, so (X,Y)∈S for some classes X,Y. By symmetry (Y,X)∈S as well. If S were transitive, then from (X,Y)∈S and (Y,X)∈S we would get (X,X)∈S — which we have just shown is impossible. So S is not transitive.
This is stronger than producing one counterexample school: a symmetric relation that never relates an element to itself can never be transitive unless it is empty.
(d) The largest possible value is
∣S∣max=380.
Upper bound. In this re-organised school A/R is the set of the 20 classes, so it has 20 elements (not the 10 of part (b), where the classes were larger). S is a relation on that set, so S⊆(A/R)×(A/R), which has 20×20=400 ordered pairs. By part (c) the 20 diagonal pairs (X,X) can never belong to S. Hence
∣S∣≤400−20=380=20×19=2(220).
The bound is attained. There are (220)=190 unordered pairs of distinct classes. Arrange the siblings like this: for each unordered pair {X,Y} of distinct classes, choose one student of X and one student of Y, not yet used, and make those two siblings.
Count the resources this uses.
| quantity | value |
|---|
| unordered pairs of distinct classes | (220)=190 |
| sibling pairs created (one per class pair) | 190 |
| students used, 2 per sibling pair | 380 |
| students available | 500 |
| pairs {X,Y} a fixed class X appears in | 19 |
| students of X used, one per such pair | 19 of its 25 |
Every student is used in at most one sibling pair, so "at most one sibling" is respected. Each of the 190 class pairs {X,Y} now contributes both (X,Y) and (Y,X) to S, giving 2×190=380 ordered pairs, and no diagonal pair appears. So ∣S∣=380 exactly.
(e) Least class size. Fix a class X. For (X,Y) to lie in S for all 19 other classes Y, class X must supply, for each such Y, a student whose sibling is in Y. A single student has at most one sibling, so a single student can witness at most one of those 19 pairs. Hence 19 different students of X are needed, and therefore
each class must contain at least 19 students.
Why 20 classes of 18 cannot reach 380. This is a separate, smaller school: 20 classes of 18, so 360 students in all. Fix any class X. Each of its 18 students has at most one sibling, so the students of X can between them witness at most 18 of the 19 pairs {X,Y}. At least one class Y0 is therefore left unwitnessed: (X,Y0)∈/S, and by symmetry (Y0,X)∈/S as well. Those two ordered pairs are missing from S no matter how the siblings are arranged, so
∣S∣≤380−2=378<380.
The obstruction is purely the class size: 19 partners are needed and only 18 students are available to provide them.
Students with no sibling. Back in the school of part (d) — 500 students, 20 classes of 25. When ∣S∣=380 is attained, the construction uses 2×190=380 students in sibling pairs. Every one of those 380 has a sibling. The remaining students are
500−380=120,
so at most 120 students have no sibling in the school. This is the greatest possible number, since any arrangement attaining ∣S∣=380 needs all 190 class pairs witnessed, hence at least 190 sibling pairs, hence at least 380 students with a sibling.