You are not logged in. Please login at www.codechef.com to post your questions!

×

just a simple sum

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

vamsi2708's gravatar image

3★vamsi2708
41235
accept rate: 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.

link

answered 24 Jun '12, 17:38

cyberax's gravatar image

2★cyberax ♦
3.4k21955
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) vamsi27083★
toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • 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,002
×67

question asked: 24 Jun '12, 16:55

question was seen: 1,944 times

last updated: 24 Jun '12, 22:34