I've received more requests for this calculator, so it is now ready, complete with a quiz generator and shortcut commands. It solves modular exponentiations in the form $\displaystyle x^n mod p$
Modular Exponentiation Calculator
I've received more requests for this calculator, so it is now ready, complete with a quiz generator and shortcut commands. It solves modular exponentiations in the form $\displaystyle x^n mod p$
Modular Exponentiation Calculator
Enhancement Update: I have also added the method of Successive Squaring to this lesson as well.
If you enter your $\displaystyle x^n \mod p$ statement in the search engine, the program will prompt you by asking how you wish to solve it, using modular exponentiation or successive squaring.
I'm afraid there is a problem:
"13 goes into 103^(673) a total of 7 times" (This came up in the problem $\displaystyle 103^{673} \text{ mod 13}$.) It said the answer is 12 mod 13. I didn't check to see if this is right.
-Dan
Heh. I guess I was giving it a work out. I didn't realize that 673 is a prime number.
topsquark,
Is it incorrect? Modular Exponentiation comes up with the same answer. Let me know if I went wrong somewhere.
Also, if the exponent is not prime, do I need to take a different route? I ask because I changed the Chinese Remainder Theorem lesson to do the pairwise coprime test recently.
I think I may have pinned something down. It is taking "103^673 mod 13" and doing it all right. But I put in "103^(673) mod 13" and it seems to be having some kind of problem. Last night it gave a correct answer (12), but there was a line of text (see my first post in this thread) that was wrong. Today it is giving me an incorrect answer, 1. It doesn't seem to like the parenthesis.
-Dan