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
संबंधित प्रश्न
Show that every positive integer is of the form 2q and that every positive odd integer is of the from 2q + 1, where q is some integer.
Prove that if a positive integer is of the form 6q + 5, then it is of the form 3q + 2 for some integer q, but not conversely.
Using Euclid’s algorithm, find the HCF of 960 and 1575 .
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i) `11/(2^3× 3)`
Every even integer is of the form 2m, where m is an integer (True/False).
Every odd integer is of the form 2m − 1, where m is an integer (True/False).
In Q.No. 7, HCF (a, b) is
If two positive integers m and n are expressible in the form m = pq3 and n = p3q2, where p, q are prime numbers, then HCF (m, n) =
If HCF of 65 and 117 is expressible in the form 65n − 117, then find the value of n.
If n is an odd integer, then show that n2 – 1 is divisible by 8.
