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 Solvers15
Suggested Problems
-
16871 Solvers
-
Sum of first n terms of a harmonic progression
519 Solvers
-
Return elements unique to either input
814 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
113 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
190 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