The LCM of two integers n1 and n2 is the smallest positive integer that is perfectly divisible by both n1 and n2 (without a remainder)
C# Code:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
class Program { static void Main(string[] args) { int n1 , n2 , lcm; Console.Write("Enter firstNumber:"); n1 = Convert.ToInt32(Console.ReadLine()); Console.Write("Enter firstNumber:"); n2 = Convert.ToInt32(Console.ReadLine()); // maximum number between n1 and n2 is stored in lcm lcm = (n1 > n2) ? n1 : n2; // Always true while (true) { if (lcm % n1 == 0 && lcm % n2 == 0) { Console.WriteLine("The LCM of {0} and {1} is {2}", n1, n2, lcm); break; } ++lcm; } Console.ReadKey(); } } |
Output:
