# C# Program to find GCD

You are Here:

## What is Greatest Common Divisor?

A largest number that exactly divides two or more integers.

In general, Greatest Common Divisor (GCD) is otherwise called as Greatest Common Factor (GCF) or Highest Common Factor (HCF)

Tips: It is recommended to use our online GCD calculator for better understanding.

## Examples

The following table provides few examples of GCD of the given numbers.

NumbersGCD
4, 102
6, 51
15, 30 , 4515

## GCD of Two Numbers

In the following example, we will find the GCD of the given two numbers (45, 90).

### Example

C# Compiler
using System; namespace myApp { class Program { static void Main(string[] args) { int num1 = 45; int num2 = 90; int gcd = 1; int i; for(i=2; i<=num1 && i<=num2; i++) { // Checks if i is factor of both integers if((num1 % i == 0) && (num2 % i == 0)) gcd = i; } Console.Write("GCD of {0} and {1}: {2}", num1, num2, gcd); } } }

## GCD of any Two Given Numbers

In the following example, we will find the GCD of any two given numbers.

### Example

C# Compiler
using System; namespace myApp { class Program { static void Main(string[] args) { int num1, num2, i; int gcd = 1; Console.Write("Enter (int) num1 = "); num1 = Convert.ToInt32(Console.ReadLine()); Console.Write("Enter (int) num2 = "); num2 = Convert.ToInt32(Console.ReadLine()); for(i=2; i<=num1 && i<=num2; i++) { // Checks if i is factor of both integers if((num1 % i == 0) && (num2 % i == 0)) gcd = i; } Console.Write("\nGCD of {0} and {1}: {2}", num1, num2, gcd); } } }

## Reminder

Hi Developers, we almost covered 90% of String functions and Interview Question on C# with examples for quick and easy learning.

We are working to cover every Single Concept in C#.