Question

find the HCF of numbers 134791, 6341 , 6339 by euclid's division algorithm

Answer 1

Hi ,

*********************************************************

Euclid's division lemma:

Let the a and b be any two pisitive integers . Then

there exists two unique whole numbers q and r such that

a = bq + r , 0 less or equal to r < b

Here , a is called the dividend , b is called the divisor ,

q is called the quotient and r is called the remainder.

******************************************************************************

According to the problem given ,

Start with 6341 , 6339

Appply the division lemma

6341 = 6339 × 1 + 2

Since the remainder not equal to zero,

Apply lemma again

6339 = 2 × 3169 + 1

2 = 1 × 2 + 0

The remainder has now become zero.

HCF ( 6341 , 6339 ) = 1

Now we have to find HCF of 1 and 134791

134791 = 1 × 134791 + 0

HCF ( 1, 134791 ) = 1

Therefore ,

HCF ( 134791 , 6341 , 6339 ) = 1

I hope this will help you.

*****

Answer 2

Answer:

Step-by-step explanation:

According to the problem given ,

Start with 6341 , 6339

Appply the division lemma

6341 = 6339 × 1 + 2

Since the remainder not equal to zero,

Apply lemma again

6339 = 2 × 3169 + 1

2 = 1 × 2 + 0

The remainder has now become zero.

HCF ( 6341 , 6339 ) = 1

Now we have to find HCF of 1 and 134791

134791 = 1 × 134791 + 0

HCF ( 1, 134791 ) = 1

Therefore ,

HCF ( 134791 , 6341 , 6339 ) = 1