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
-
990 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
594 Solvers
-
1263 Solvers
-
Sum of odd numbers in a matrix
550 Solvers
-
Find two triangular numbers whose sum is input.
91 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!