Advertisements
Advertisements
प्रश्न
Using Euclid’s algorithm, find the HCF of 405 and 2520 .
उत्तर
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
संबंधित प्रश्न
Prove that the square of any positive integer is of the form 4q or 4q + 1 for some integer q.
Define HOE of two positive integers and find the HCF of the following pair of numbers:
105 and 120
Using prime factorization, find the HCF and LCM of 36, 84 In case verify that HCF × LCM = product of given numbers.
Using prime factorization, find the HCF and LCM of 30, 72, 432 .
Find the missing numbers in the following factorization:
Is it possible to have two numbers whose HCF if 25 and LCM is 520?
The sum of two irrational number is an irrational number (True/False).
Show that the square of any positive integer is either of the form 4q or 4q + 1 for some integer q.
For any positive integer n, prove that n3 – n is divisible by 6.
Show that one and only one out of n, n + 4, n + 8, n + 12 and n + 16 is divisible by 5, where n is any positive integer.
[Hint: Any positive integer can be written in the form 5q, 5q + 1, 5q + 2, 5q + 3, 5q + 4].
