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.
संबंधित प्रश्न
Show that one and only one out of n; n + 2 or n + 4 is divisible by 3, where n is any positive integer.
Find the largest number which exactly divides 280 and 1245 leaving remainders 4 and 3, respectively.
Using Euclid’s algorithm, find the HCF of 405 and 2520 .
Using prime factorization, find the HCF and LCM of 144, 198 In case verify that HCF × LCM = product of given numbers.
Find the greatest number of 6 digits exactly divisible by 24, 15 and 36.
Prove that following numbers are irrationals:
The exponent of 2 in the prime factorisation of 144, is
Write whether every positive integer can be of the form 4q + 2, where q is an integer. Justify your answer.
Show that the square of any odd integer is of the form 4q + 1, for some integer q.
Assertion: If the HCF of 510 and 92 is 2, then the LCM of 510 and 92 is 32460.
Reason: As HCF (a, b) × LCM (a, b) = a × b
