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 each of the following positive integer:
45470971
Write down the decimal expansions of the following rational numbers by writing their denominators in the form 2m × 5n, where, m, n are non-negative integers.\[\frac{129}{2^2 \times 5^7}\]
Express the number as a product of its prime factor:
3825
Express the number as a product of its prime factor:
7429
If m, n are natural numbers, for what values of m, does 2n × 5m ends in 5?
If 13824 = 2a × 3b then find a and b
Find the least positive value of x such that 89 ≡ (x + 3) (mod 4)
On a morning walk, three persons step off together and their steps measure 40 cm, 42 cm and 45 cm, respectively. What is the minimum distance each should walk so that each can cover the same distance in complete steps?
The HCF of the smallest 2-digit number and the smallest composite number is ______.
The prime factorisation of the number 5488 is ______.
