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
-
Project Euler: Problem 3, Largest prime factor
1400 Solvers
-
Find the stride of the longest skip sequence
150 Solvers
-
70 Solvers
-
822 Solvers
-
Chebyshev polynomials of the 1st Kind
70 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!