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
-
10704 Solvers
-
16305 Solvers
-
Project Euler: Problem 3, Largest prime factor
1786 Solvers
-
Construct a string from letters and counts
146 Solvers
-
Permute diagonal and antidiagonal
500 Solvers
More from this Author61
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