Implement Euclid\'s Algorithm to solve the multiplicative inverse for a given in

Question

Implement Euclid's Algorithm to solve the multiplicative inverse for a given integer x and a modulo n. Submit source code and output screen capture.

Explanation / Answer

class Program { static void Main(string[] args) { long reminder = -1; Console.Write("Please Enter the First Number: "); long firstNumber = Int32.Parse(Console.ReadLine()); Console.Write(" Please Enter the Second Number: "); long secondNumber = Int32.Parse(Console.ReadLine()); if (firstNumber > secondNumber) { firstNumber = firstNumber + secondNumber; secondNumber = firstNumber - secondNumber; firstNumber = firstNumber - secondNumber; } while (reminder != 0) { reminder = DividingEngine(ref firstNumber, ref secondNumber); } Console.Write(" GCD is: " + firstNumber); Console.ReadLine(); } private static long DividingEngine(ref long divisor, ref long divident) { long reminder = divident % divisor; if (reminder != 0) { divident = divisor; divisor = reminder; } return reminder; } }

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.