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
-
1631 Solvers
-
1443 Solvers
-
16896 Solvers
-
Project Euler: Problem 3, Largest prime factor
1818 Solvers
-
Factorions: Numbers that equal the sum of the factorials of their digits
83 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