java
posted by tj on .
Write a program that will find the lowest common denominator of two numbers. The user will enter the two denominators, the program will output both the lowest common denominator and the multipliers required for each fraction. For example, if the user is trying to add 1/3 and 1/4, the input would be 3 and 4, the output should be: The lowest common denominator is 12, multiple 1/3 by 4/4 and 1/4 by 3/3 to convert the fractions.

The LCM algorithm most suited for computer computations is Euclid's division algorithm, although we have all learned the factoring approach in school.
Which one is more familiar to you?