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
-
Calculate the Hamming distance between two strings
316 Solvers
-
Find nearest prime number less than input number
696 Solvers
-
Circular Primes (based on Project Euler, problem 35)
470 Solvers
-
144 Solvers
-
Replace pattern 0 1 0 and 1 0 1
134 Solvers
More from this Author54
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!