MathDB

We define the following operation which will be applied to a row of bars being situated side-by-side on positions

1, 2, \ldots ,N

. Each bar situated at an odd numbered position is left as is, while each bar at an even numbered position is replaced by two bars. After that, all bars will be put side-by- side in such a way that all bars form a new row and are situated on positions

1, \ldots,M

. From an initial number

a_0 > 0

of bars there originates a sequence

(a_n)_{n \geq 0}

, where an is the number of bars after having applied the operation

n

times.
(a) Prove that for no

n > 0

can we have

a_n = 1997

.
(b) Determine all natural numbers that can only occur as

a_0

a_1

Problem Statement