Home Competitions CMO 1993 Problem 5
Let y 1 , y 2 , y 3 , … y_{1}, y_{2}, y_{3},\ldots y 1 , y 2 , y 3 , … be a sequence such that y 1 = 1 y_{1}=1 y 1 = 1 and, for k > 0 , k>0, k > 0 , is defined by the relationship:
y 2 k = { 2 y k if k is even 2 y k + 1 if k is odd y_{2k}=\begin{cases}2y_{k}& \text{if}~k~ \text{is even} 2y_{k}+1 & \text{if}~k~ \text{is odd}\end{cases} y 2 k = { 2 y k if k is even 2 y k + 1 if k is odd y 2 k + 1 = { 2 y k if k is odd 2 y k + 1 if k is even y_{2k+1}=\begin{cases}2y_{k}& \text{if}~k~ \text{is odd} 2y_{k}+1 & \text{if}~k~ \text{is even}\end{cases} y 2 k + 1 = { 2 y k if k is odd 2 y k + 1 if k is even Show that the sequence takes on every positive integer value exactly once.
Dataset text AI-MO AoPS . Quoted with source.
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 ca-cmo/1993/p5 · Tag AXM1BG7G2X · Edit this page on GitHub · Keys: j next, k previous