can anyone explain me the geometric series part in "just a simple sum " tutorial............. http://www.codechef.com/wiki/tutorialjustsimplesum that is how to get mod(p^k) value for the geometric sum in all different cases... can anyone suggest alternative approaches for this problem..................... asked 24 Jun '12, 16:55

p^k%m can be computed fast by fast modular exponentiation. please let us know if this wikipedia page is not enough for you to understand. answered 24 Jun '12, 17:38
thanks for the reply......... i can understand that one but please explain me the part which is under the sideheading (back to geometric series ) in just a simple sum tutorial or see this link http://www.codechef.com/wiki/tutorialjustsimplesum#Back_to_the_geometric_series
(24 Jun '12, 22:34)
