Given a matrix of input numbers T, R, and N such that gcd(R,N)=1 and 0 <= T < R*N, output the Montgomery reduction of T.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers7
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6847 Solvers
-
633 Solvers
-
365 Solvers
-
151 Solvers
-
377 Solvers
More from this Author65
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!