I want to simplify a fraction in my application. The fraction is like, x/y where x and y are integers. I want to simplify the fraction to its simplest form. Can anyone plea
Euclid's algorithm is an easy way to compute the GCD.