Question

Use euclid division algorithm to find h .C.F of 870 and 225

Answer 1

Hey mate
_____________________

BY USING EUCLID DIVISION ALGORITHM

▶870=225×2+195
▶225=195×1+30
▶195=30×6+15
▶30=15×2+0

HCF =15

________________________


HOPE IT HELP U ✌✌

Answer 2

Answer:

HCF of 870 and 225 is 15

Step-by-step explanation:

Euclid's Division Algorithm:

Let a and b be any two positive integers.

Then there exist two unique whole numbers q and r such that

a = bq+r , 0≤r<b

Here , a is called the dividend , b is called the divisor , q is called the quotient and r is called remainder.

Start with larger integer , that is 870.

Apply the division lemma to 870 and 225 ,to get

870 = 225×3+195

Since, the remainder is not equal to zero , we apply the division lemma to 225 and 195 to get

225 = 195 × 1 + 30

Apply again,

195 = 30 × 6 + 15

30 = 15 ×2 + 0

The remainder has now become zero, so our procedure stops .

Since the divisor at this stage is 15,the HCF of 870 and 225 is 15