Difference between revisions of "2000 PMWC Problems/Problem I2"
(→See Also) |
(→Solution) |
||
| Line 3: | Line 3: | ||
==Solution== | ==Solution== | ||
| + | As far as we know, the greatest prime number is <math>2^{6972593}-1</math>. What is the remainder when <math>2^{6972593}-1</math> is divided by <math>5</math>? | ||
| + | |||
| + | |||
Since the question only asks for the remainder when this monstrous number is divided by 5, we can use some tricks to reduce this number. | Since the question only asks for the remainder when this monstrous number is divided by 5, we can use some tricks to reduce this number. | ||
Revision as of 11:01, 23 December 2019
Problem
As far as we know, the greatest prime number is 
. What is the remainder when is divided by 
?
Solution
As far as we know, the greatest prime number is . What is the remainder when is divided by ?
Since the question only asks for the remainder when this monstrous number is divided by 5, we can use some tricks to reduce this number.
Specifically, since 
, and 16 has a remainder of 1 when divided by 5, all of the 
s within 
can be divided out. Another way of explaining that step is that if you split into as many factors of 16 as you could and had whatever was left on the side, you could remove all of the 
s because multiplying a number by is multiplying it by 
, and so will not change its remainder when divided by . Applying this logic to , we find that it simplifies to 
, leaving 
, which is clearly just 
.
Thus the remainder is .
See Also
Back to test: https://artofproblemsolving.com/wiki/index.php/2000_PMWC_Problems
