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 Solvers14
Suggested Problems
-
184 Solvers
-
Project Euler: Problem 5, Smallest multiple
1646 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
252 Solvers
-
7949 Solvers
-
Number of Even Elements in Fibonacci Sequence
1632 Solvers
More from this Author61
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!