Enter numerators and denominators two fractions. The program uses Euclid's algorithm. See my project LCMandGCD http://scratch.mit.edu/projects/2922284
The program adds and subtracts fractions. Inscription (n, d) is n - numerator, d - denominator. The program builds on the LCM and GCD in order to bring to a common denominator. LCM(d1,d2)=d1*d2/GCD(d1,d2) {See my project LCMandGCD http://scratch.mit.edu/projects/2922284 } Results appear: first add and you can see it 20 seconds, then I get the subtraction for the next 20 seconds.
