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
संबंधित प्रश्न
Determine the prime factorisation of the following positive integer:
45470971
Express the number as a product of its prime factor:
7429
Find the LCM and HCF of the following integers by applying the prime factorisation method.
17, 23 and 29
Find the L.C.M. and H.C.F. of 408 and 170 by applying the fundamental theorem of Arithmetic
Find the least number that is divisible by the first ten natural numbers
Find the least positive value of x such that 89 ≡ (x + 3) (mod 4)
When a number is divided by 7, its remainder is always ______.
For some integer q, every odd integer is of the form ______.
Let a and b be two positive integers such that a = p3q4 and b = p2q3, where p and q are prime numbers. If HCF (a, b) = pmqn and LCM (a, b) = prqs, then (m + n)(r + s) = ______.
The prime factorisation of the number 2304 is ______.
