Question

Find HCF of 134791,6341and6339 by Euclid's algorithm

Answer 1

Answer:

HCF-1

Step-by-step explanation:

We know that,

a = bq + r, where 0 ≤ r <b.

According to the question apply the division lemma to 6339 & 6341.

➡ 6341 = 6339 * 1 + 2

➡6339 = 2 * 3169 + 1

➡ 2 = 2 * 1 + 0

➡ The remainder is zero.

➡ so HCF ( 6341, 6339 ) = 1

Now, we have to find the HCF of 1 & 134791.

➡ 134791 = 1 * 134791 + 0

➡ Now, HCF ( 1, 134791 ) = 1

Therefore HCF ( 6339, 6341, 134791 ) = 1

Answer 2

Answer:

sorry I didn't know

Step-by-step explanation:

better you search in calculator or Google can you pls mark me as brainliest ..

i know you are thinking answer to di nahi h aur brainliest mark karne bol rahi h par plz mark me brainliest