# Canadian Mathematical Olympiad
1990 ## PROBLEM 1 A competition involving $n \geq 2$ players was held over $k$ days. On each day, the players received scores of $1,2,3, \ldots, n$ points with no two players receiving the same score. At the end of the $k$ days, it was found that each player had exactly 26 points in total. Determine all pairs $(n, k)$ for which this is possible. ## Problem 2 A set of $\frac{1}{2} n(n+1)$ distinct numbers is arranged at random in a triangular array: ![](https://cdn.mathpix.com/cropped/2024_11_22_d44c6cbb61dbb677df78g-1.jpg?height=228&width=532&top_left_y=870&top_left_x=702) Let $M_{k}$ be the largest number in the $k$-th row from the top. Find the probability that $$ M_{1}