find the sum
\[\huge\sum_{k=2}^n\frac{1}{\log_ku}\]
What's u?
Try induction using the change of base formula to convert everything into one base
\[\log_{2}(u) = \frac{ \ln (u) }{ \ln (2) } \]
so \[\frac{ 1 }{ \log_{k}(u) } = \frac{ 1 }{ \frac{ \ln (u) }{ \ln (k) } } = \frac{ \ln (k) }{ \ln (u) }\]
Which implies that \[\sum_{k=2}^{n}\frac{ 1 }{ \log_{k}(u) } = \sum_{k=2}^{n}\frac{ \ln (k) }{ \ln (u) }=\frac{ 1 }{ \ln (u) } \sum_{k=2}^{n}\ln (k)\]
...this feels like it's summing to +infinity. Thoughts?
Unless u=0.
Or if u=1 or u < 0 ... assuming we're dealing with real valued solutions@_@
So let's assume u > 1 for simplicity. What happens then?
The sum is unbounded?
It looks like it but for k > 2 we have, for fixed u > 1, \[\log_{k+1} (u) < \log_{k}(u) \] i.e. it's a monotonically decreasing sequence. Hmmm, but is it decreasing "fast enough?"
wait.... \[\log_{k+1}(u) < \log_{k} (u) \rightarrow \frac{ 1 }{ \log_{k+1}(u) } > \frac{ 1 }{ \log_{k}(u) }\] and when k > u the inequality on the right becomes > 1
@__@ confusing myself now lol gonna ponder this one a little longer a bit later
it equals \(\large \log_u n!\) right ?
@domu Thanks again :)
@skullpatrol lol no problem. I hope I confused people only a little bit haha
@ganeshie8 how did you get that? I'm curious :)
ive just expanded the sum
\(\huge\sum_{k=2}^n\frac{1}{\log_ku}\) \(\large \frac{1}{\log_2 u} + \frac{1}{\log_3 u} + \frac{1}{\log_4 u} + \frac{1}{\log_5 u} + ... \frac{1}{\log_n u}\) \(\large \log_u 2 + \log_u 3 +\log_u 4 + \log_u 5 +... + \log_u n\) \(\large \log_u n!\)
AHHH I see it : D. Thank ya @ganeshie8
lol perfect timing!
:)
Join our real-time social learning platform and learn together with your friends!