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 Solvers14
Suggested Problems
-
6440 Solvers
-
Renaming a field in a structure array
1578 Solvers
-
Project Euler: Problem 5, Smallest multiple
1651 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2540 Solvers
-
319 Solvers
More from this Author61
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