Well, I have the following question:
How can I write a program such that an input number $n$ is divided by the number $k$ as long as the resulting number does not have one digit, if the resulting number is not an integer we need to take the floor-function of the fraction. Then I need to count how many divisions it took to do that.
When I have the number $n=100$ and $k=2$. Now divide the number by $2$ to get $n/k=50$, that is not a one digit number so we divide by $2$ again and get $n/(2k)=25$, still not a one digit number so divide by $2$ again $n/(3k)=12.5$ which is not an integer so we need to take the floor function $\lfloor12.5\rfloor=12$ now divide by $2$ again and get $6$ which is a one digit number so we stop. The number of divisions is: $4$.