Prove by induction that the number of (unordered) pairs of integers between 0 and n − 1 is n (n − 1) / 2, and then prove by induction that the number of (unordered) triples of integers between 0 and n − 1 is n (n − 1)(n − 2) / 6.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.