But following strict math: number of times a number can be divided by 2 until ≤1 is floor(log₂(n)) + 1? No — standard: number of full divisions to reach 1 is floor(log₂(n)) if we count how many halvings reach 1, but only if n is power of 2. - Portal da Acústica