Problem 46633. Montgomery Reduction Algorithm (REDC)
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 commentsProblem Recent Solvers4
Suggested Problems
-
Maximum running product for a string of numbers
2142 Solvers
-
2024 Solvers
-
130 Solvers
-
262 Solvers
-
151 Solvers
More from this Author55
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!