exam: RMM

problem:
Prove that for every positive integer $n$ there exists a (not necessarily convex) polygon with no three collinear vertices, which admits exactly $n$ different triangulations.
(A triangulation is a dissection of the polygon into triangles by interior diagonals which have no common interior points with each other nor with the sides of the polygon.)

problem_match: Problem 4.


problem:
Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying

$$
f(x+y f(x))+f(x y)=f(x)+f(2019 y)
$$

for all real numbers $x$ and $y$.

problem_match: Problem 5.


problem:
Find all pairs of integers $(c, d)$, both greater than 1 , such that the following holds:

For any monic polynomial $Q$ of degree $d$ with integer coefficients and for any prime $p>c(2 c+1)$, there exists a set $S$ of at most $\left(\frac{2 c-1}{2 c+1}\right) p$ integers, such that

$$
\bigcup_{s \in S}\{s, Q(s), Q(Q(s)), Q(Q(Q(s))), \ldots\}
$$

is a complete residue system modulo $p$ (i.e., intersects with every residue class modulo $p$ ).

Each of the three problems is worth 7 points.
Time allowed $4 \frac{1}{2}$ hours.

problem_match: Problem 6.