Question

Define Euclid's Division Algorithm :–
.
.
.

Thankyou...

Dhanyawad

Shukriya...

Aur kuch reh gya ?? Umm bhot bhot abhar...

btw exams hue ?​

Answer 1

Answer:

Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b. To understand Euclid's Division Algorithm we first need to understand Euclid's Division Lemma.

Answer 2

Step-by-step explanation:

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. Let's learn more about it in this lesson.

hope it's helpful please mark me as brainliest!!!

plz follow me