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
संबंधित प्रश्न
Write the sum of the exponents of prime factors in the prime factorization of 98.
Express the number as a product of its prime factor:
156
Express the number as a product of its prime factor:
5005
For some integer q, every odd integer is of the form ______.
n2 – 1 is divisible by 8, if n is ______.
If the HCF of 65 and 117 is expressible in the form 65m – 117, then the value of m is ______.
Find the HCF and LCM of 72 and 120.
If HCF (72, 120) = 24, then LCM (72, 120) is ______.
If n is a natural number, then 8n cannot end with digit
If two positive integers a and b are written as a = x3y2 and b = xy3, where x, y are prime numbers, then the result obtained by dividing the product of the positive integers by the LCM (a, b) is ______.
