buzzmath Messages 108 Reaction score 0 Thread starter Mar 6, 2006 #1 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
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
CarlB Science Advisor Homework Helper Messages 1,246 Reaction score 45 Mar 6, 2006 #2 I'm not sure of the notation. I assume that you need to compute [tex]7^{25}\;\;\textrm{mod}\;(25).[/tex] 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
I'm not sure of the notation. I assume that you need to compute [tex]7^{25}\;\;\textrm{mod}\;(25).[/tex] 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