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
-
Spherical radius given four points
251 Solvers
-
Circular Primes (based on Project Euler, problem 35)
650 Solvers
-
Reverse the elements of an array
1111 Solvers
-
429 Solvers
-
Integer Sequence - II : New Fibonacci
676 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