(71B) Euclid Division and Fraction Addition/Multiplication - Printable Version +- HP Forums (https://www.hpmuseum.org/forum) +-- Forum: HP Software Libraries (/forum-10.html) +--- Forum: General Software Library (/forum-13.html) +--- Thread: (71B) Euclid Division and Fraction Addition/Multiplication (/thread-6484.html) |
(71B) Euclid Division and Fraction Addition/Multiplication - Eddie W. Shore - 07-01-2016 02:04 AM Euclid Division – Finding the GCD Finds the GCD (greatest common divisors) between integers M and N. The program displays a “calculating” screen while the calculation is in process. Code: Program EUCLID (143 bytes) Test 1: M=144, N=14; Result: 2 Test 2: N=14, M=144; Result: 2 Fraction Addition and Multiplication Adds or multiplies two fractions W/X and Y/Z. Gives the result in the simplest form. Proper or improper fractions only. Separate each part with a comma (W,X,Y,Z) as prompted. Code: Program FRAC (380 bytes) Test 1: 4/7 + 3/13; Input: 4,7,3,13. Result: 73/91 Test 2: 4/7 * 3/13; Input: 4,7,3,13. Result: 12/91 |