Find Rp and Np, such that R*Rp-N*Np=1, given gcd(R,N)=1.
0<=Rp<N
0<=Np<R
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers16
Suggested Problems
-
3877 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1329 Solvers
-
Calculate the Hamming distance between two strings
349 Solvers
-
194 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2219 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!
Solution tips: look into the Bezout Identity