@Indrajeet: The usual proof of a statement like this is by the method of mathematical induction. In this case, show that it is true for n = 2. Next, show that if it is true for n = m, then it also is true for n = m+1. Finally, apply the principle of mathematical induction to conclude that it is true for all n >= 2.
Thus, it becomes an algebra problem, in which you have to show that 1/2 n^2 lgn - 1/8 n^2 + (n-1) lg(n-1) <= 1/2 (n+1)^2 lg(n+1) - 1/8 (n +1)^2. Dave On Aug 8, 10:51 am, Indrajeet Khater <indrajeet.kha...@gmail.com> wrote: > prove that summation k=1 to n-1 klgk <= 1/2 n^2 lgn-1/8 n^2 > > how do u solve this? > > please help! -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
