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
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1984 Solvers
-
387 Solvers
-
Split a string into chunks of specified length
2043 Solvers
-
Integer Sequence - II : New Fibonacci
675 Solvers
-
Easy Sequences 1: Find the index of an element
50 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!