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
-
4853 Solvers
-
13650 Solvers
-
Recurring Cycle Length (Inspired by Project Euler Problem 26)
164 Solvers
-
The last non-zero digit of a factorial
77 Solvers
-
Convert from Fahrenheit to Celsius
28342 Solvers
More from this Author63
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