Maths Olympiad Prep

Library / /6 of 35

Algebra Difficulty 4.9 AIME Prove it Belarus

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

Solution

3. See IMO-2014 Shortlist, Problem N4.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.