The Answer to the Question
is below this banner.
Here's the Solution to this Question
Let is number of pairs of graders, is number of exams checks.
We have, by the given rule:
Maximum willbe in case when
We can prove the given formula by induction:
Then we have for
So, the given formula is the upper bound for the maximum of exam checks.