##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Any base equals zero
For any base , we have . Why? Because for any .
This means , , and . You raise anything to the power and get , so the logarithm of is always .
This comes up in base cases when analyzing recursive algorithms. When your input size is , the logarithm contributes to the complexity.
