olymmath

ISL 2014 N4

    Let n>1n>1 be a given integer. Prove that infinitely many terms of the sequence (ak)k⩾1\left(a_{k}\right)_{k \geqslant 1}, defined by ak=⌊nkk⌋a_{k}=\left\lfloor\frac{n^{k}}{k}\right\rfloor are odd. (For a real number x,⌊x⌋x,\lfloor x\rfloor denotes the largest integer not exceeding xx.) (Hong Kong)

    Dataset text NuminaMath olympiads. Quoted with source.

    Official text: IMO 2014 Shortlist booklet, page 10.

    Solutions

    Official solution Solution 1 by the IMO Problem Selection Committee

    The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

    Locator isl/2014/n4 · Tag 979MQFNZNE · Edit this page on GitHub · Keys: j next, k previous