![Base case is $2 \log(2) = 2$? - Proof by induction that $T(n) = n \times \ log(n)$. - Mathematics Stack Exchange Base case is $2 \log(2) = 2$? - Proof by induction that $T(n) = n \times \ log(n)$. - Mathematics Stack Exchange](https://i.stack.imgur.com/eemMU.png)
Base case is $2 \log(2) = 2$? - Proof by induction that $T(n) = n \times \ log(n)$. - Mathematics Stack Exchange
![The first term of an A.P is log a and the second term is log b . Express the sum to \"n\" terms as a logarithm. The first term of an A.P is log a and the second term is log b . Express the sum to \"n\" terms as a logarithm.](https://dwes9vv9u0550.cloudfront.net/images/5248407/4e4b9cc7-ba3d-40aa-95f0-1a864f2ab995.jpg)
The first term of an A.P is log a and the second term is log b . Express the sum to \"n\" terms as a logarithm.
![Omitting Bases in Logs in Big O. Why we do not consider base of log in… | by randerson112358 | Medium Omitting Bases in Logs in Big O. Why we do not consider base of log in… | by randerson112358 | Medium](https://miro.medium.com/max/479/1*6mJvW5EXgI3tbeefWbthrA.png)
Omitting Bases in Logs in Big O. Why we do not consider base of log in… | by randerson112358 | Medium
![Omitting Bases in Logs in Big O. Why we do not consider base of log in… | by randerson112358 | Medium Omitting Bases in Logs in Big O. Why we do not consider base of log in… | by randerson112358 | Medium](https://miro.medium.com/max/560/1*ChZELVfoKTvUzMl-mo5cuw.png)