Round #560

What is the greatest common divisor of 36 and 48?

To find the greatest common divisor (GCD) of 36 and 48, we can list the factors of each number: Factors of 36: 1, 2, 3, 4, 6, 9, 12, 18, 36 Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48 The common factors of 36 and 48 are: 1, 2, 3, 4, 6, 12 The greatest common factor among these is 12. Therefore, the greatest common divisor (GCD) of 36 and 48 is 12. Alternatively, you can use the Euclidean algorithm to find the GCD: 48 = 36 * 1 + 12 36 = 12 * 3 + 0 Since the remainder is 0, the GCD is the last non-zero remainder, which is 12. Here is a simple C# code snippet to calculate the GCD using the Euclidean algorithm: ```csharp using System; public class Program { public static void Main() { Console.WriteLine(GCD(36, 48)); // Output: 12 } public static int GCD(int a, int b) { while (b != 0) { int temp = b; b = a % b; a = temp; } return a; } } ``` This code defines a method `GCD` that takes two integers as input and returns their greatest common divisor. The `Main` method demonstrates how to use this function to calculate the GCD of 36 and 48.

```csharp using System; public class Program { public static int Gcd(int a, int b) { while (b != 0) { int temp = b; b = a % b; a = temp; } return a; } public static void Main() { Console.WriteLine(Gcd(36, 48)); } } ```