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
-
Find the longest sequence of 1's in a binary sequence.
6129 Solvers
-
Which values occur exactly three times?
5060 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2248 Solvers
-
461 Solvers
-
4920 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!