Problem 46630. Find R*Rp-N*Np=1 given gcd(R,N)=1
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
Highphi
on 15 Feb 2022
Solution tips: look into the Bezout Identity
Solution Comments
Show commentsProblem Recent Solvers11
Suggested Problems
-
200 Solvers
-
Convert a vector into a number
590 Solvers
-
Remove the two elements next to NaN value
642 Solvers
-
Magic is simple (for beginners)
8264 Solvers
-
Large Sum (inspired by Project Euler 13)
82 Solvers
More from this Author54
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!