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 Solvers13
Suggested Problems
- 
         The Goldbach Conjecture, Part 2 2386 Solvers 
- 
         
         4449 Solvers 
- 
         
         23137 Solvers 
- 
         
         116 Solvers 
- 
         
         628 Solvers 
More from this Author59
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!