olymmath

RS-SMO 2018 Problem 6

    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 a∈Aa\in A , there exists x,y∈Ax,y\in A (not necessary distinct) that nk∣a−x−yn_k\mid a-x-y [/*]
    • There's no subset BB of AA that ∣B∣≤k|B|\leq k and nk∣∑b∈Bb.n_k\mid \sum_{b\in B}{b}.

    Show that for all positive integers k≥3k\geq 3 , we've nk<(138)k+2.n_k<\Big( \frac{13}{8}\Big)^{k+2}.

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: Serbian Mathematical Olympiad 2018 official paper, page 2.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator rs-smo/2018/p6 · Tag R7NE2RVK9Q · Edit this page on GitHub · Keys: j next, k previous