I have to use a lot of logarithmic calculations in one program. In terms of the logarithmic base, the procedure is not specific. I was wondering, if any base `n` (2? 10? e?) is faster in the Python 3.5 `math` module than others, because maybe under the hood all other bases `a` are transformed into `log_a(x) = log_n(x)/log_n(a)`. Or does the choice of the base not influence the speed of the calculation, because all bases are implemented in the same way using a C library?