Use Euclid’s algorithm to find the HCF of 4052 and 12576.

Monjur Alahi

Use Euclid’s algorithm to find the HCF of 4052 and 12576.


0 like 0 dislike
1 views
Share with your friends

1 Answers

Salim Ahmed Kawsar

Call

Since 12576 > 4052, we apply the division lemma to 12576 and 4052, to get
12576 = 4052 × 3 + 420
Since the remainder 420 ≠ 0, we apply the division lemma to 4052 and 420, to get
4052 = 420 × 9 + 272
We consider the new divisor 420 and the new remainder 272, and apply the division lemma to get
420 = 272 × 1 + 148
We consider the new divisor 272 and the new remainder 148, and apply the division lemma to get
272 = 148 × 1 + 124
We consider the new divisor 148 and the new remainder 124, and apply the division lemma to get

148 = 124 × 1 + 24
We consider the new divisor 124 and the new remainder 24, and apply the division lemma to get
124 = 24 × 5 + 4
We consider the new divisor 24 and the new remainder 4, and apply the division lemma to get
24 = 4 × 6 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at

 this stage is 4, the HCF of 12576 and 4052 is 4.

0 like 0 dislike
1 views
Talk Doctor Online in Bissoy App
Find the LCM and HCF of the following pairs of integer and verify that LCM×HCF=Product of the two numbers.

Solution : i) 26 and 91 26=2×13×1(expressing as product of it’s prime factors) 91=7×13×1(expressing as product of it’s prime factors) So, LCM(26,91)=2×7×13×1=182 HCF(26,91)=13×1=13 Verification: LCM×HCF=13×182=2366 Product of 26 and 91 =2366 Therefore,LCM×HCF=Product of the two numbers . i) 510 and...

1 Answers 1 views
Find the LCM and HCF of the following integers by applying the prime factorization method. i) 12,15 and 21 ii) 17,23 and 29 iii) 8,9 and 25

Solution : i) 12,15 and 21 12=2×2×3 15=5×3 21=7×3 From the above ,HCF(12,15,21)=3and LCM(12,15,21)=420 ii)17,23,and 29 17=17×1 23=23×1 29=29×1 From the above ,HCF(17,23,29)=1and LCM(17,23,29)=11339 iii)8,9 and 25 8=2×2×2 9=3×3 25=5×5 From the above ,HCF(8,9,25)=1and LCM(8,9,25)=1800

1 Answers 1 views
Why is Axiom 5, in the list of Euclid’s axioms, considered a ‘universal truth’? (Note that the question is not about the fifth postulate.)

Axiom 5 : ‘Whole is always greater than its part.’  This is a ‘universal truth’ because part is included in the whole and therefore can never be greater than the whole...

1 Answers 4 views
How would you rewrite Euclid’s fifth postulate so that it would be easier to understand?

When two lines are cut by a third line, such that the sum of interior angles is less than 180° on one side then the first two lines intersect on...

1 Answers 3 views
Use Euclid’s division algorithm to find HCF of 441, 567, 693.

Solution: By Euclid’s division algorithm, 693 = 567 x 1 + 126 567 = 126 x 4 + 63 126 = 63 x 2 + 0 So, HCF(441, 63) = 63 So, HCF (693, 567) =...

1 Answers 1 views
Using Euclid’s division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively.

Solution: Since, 1, 2 and 3 are the remainders of 1251, 9377 and 15628 respectively. So, 1251 – 1 = 1250 is exactly divisible by the required number, 9377 – 2 = 9375...

1 Answers 1 views
Euclid’s division lemma states that for two positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy

Correct answer is option (C) 0 ≤ r < b

1 Answers 1 views
The HCF of 65 and 117 is expressible in the form 65m - 117. Find the value of m. Also find the LCM of 65 and 117 using prime factorization method.

Solution: 117 = 65 x 1 + 52 65 = 52 x 1 + 13 65 = 13 x 5 + 0 => HCF(65, 117) = 13 Since, HCF(65, 117) = 65m - 117 => 13 = 65m - 117 => 65m...

1 Answers 1 views
Define HOE of two positive integers and find the HCF of the following pairs of numbers: (i) 32 and 54 (ii) 18 and 24 (iii) 70 and 30 (iv) 56 and 88

By applying Euclid’s division lemma (i) 54 = 32 × 1 + 22 Since remainder ≠ 0, apply division lemma on division of 32 and remainder 22. 32 = 22 × 1 +...

1 Answers 1 views
Using Euclid’s division algorithm, check whether 231, 396 are co-prime or not. Justify your answer.

396 = 1 × 231 + 165 231 = 1 × 165 + 66 165 = 2 × 66 + 33 66 = 2 × 33 + 0 ∴ The HCF of 231, 396...

1 Answers 2 views
X