WebMar 22, 2024 · Since 12576 > 4052, We divide 12576 by 4052 Since remainder is not 0 We divide 4052 by 420 Since remainder is not zero 0 We divide 420 by 272 Since remainder is not zero 0 We divide 272 by 148 Since remainder is not zero We divide 148 by 124 Since remainder is not zero We divide 124 by 24 Since remainder is not zero We divide 24 by 4 … WebMay 20, 2024 · Step 1: Since 12576 > 4052, apply the division lemma to 12576 and 4052, to get 12576 = 4052 × 3 + 420 Step 2: Since the remainder 420 ≠ 0, apply the division lemma to 4052 and 420, to get 4052 = 420 × 9 + 272 Step 3: Consider the new divisor 420 and the new remainder 272, and apply the division lemma to get 420 = 272 × 1 + 148
Find the HCF of 12576 and 4052 Maths Questions - Toppr
WebHere, 4052 12576. Applying Euclid's division algorithm, we get. 12576 = 4052 × 3 + 420 ….. r ≠ 0. 4052 = 420 × 9 + 272 ….. r ≠ 0. ... Therefore, HCF of 650 and 1170 is 130. Hence, the largest number which divides 650 and 1170 is 130. Solution 6. We know that, Smallest prime number = 2. WebMar 22, 2024 · Transcript. Example 1 Use Euclid’s algorithm to find the HCF of 4052 and 12576. Since 12576 > 4052, We divide 12576 by 4052 Since remainder is not 0 We divide 4052 by 420 Since remainder is not zero 0 We divide 420 by 272 Since remainder is not zero 0 We divide 272 by 148 Since remainder is not zero We divide 148 by 124 Since … mario gomez stuttgart
R NUMBERS - cdn1.byjus.com
WebJul 11, 2024 · Use Euclid's algorithm to find the HCF of 4052 and 12576. Step 1: Since 12576 > 4052, apply the division lemma to 12576 and 4052, to get. Step 2: Since the remainder 420 ≠ 0, apply the division lemma to 4052 and 420, to get. Step 3: Consider the new divisor 420 and the new remainder 272, and apply the division lemma to get. WebJan 29, 2024 · Use Euclid's division algorithm to find the HCF of: (i) 960 and 432 (ii) 4052 and 12576. real numbers class-10 1 Answer +1 vote answered Jan 29, 2024 by Md samim (96.0k points) selected Mar 4, 2024 by faiz Best answer The correct answer is ← Prev Question Next Question → Find MCQs & Mock Test Free JEE Main Mock Test … WebUse Euclid's algorithm to find the HCF of 4052 and 12576. - YouTube NCERT Example Page no. 5 REAL NUMBERSExample 1:- Use Euclid's algorithm to find the HCF of 4052 … mario gonzalez facebook