Advertisements
Advertisements
प्रश्न
Find the H.C.F. of 252525 and 363636
Advertisements
उत्तर
To find the H.C.F. of 252525 and 363636
Using Euclid’s Division algorithm
363636 = 252525 × 1 + 111111
The remainder 111111 ≠ 0.
∴ Again by division algorithm
252525 = 111111 × 2 + 30303
The remainder 30303 ≠ 0.
∴ Again by division algorithm.
111111 = 30303 × 3 + 20202
The remainder 20202 ≠ 0.
∴ Again by division algorithm
30303 = 20202 × 1 + 10101
The remainder 10101 ≠ 0.
∴ Again using division algorithm
20202 = 10101 × 2 + 0
The remainder is 0.
∴ 10101 is the H.C.F. of 363636 and 252525.
APPEARS IN
संबंधित प्रश्न
There is a circular path around a sports field. Sonia takes 18 minutes to drive one round of the field, while Ravi takes 12 minutes for the same. Suppose they both start at the same point and at the same time, and go in the same direction. After how many minutes will they meet again at the starting point?
If the product of two numbers is 1080 and their HCF is 30, find their LCM.
Find the LCM and HCF of the following integers by applying the prime factorisation method.
17, 23 and 29
Express 98 as a product of its primes.
If two positive integers A and B can be expressed as A = xy3 and B = xiy2z; x, y being prime numbers, the LCM (A, B) is ______.
The product of two consecutive natural numbers is always ______.
n2 – 1 is divisible by 8, if n is ______.
The LCM of smallest 2-digit number and smallest composite number is ______.
If HCF (72, 120) = 24, then LCM (72, 120) is ______.
Three bells toll at intervals of 9, 12 and 15 minutes respectively. If they start tolling together, after what time will they next toll together?
