According to Johann Blieberger's paper - "Discrete Loops and Worst Case Performance" (1994): sum_{i = 1}^{n}\log_2(i)=nlog_2(n)-2^{log_2(n)) + 1 Now, I was wondering if someone knows what the following may equal? sum_(i = 1)^(n)i log_2(i)=?
grippeb9
Answered question
2022-08-11
Summation with Ceilinged Logarithmic Function According to Johann Blieberger's paper - "Discrete Loops and Worst Case Performance" (1994):
Now, I was wondering if someone knows what the following may equal?
Answer & Explanation
yassou1v
Beginner2022-08-12Added 14 answers
Use sum by parts:
In your case and . You'll get a sum similar to the original, you should be able to solve for that one.