Raza
- 203
- 0
Homework Statement
95937 mod 2537
Homework Equations
None
The Attempt at a Solution
Here's what my friend did:
How do I do this? and how did he do this?
Last edited:
The discussion focuses on solving the modular exponentiation problem of calculating 95937 mod 2537. The correct answer is established as 1520, achieved through the use of MAGMA, a computational algebra system. The breakdown of the calculation involves utilizing properties of modular arithmetic and the Chinese Remainder Theorem, leading to the simplification of the large exponentiation into manageable components. The participants clarify the steps taken to arrive at the solution, emphasizing the importance of modular reduction at each stage.
PREREQUISITESMathematicians, computer scientists, and students studying number theory or cryptography who are interested in modular arithmetic and computational methods for solving large exponentiation problems.
This can't be right, because the product above ends with a 0. Powers of any number that ends with a 5 will also end with a 5 (except if the exponent is 0). In fact, for n >=5,Raza said:95 \times 1786 \times 341 \times 2188 \times 403
How do I do this? and how did he do this?
This isn't right either. According to Calculator,Raza said:Here's what my friend did:
95^{937}
95 \times 240^{234}
n := 2537;
R := ResidueClassRing(n);
number := R ! 95;
number ^ 937;