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
-
13556 Solvers
-
Which values occur exactly three times?
5139 Solvers
-
231 Solvers
-
Combinations without using nchoosek
128 Solvers
-
Sum the elements in either diagonal of a square matrix
213 Solvers
More from this Author56
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!