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
-
1222 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3012 Solvers
-
Split a string into chunks of specified length
1552 Solvers
-
99 Solvers
-
Return fibonacci sequence do not use loop and condition
519 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!