olymmath

JBMO-SL 2008 A9

Consider an integer n≥4n \geq 4 and a sequence of real numbers x1,x2,x3,…,xnx_{1}, x_{2}, x_{3}, \ldots, x_{n}. An operation consists in eliminating all numbers not having the rank of the form 4k+34 k+3, thus leaving only the numbers x3,x7,x11,…x_{3}, x_{7}, x_{11}, \ldots (for example, the sequence 4,5,9,3,6,6,1,84,5,9,3,6,6,1,8 produces the sequence 9,1 . Upon the sequence 1,2,3,…,10241,2,3, \ldots, 1024 the operation is performed successively for 5 times. Show that at the end only 1 number remains and find this number.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

683

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

Locator jbmo-sl/2008/a9 · Tag KT927Q1EDW · Edit this page on GitHub · Keys: j next, k previous