Question

Find the HCF of and 234 6294 by Using
Euclids division algorithm.​

Answer 1

Answer:

Highest common factor (HCF) of 297, 6295 is 1.

Step-by-step explanation:

Highest Common Factor of 297,6295 using Euclid's algorithm

Step 1: Since 6295 > 297, we apply the division lemma to 6295 and 297, to get

6295 = 297 x 21 + 58

Step 2: Since the reminder 297 ≠ 0, we apply division lemma to 58 and 297, to get

297 = 58 x 5 + 7

Step 3: We consider the new divisor 58 and the new remainder 7, and apply the division lemma to get

58 = 7 x 8 + 2

We consider the new divisor 7 and the new remainder 2,and apply the division lemma to get

7 = 2 x 3 + 1

We consider the new divisor 2 and the new remainder 1,and apply the division lemma to get

2 = 1 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 297 and 6295 is 1

Notice that 1 = HCF(2,1) = HCF(7,2) = HCF(58,7) = HCF(297,58) = HCF(6295,297)

Hope it will help you

Make me brain list

Answer 2

Answer:

hclgjgudlkfyfpdififgyuvipstifrf dotsjcfgvhznhtyyhfygidjj do hi su gof