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
-
Maximum running product for a string of numbers
2258 Solvers
-
Determine if input is a perfect number
267 Solvers
-
12247 Solvers
-
Form a square matrix from four square sub-matrices
136 Solvers
-
1732 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