In a class with $n$ students in the span of $k$ days, each day are chosen three to be tested. Each two students can be taken in such triple only once. Prove that for the greatest $k$ satisfying these conditions, the following inequalities are true: $\frac{n(n-3)}{6}\leq k\leq \frac{n(n-1)}{6}$.
Problem
Source: V International Festival of Young Mathematicians Sozopol 2014, Theme for 10-12 grade
Tags: combinatorics, pairs