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
-
Return the 3n+1 sequence for n
8128 Solvers
-
17487 Solvers
-
3199 Solvers
-
Getting the indices from a matrix
625 Solvers
-
Factorions: Numbers that equal the sum of the factorials of their digits
67 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!