NL-NWO 2014

Determine all triples $(a,b,c)$ , where $a, b$ , and $c$ are positive integers that satisfy $a \le b \le c$ and $abc = 2(a + b + c)$ .

At a volleyball tournament, each team plays exactly once against each other team. Each game has a winning team, which gets $1$ point. The losing team gets $0$ points. Draws do not occur. In the nal ranking, only one team turns out to have the least number of points (so there is no shared last place). Moreover, each team, except for the team having the least number of points, lost exactly one game against a team that got less points in the final ranking. a) Prove that the number of teams cannot be equal to $6$ . b) Show, by providing an example, that the number of teams could be equal to $7$ .

A quadruple $(p, a, b, c)$ of positive integers is called a Leiden quadruple if

• $p$ is an odd prime number,
• $a, b$ , and $c$ are distinct and
• $ab + 1, bc + 1$ and $ca + 1$ are divisible by $p$ . a) Prove that for every Leiden quadruple $(p, a, b, c)$ we have $p + 2 \le \frac{a+b+c}{3}$ . b) Determine all numbers $p$ for which a Leiden quadruple $(p, a, b, c)$ exists with $p + 2 = \frac{a+b+c}{3}$

We consider the ways to divide a $1$ by $1$ square into rectangles (of which the sides are parallel to those of the square). All rectangles must have the same circumference, but not necessarily the same shape. a) Is it possible to divide the square into 20 rectangles, each having a circumference of $2:5$ ? b) Is it possible to divide the square into 30 rectangles, each having a circumference of $2$ ?