Greatest Common Divisor and Least Common Denaminator Solver Version 1.0

Hello everyone this is my new code in Java that I called it Greatest Common Divisor and Least Common Denominator Solver Version 1. The code is quiet complex because it deals with pure mathematical computation but it is easy to adapt one you understand the flow of the program.

In mathematics, the greatest common divisor (gcd), sometimes known as the greatest common factor (gcf) or highest common factor (hcf), of two non-zero integers, is the largest positive integer that divides both numbers without remainder.

In plain language: in the problem 3 x 4 = 12, 3 and 4 are factors and 12 is the product or multiple. A common factor is a number which is a factor of two different problems; thus, in 1 x 4 the factors are 1, 2 and 4 (1 x 4 = 4; 2 x 2 = 4) and in 1 x 6 the factors are 1, 2, 3 and 6 (1 x 6 = 6; 2 x 3 = 6}; therefore the common factors of the two problems are 1 and 2, with 2 being the highest common factor.

 On the other hand the lowest common denominator or least common denominator (abbreviated LCD) is the least common multiple of the denominators of a set of vulgar fractions. It is the smallest positive integer that is a multiple of the denominators.

If you find this code useful send me an email at [email protected]. People here in the Philippines who wish to contact me they can reach me at my mobile number 09296768375. Thank you very much and Happy Programming.

Regards,

Mr. Jake Rodriguez Pomperada, MAED - Instructional Technology