FINDING THE HCF OF TWO POSITIVE INTEGERS BY EUCLID'S DIVISION ALGO REAL NUMBERS 01 Class 10th Mathematics (Practice Sheet) 1 What is the HCF of 462 and 693 using Euclid's Division Algorithm? A. 99 B. 33 C. 11 D. 3 2 Find the HCF of 180 and 240 by prime factorization. A. 12 B. 15 C. 30 D. 60 3 In Euclid's Division Algorithm, what is the significance of the remainder becoming 0? A. It indicates that the divisor is its HCF B. It indicates that the numbers have no common factors. C. It means the numbers are prime. D. It signifies that the numbers are coprime. 4 Calculate the HCF of 36 and 48 using the division method. A. 4 B. 6 C. 12 D. 18 5 What is the HCF of 150 and 210 by prime factorization? A. 10 B. 20 C. 30 D. 50 6 Using Euclid’s Algorithm, find the HCF of 2048 and 960. 7 Using Euclid’s division algorithm, find HCF of 56, 96 and 404. 8 If ‘h’ is HCF of 609 and 957. Find x and y satisfying h = 609x + 957y. Also show that x and y are not unique. 9 Calculate the HCF of 225 and 315 by prime factorization. 10 If two positive integers x and y are expressible in terms of primes as x = p2q 3 and y = p3q, what can you say about their LCM and HCF. Is LCM a multiple of HCF? Page 1 Email: Phone No: Website:
[email protected] +91 93299 65211 www.brisklearning.com Address: Office No. 605, CTS No. 658, Gayatri Bhuvan, A & B, Kandivali, Dattani Park, Thakur Village, Kandivali East, Mumbai, Maharashtra 400101
English