# A+ Work

C# 1. Create a method called GreatestCommonDivisor that used Euclids algorithm as defined in this videohttps://www.youtube.com/watch?v=fwuj4yzoX1o – do not search out c# versions of the algorithm, everything you need is explained in the video and there should be no need for any additional ‘research’. Your method signature should look like this int GreatestCommonDivisor(int a, int b) Create a test program that demonstrates the following GreatestCommonDivisor(164, 410) = 82 GreatestCommonDivisor(87801, 1469) = 113
2. Create a fractions class that represents fractions in the form a/b Your class should implement the following members int Numerator int Denominator Fraction(int numerator, int denominator) – creates a new Fraction double ToDecimal() – returns the fraction as a double Fraction Add(Fraction f) – adds the fraction to the one passed in and simplifies the result Fraction Multiply(Fraction f) – multiplies the faction by the one passed in and simplifies the result Fraction Simplify() – simplifies the fraction using the GreatestCommonDivisor method from the first Exercise Create a test program that demonstrates the following 1/2 = 0.5 1/7 + 1/5 = 12/35 1/4 * 2/3 * 4/5 = 2/15