Olympiad problems

2017, SRMC, 4

Let $p$ be a prime number such that $p\equiv 1\pmod 9$. Show that there exist an integer $n$ such that $n^3-3n+1$ is divisible by $p$.

2017, SRMC, 3

Tags: inequalities proposed , inequalities , srmc

Prove that among any $42$ numbers from the interval $[1,10^6]$, you can choose four numbers so that for any permutation $(a, b, c, d)$ of these numbers, the inequality $$25 (ab + cd) (ad + bc) \ge 16 (ac + bd)^ 2$$ holds.

2017 Silk Road, 3

Tags: inequalities proposed , inequalities , srmc

Prove that among any $42$ numbers from the interval $[1,10^6]$, you can choose four numbers so that for any permutation $(a, b, c, d)$ of these numbers, the inequality $$25 (ab + cd) (ad + bc) \ge 16 (ac + bd)^ 2$$ holds.

2017 Silk Road, 1

Tags: combinatorics , srmc

On an infinite white checkered sheet, a square $Q$ of size $12$ × $12$ is selected. Petya wants to paint some (not necessarily all!) cells of the square with seven colors of the rainbow (each cell is just one color) so that no two of the $288$ three-cell rectangles whose centers lie in $Q$ are the same color. Will he succeed in doing this? (Two three-celled rectangles are painted the same if one of them can be moved and possibly rotated so that each cell of it is overlaid on the cell of the second rectangle having the same color.) (Bogdanov. I)

2017, SRMC, 1

Tags: combinatorics , srmc

On an infinite white checkered sheet, a square $Q$ of size $12$ × $12$ is selected. Petya wants to paint some (not necessarily all!) cells of the square with seven colors of the rainbow (each cell is just one color) so that no two of the $288$ three-cell rectangles whose centers lie in $Q$ are the same color. Will he succeed in doing this? (Two three-celled rectangles are painted the same if one of them can be moved and possibly rotated so that each cell of it is overlaid on the cell of the second rectangle having the same color.) (Bogdanov. I)