This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 2

2014 IFYM, Sozopol, 8
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}$.
pairs combinatorics inequalities

2003 German National Olympiad, 6
Prove that there are infinitely many coprime, positive integers $a,b$ such that $a$ divides $b^2 -5$ and $b$ divides $a^2 -5.$
coprime pairs infinitely many solutions number theory divisibility