×

# just a simple sum

 0 can anyone explain me the geometric series part in "just a simple sum " tutorial............. http://www.codechef.com/wiki/tutorial-just-simple-sum 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 41●2●3●5 accept rate: 0%

 0 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 3.4k●2●19●55 accept rate: 20% 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/tutorial-just-simple-sum#Back_to_the_geometric_series (24 Jun '12, 22:34)
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×1,084
×67

question asked: 24 Jun '12, 16:55

question was seen: 1,978 times

last updated: 24 Jun '12, 22:34