# For finding the greatest common divisor of two given integers. A method based on the division algorithm is used called ............

**A**

## Euclid's division algorithm

**B**

## Euclid's addition algorithm

**C**

## Euclid's subtraction algorithm

**D**

## Euclid's multiplication algorithm

Medium

Solution

Verified by GMS

Correct option is A)

**Euclid's division algorithm** is a way to find the HCF of two numbers by using **Euclid's division lemma**. It states that if there are any two integers $a$ and $b$, there exists $q$ and $r$ such that it satisfies the given condition $a=bq+r$ where $0≤r<b$..

Therefore, $A$ is the correct answer.

**Euclid's division algorithm**is a way to find the HCF of two numbers by using

**Euclid's division lemma**. It states that if there are any two integers $a$ and $b$, there exists $q$ and $r$ such that it satisfies the given condition $a=bq+r$ where $0≤r<b$..

Therefore, $A$ is the correct answer.