Advertisements
Advertisements
प्रश्न
Use Euclid's division algorithm to find the HCF of 255 and 867.
उत्तर
The given numbers are 255 and 867.
Now 867 > 255. So, on applying Euclid's algorithm we get
867=255×3+102">867 = 255 × 3 + 102
Now the remainder is not 0 so, we repeat the process again on 255 and 102
255=102×2+51">255 = 102 × 2 + 51
The algorithm is applied again but this time on the numbers 102 and 51
102=51×2+0">102 = 51 × 2 + 0
Thus, the HCF obtained is 51.
संबंधित प्रश्न
Using Euclid's division algorithm, find the H.C.F. of (iii) 867 and 255
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.
Find the greatest number which divides 2011 and 2623 leaving remainders 9 and 5 respectively.
Using prime factorization, find the HCF and LCM of 1152, 1664 In case verify that HCF × LCM = product of given numbers.
Six bells commence tolling together and toll at intervals of 2, 4, 6, 8, 10, 12 minutes respectively. In 30 hours, how many times do they toll together?
Show that \[5 - 2\sqrt{3}\] is an irrational number.
If HCF (26, 169) = 13, then LCM (26, 169) =
If p and q are co-prime numbers, then p2 and q2 are
The LCM and HCF of two rational numbers are equal, then the numbers must be
Using Euclid’s division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively.
