*Proof*.
We look at the worst case scenario. What are the smallest numbers needing

steps. In this case

for

and

. Using
these

's to calculate

and

we find the Fibonacci numbers,
that is the numbers such that

,

.
We get

and

. So if

then
fewer than

steps will do. If

has

digits then

as

This will be shown later.