Experts are full of valuable knowledge and are ready to help with any question. Credentials confirmed by a Fortune 500 verification firm.

Get a Professional Answer

Via email, text message, or notification as you wait on our site. Ask follow up questions if you need to.

100% Satisfaction Guarantee

Rate the answer you receive.

Ask ATLPROG Your Own Question

ATLPROG, Computer Software Engineer

Category: Programming

Satisfied Customers: 7677

Experience: MS in IT.Several years of programming experience in Java C++ C C# Python VB Javascript HTML

44910485

Type Your Programming Question Here...

ATLPROG is online now

2 different parts. Please separate into 2 projects. Need by

Customer Question

2 different parts. Please separate into 2 projects. Need by Monday. C# 1. Create a method called GreatestCommonDivisor that used Euclids algorithm as defined in this video https://www.youtube.com/watch?v=fwuj4yzoX1o - do not search out c# ***** 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