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
-
14051 Solvers
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15773 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2033 Solvers
-
Remove entire row and column in the matrix containing the input values
547 Solvers
-
11253 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!