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 Solvers12
Suggested Problems
-
2703 Solvers
-
Calculate the Levenshtein distance between two strings
1412 Solvers
-
279 Solvers
-
Matrix with different incremental runs
487 Solvers
-
Check that number is whole number
4161 Solvers
More from this Author55
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!