Advertisements
Advertisements
प्रश्न
Using Euclid’s algorithm, find the HCF of 504 and 1188 .
उत्तर
On applying Euclid’s algorithm, i.e. dividing 1188 by 504, we get:
Quotient = 2, Remainder = 180
∴ 1188 = 504 × 2 + 180
Again on applying Euclid’s algorithm, i.e. dividing 504 by 180, we get:
Quotient = 2, Remainder = 144
∴ 504 = 180 × 2 + 144
Again on applying Euclid’s algorithm, i.e. dividing 180 by 144, we get:
Quotient = 1, Remainder = 36
∴ 180 = 144 × 1 + 36
Again on applying Euclid’s algorithm, i.e. dividing 144 by 36, we get:
∴ 144 = 36 × 4 + 0
Hence, the HCF of 1188 and 504 is 36.
APPEARS IN
संबंधित प्रश्न
Use Euclid's Division Algorithm to show that the cube of any positive integer is either of the 9m, 9m + 1 or 9m + 8 for some integer m
Prove that the product of two consecutive positive integers is divisible by 2.
Find the simplest form of `473/645` .
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i) `11/(2^3× 3)`
If a and b are two prime numbers then find the HCF(a, b)
Prove that following numbers are irrationals:
The remainder when the square of any prime number greater than 3 is divided by 6, is
Prove that square of any integer leaves the remainder either 0 or 1 when divided by 4
HCF of 8, 9, 25 is ______.
Prove that if x and y are both odd positive integers, then x2 + y2 is even but not divisible by 4.
