Math, asked by rupadhulipala24, 6 hours ago

find hcf of 6341 and 6339 by Euclid division algorithm
​

Answers

Answered by shilpiguptacsit
0

Step-by-step explanation:

Highest Common Factor of 134791,6341,6339 using Euclid's algorithm. Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(8,3) = HCF(19,8) = HCF(179,19) = HCF(1451,179) = HCF(1630,1451) = HCF(6341,1630) = HCF(134791,6341) .

Previous Question
Next Question
Similar questions
Business Studies, 3 hours ago
Which is the third step in the process of organisation? ​
English, 3 hours ago
you are not attend___the class regularly​...
Chemistry, 3 hours ago
Can you separate the elements of the 2 mixtures using the same process? Why?​
Math, 6 hours ago
Find four solutions of the equation 2x – 3y = 12​...
Science, 6 hours ago
2. A forest has recorded a decrease in different types of birds after a forest fire. A. What could be a reason for the decrease in the types of birds in the forest?​
Math, 8 months ago
One-fifth of a number minus 4 gives 3. Find which of the following is the number. 1...
Social Sciences, 8 months ago
Which Indian commodities were in great demand in Euro countries​...
Math, 8 months ago
rationalised of denominator 1 / 5 - 2 root 3​...