Advertisements
Advertisements
Question
Using Euclid’s algorithm, find the HCF of 405 and 2520 .
Solution
On applying Euclid’s algorithm, i.e. dividing 2520 by 405, we get:
Quotient = 6, Remainder = 90
∴ 2520 = 405 × 6 + 90
Again on applying Euclid’s algorithm, i.e. dividing 405 by 90, we get:
Quotient = 4, Remainder = 45
∴ 405 = 90 × 4 + 45
Again on applying Euclid’s algorithm, i.e. dividing 90 by 45, we get:
∴ 90 = 45 × 2 + 0
Hence, the HCF of 2520 and 405 is 45.
APPEARS IN
RELATED QUESTIONS
Define HOE of two positive integers and find the HCF of the following pair of numbers:
100 and 190
Find the HCF of the following pairs of integers and express it as a linear combination of 1288 and 575.
Find the maximum number of students among whom 1001 pens and 910 pencils can be distributed in such a way that each student gets the same number of pens and the same number of pencils.
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `171/800`
Find the least number that is divisible by all the numbers between 1 and 10 (both inclusive).
HCF of two numbers is always a factor of their LCM (True/False).
π is an irrational number (True/False).
A positive integer, when divided by 88, gives the remainder 61. What will be the remainder when the same number is divided by 11?
If HCF (16, y) = 8 and LCM (16, y) = 48, then the value of y is ______.
Prove that one and only one out of n, n + 2 and n + 4 is divisible by 3, where n is any positive integer.
