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
-
Project Euler: Problem 4, Palindromic numbers
1266 Solvers
-
Implement a bubble sort technique and output the number of swaps required
385 Solvers
-
377 Solvers
-
Write c^3 as sum of two squares a^2+b^2
328 Solvers
-
1552 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