Ask your own question, for FREE!
Mathematics 23 Online
OpenStudy (anonymous):

Anyone knows summation properties??

Parth (parthkohli):

The one with this \(\sum\)?

OpenStudy (apoorvk):

which ones would you like to know?

OpenStudy (anonymous):

\[f(n)=\log_{2}(n)\]

OpenStudy (anonymous):

then \[\sum_{k=2}^{100}f(n)\]

Parth (parthkohli):

I believe that we have an arithmetic series here.

Parth (parthkohli):

Let me wolfram it for a sec.

OpenStudy (apoorvk):

That 'k' would be 'n' right? \[\Sigma \log_2n = \log_22 + \log_23 + ... + \log_2100 = \log_2(2\times 3 \times...\times 100) = \log_2(100!)\] This is what I think, but I may be heading the wrong way totally.

OpenStudy (anonymous):

it is f(2k)

OpenStudy (turingtest):

\[\sum_{k=1}^{100}\log_2(2k)\]?

ganeshie8 (ganeshie8):

then it will be 1 + log(100!)

OpenStudy (anonymous):

@TuringTest the upper one but k=2.

OpenStudy (anonymous):

k=2 to 100.

OpenStudy (turingtest):

\[\sum_{k=2}^{100}\log_2(2k)\]

OpenStudy (turingtest):

\[\log(ab)=\log a+\log b\]

OpenStudy (turingtest):

\[\sum_{k=2}^{100}\log_2(2k)=\sum_{k=2}^{100}\log_22+\log_2k=\sum_{k=2}^{100}1+\log_2(k)\]

OpenStudy (anonymous):

then??????????

OpenStudy (turingtest):

well, how many 1's are we gonna add?

OpenStudy (anonymous):

99

OpenStudy (turingtest):

so\[99+\sum_{k=2}^{100}\log_2k\]now what to to about log(k) exactly... I don't know any tricks offhand...

OpenStudy (anonymous):

then \[\log_{2}(4*6*8*10*12...................................200)\] ??

OpenStudy (turingtest):

we already took out the 2, so\[99+\log_2(2\cdot3\cdot3\cdots100)\]

OpenStudy (apoorvk):

uh oh, means I blooped. Should be: \[\sum_{k=2}^{100}\log_2(2k) = \log_2(2\times2)+ \log_2(2X3) +...+\log_2(2\times100)\] \[=\log_2((2\times2\times2\times...\times2)(2\times3...100))\] \[=\log_2(2^{100})+\log_2(100!)\] \[=100\log_22 + \log_2(100!)\] \[=100 + \log_2(100!)\] This is better I guess.

OpenStudy (apoorvk):

oh sorry I made another mistake!! I am the grand daddy of stupidity >.<

OpenStudy (turingtest):

\[99+\log_2(100!)\]is what I get

OpenStudy (anonymous):

i've got options - a)5010 c)5100 b)5050 d)5049

OpenStudy (apoorvk):

Yeah that would be a "99", am sorry I calculated one extra '2' there..

OpenStudy (turingtest):

hm... now how do we be clever about \(\log_2(100!)\) is the question

OpenStudy (turingtest):

wolfram doesn't give any of those answers

OpenStudy (apoorvk):

Yeah, I am not sure though that 100! would be a whole no. power of 2. And all the options are whole numbers, so.. :S

OpenStudy (turingtest):

no, it's not a whole number

OpenStudy (turingtest):

http://www.wolframalpha.com/input/?i=log_2%28100%21%29%2B99 so now let's play find the typo..

OpenStudy (anonymous):

ans. is 5049. i dont know how??

OpenStudy (apoorvk):

Well, then all the options set here are whole nos. and that makes me scratch my head. If it's 5049, that means \(\log_2(100!)\) equals \(4950\) according to these folks (i.e. if we did it right).

OpenStudy (turingtest):

I really don't see how \[\log_2(100!)\]can/should be a whole number and as you can see above, wolf claims it to be about 525, way smaller than what we want

OpenStudy (anonymous):

\[Suppose f(n)=\log_{2}(3)*\log_{3}(4)*\log_{4}5.........\log_{n-1}(n) \] then the sum \[\sum_{k=2}^{100}=f(2^{k})\]

OpenStudy (anonymous):

Sorry friends

OpenStudy (anonymous):

it was f(2^k) not 2k.

OpenStudy (turingtest):

ok, then\[\sum_{k=2}^{100}\log_2(2^k)\]really? this will be easy

OpenStudy (turingtest):

oh no, the base is changing

OpenStudy (turingtest):

oh dang, now this is a hard problem

OpenStudy (turingtest):

@amistre64 challenging series question

OpenStudy (anonymous):

Cant we take power of 2 out and solve it in an arithmetic progression??

OpenStudy (apoorvk):

how's the base changing?? :S

OpenStudy (turingtest):

the way he wrote it above: Suppose\[ f(n)=\log_{2}(3)*\log_{3}(4)*\log_{4}5.........\log_{n-1}(n)\]

OpenStudy (anonymous):

@TuringTest when you simplify it it becomes log(base2)(n)

OpenStudy (turingtest):

it does? o-0

OpenStudy (anonymous):

\[f(n)=\log3/\log2 * \log4/\log * \log5/\log4 * ...........\log (n)/\log ()\]

OpenStudy (anonymous):

We can observe that everything cancels out except log(n)/log2

OpenStudy (turingtest):

ok, well then that's the hard part for me, but that is interesting. so then the series is an AP like you said.

OpenStudy (anonymous):

ok thanks all. I got it.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!