Solution to Exercise 5.2.5* from Competitive Programming 3rd - (Halim) ?
Difference between en1 and en2, changed 2 character(s)
Recently I was studying math and came across this problem:↵

Given 1 < a < 10,  1 <= n <= 100000, show how to compute the value of: 1 * a + 2 * a^2 + 3 * a^3 + ... + n * a^n efficienty, i.e. in O(log n)!↵

Could someone give ideas/way to solve this problem?↵

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English caiocandido 2016-05-22 03:44:28 2 (published)
en1 English caiocandido 2016-05-22 03:44:05 333 Initial revision (saved to drafts)