olymmath

NMC 2016

Nordic Mathematical Contest 2016.

Other problems

Problem 1

Determine all sequences of non-negative integers a1,…,a2016a_{1}, \ldots, a_{2016} all less than or equal to 2016 satisfying i+j∣iai+jaji+j \mid i a_{i}+j a_{j} for all i,j∈{1,2,…,2016}i, j \in\{1,2, \ldots, 2016\}.

Problem 2

Let ABCDA B C D be a cyclic quadrilateral satisfying AB=ADA B=A D and AB+BC=CDA B+B C=C D.

Determine ∠CDA\angle C D A.

Problem 3

Find all a∈Ra \in \mathbb{R} for which there exists a function f:R→Rf: \mathbb{R} \rightarrow \mathbb{R}, such that

(i) f(f(x))=f(x)+xf(f(x))=f(x)+x, for all x∈Rx \in \mathbb{R},

(ii) f(f(x)−x)=f(x)+f(f(x)-x)=f(x)+ ax, for all x∈Rx \in \mathbb{R}.

Problem 4

King George has decided to connect the 1680 islands in his kingdom by bridges. Unfortunately the rebel movement will destroy two bridges after all the bridges have been built, but not two bridges from the same island.

What is the minimal number of bridges the King has to build in order to make sure that it is still possible to travel by bridges between any two of the 1680 islands after the rebel movement has destroyed two bridges?