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
-
Calculate the Levenshtein distance between two strings
1472 Solvers
-
2508 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1212 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
486 Solvers
-
176 Solvers
More from this Author57
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!