1. Prove that U1 + U2 = N1N2.
2. Prove that R1 + R2 = [N(N + 1)- =2 for the case where the number of ties is (a) 1, (b) 2, and (c) any number.
3. If N1 = 14, N2 = 12, and R1 = 105, find (a) R2, (b) U1, and (c) U2.
4. If N1 = 10, N2 = 16, and U2 = 60, find (a) R1, (b) R2, and (c) U1.
5. What is the largest number of the values N1, N2, R1, R2, U1, and U2 that can be determined from the remaining ones? Prove your answer.
THE KRUSKAL–WALLIS H TEST