This is one task for hw, but I really have no clue. Do you?
Given b and k to be positive integers and F_k < b < F_(k+1), where Fk is the k-th fibonacci number.
Let n(b) to be the number of digits that represent b, in the decimal system.
Give the best in your opinion upper and lower bounds for n(b). The bounds have k inside them.