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 Solvers14
Suggested Problems
-
Return a list sorted by number of occurrences
2888 Solvers
-
1468 Solvers
-
Back to basics 23 - Triangular matrix
1109 Solvers
-
Matrix multiplication across rows
388 Solvers
-
Number of Even Elements in Fibonacci Sequence
1628 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!