Math, asked by rahulpbh1998, 6 months ago

find out HCF of 101, 901, 1111​

Answers

Answered by ashwina9180vps
2

Answer:

1

Step-by-step explanation:

Answered by Asher57
0

Step 1: Since 901 > 101, we apply the division lemma to 901 and 101, to get

901 = 101 x 8 + 93

Step 2: Since the reminder 101 ≠ 0, we apply division lemma to 93 and 101, to get

101 = 93 x 1 + 8

Step 3: We consider the new divisor 93 and the new remainder 8, and apply the division lemma to get

93 = 8 x 11 + 5

We consider the new divisor 8 and the new remainder 5,and apply the division lemma to get

8 = 5 x 1 + 3

We consider the new divisor 5 and the new remainder 3,and apply the division lemma to get

5 = 3 x 1 + 2

We consider the new divisor 3 and the new remainder 2,and apply the division lemma to get

3 = 2 x 1 + 1

We consider the new divisor 2 and the new remainder 1,and apply the division lemma to get

2 = 1 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 101 and 901 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(8,5) = HCF(93,8) = HCF(101,93) = HCF(901,101) .

Step-by-step explanation:

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 1111 > 1, we apply the division lemma to 1111 and 1, to get

1111 = 1 x 1111 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 1111 is 1

Notice that 1 = HCF(1111,1) .

Similar questions