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
-
Find the longest sequence of 1's in a binary sequence.
6246 Solvers
-
260 Solvers
-
478 Solvers
-
209 Solvers
-
Pattern Recognition 1 - Known Unit Length
57 Solvers
More from this Author56
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!