Can anyone explain, with the aid of a mathematical proof, why bases are omitted in Big - O notation?
EDIT: I don't understand how:
NB: $\log_2(n) =$ log to the base 2 of n
$log_2(n) = \log_k(n)/\log_k(2)$
proves that bases are omitted in Big O...please can some explain?