MathDB
Serbia MO 2018 P6

Source: Serbia MO 2018 P6

April 2, 2018
combinatoricsnumber theory

Problem Statement

For each positive integer kk, let nkn_k be the smallest positive integer such that there exists a finite set AA of integers satisfy the following properties:
[*]For every aAa\in A, there exists x,yAx,y\in A (not necessary distinct) that nkaxyn_k\mid a-x-y[/*] [*]There's no subset BB of AA that Bk|B|\leq k and nkbBb.n_k\mid \sum_{b\in B}{b}.
Show that for all positive integers k3k\geq 3, we've nk<(138)k+2.n_k<\Big( \frac{13}{8}\Big)^{k+2}.