Advertisements
Advertisements
Question
Find the H.C.F. of 252525 and 363636
Advertisements
Solution
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
RELATED QUESTIONS
What is the HCF of the smallest prime number and the smallest composite number?
State fundamental theorem of arithmetic?
Determine the prime factorisation of each of the following positive integer:
58500
Express the number as a product of its prime factor:
7429
Find the L.C.M. and H.C.F. of 408 and 170 by applying the fundamental theorem of Arithmetic
Express 98 as a product of its primes.
Three farmers have 490 kg, 588 kg and 882 kg of wheat respectively. Find the maximum capacity of a bag so that the wheat can be packed in exact number of bags.
If LCM(x, 18) = 36 and HCF(x, 18) = 2, then x is ______.
If the HCF of 65 and 117 is expressible in the form 65m – 117, then the value of m is ______.
The HCF of two numbers 65 and 104 is 13. If LCM of 65 and 104 is 40x, then the value of x is ______.
