Introduction - If you have any usage issues, please Google them yourself
A small program based on Euclid .
1. Determine an integer is not a prime number
2 Calculate the greatest common divisor of two integers
3 Calculate the least common multiple of two integers
4 input a, b ,output in the form of s* a+ t* b = gcd (a, b)
5. Seeking input a, m in a mold of inverse m