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 Solvers17
Suggested Problems
-
Return the largest number that is adjacent to a zero
5547 Solvers
-
Count from 0 to N^M in base N.
241 Solvers
-
Mysterious digits operation (easy)
330 Solvers
-
6629 Solvers
-
136 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