Math, asked by ranjana8832, 11 months ago

find the hcf of 252525 and 363636 using Euclid division algorithm​

Answers

Answered by khanmohammed419
8

Answer:

10101

Step-by-step explanation:

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.

Answered by srinivasan0400s
1

Step-by-step explanation:

d your day going so far away from you in my life

Similar questions