Advertisements
Advertisements
Question
Find the H.C.F. of 252525 and 363636
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
Consider the number 6n where n is a natural number. Check whether there is any value of n ∈ N for which 6n is divisible by 7.
Explain why 7 × 11 × 13 + 13 and 7 × 6 × 5 × 4 × 3 × 2 × 1 + 5 are composite numbers.
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 prime factorization of a natural number n is 23 ✕ 32 ✕ 52 ✕ 7, write the number of consecutive zeros in n.
Find the LCM and HCF of the following integers by applying the prime factorisation method.
17, 23 and 29
The product of two consecutive natural numbers is always ______.
If LCM(x, 18) = 36 and HCF(x, 18) = 2, then x is ______.
The LCM of smallest 2-digit number and smallest composite number is ______.
The prime factorisation of the number 2304 is ______.
The HCF of the smallest 2-digit number and the smallest composite number is ______.
