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
संबंधित प्रश्न
Express the number as a product of its prime factor:
140
Determine the prime factorisation of each of the following positive integer:
20570
Find the LCM and HCF of the following integers by applying the prime factorisation method:
84, 90 and 120
If the product of two numbers is 1080 and their HCF is 30, find their LCM.
Express the number as a product of its prime factor:
5005
Find the greatest number consisting of 6 digits which is exactly divisible by 24, 15, 36?
Express 98 as a product of its primes.
If two positive integers A and B can be expressed as A = xy3 and B = x4y2z; x, y being prime numbers then HCF (A, B) is ______.
The largest number which divides 70 and 125, leaving remainders 5 and 8, respectively, is ______.
The prime factorisation of the number 2304 is ______.
