Number Theory Help: Showing 25 is Strong Pseudoprime to Base 7

buzzmath
Messages
108
Reaction score
0
I'm trying to show that 25 is a strong pseudoprime to the base 7 using millers test. Is there a better way to solve this than just brute force?
Thanks
 
Physics news on Phys.org
I'm not sure of the notation. I assume that you need to compute

7^{25}\;\;\textrm{mod}\;(25).

The way to do is to avoid letting the power get all out of control. Consider:

7*7 = 49 = 24 = -1 mod (25)

so
7*7*7*7 = 1 mod (25).

so what is 7^{24}?

Carl
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top