(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Both of these questions are similar but the second is much larger so I thought I would post them both.

Solve:

1) 252^(611) mod 1207

2) 8126^(3461) mod 8549

2. Relevant equations

Well, the most difficult part is that the numbers are so large you cannot just put it in the calculator.

When you mod a number you are just looking for the remainder after you divide.

3. The attempt at a solution

First I tried just putting it in my calculator and my calculator responded with infinity as the answer, which is not correct.

So I started thinking about what I know about mod's. I know my answer for the first question will be in the quantity 0<=ANSWER<=1206 and my second question will be 0<=ANSWER<=8548.

So I tried to break up the exponent into smaller values such as 252^10 * 252^10 * ... but I realized that this would take really long and for my second question, that method would not be practical. So there has got to be someway to break the number down to a size the calculator can handle. Also the mod function by definition would be a great way to reduce that number if there was some way I could mod the number before taking the exponents when I break it down, but I'm not sure the rules and manipulates required to adjust the problem. There just has to be a better way to solve this type of a problem. Could you help? Thanks.

**Physics Forums - The Fusion of Science and Community**

# Solving large #s raised to a large # with the mod function

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Solving large #s raised to a large # with the mod function

Loading...

**Physics Forums - The Fusion of Science and Community**