Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I was solving this equation:- $$key=(\sum_{K=0}^n\frac{1}{a^K})\mod m$$

Given

$$ 1,000,000,000 < a, n, m \; < 5,000,000,000 $$ $$ a, m \; are \;coprime $$

I solved it bruteforcely but it won't work in the given constrains so I need a faster algorithm or is there is something I can notice to make the formula easier to solve ?

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.