Return to tool library 
模乘逆元计算器
finds the greatest common divisor, Bézout coefficient, and modular inverse when they exist.
YOUR NEXT DISCOVERY STARTS HERE
A question, a new exploration.
sample parameters are ready. Run directly, or load your own data.
is an exact integer; the modular inverse only exists when the two numbers are relatively prime.