Math, asked by kingkhandas7, 1 year ago

Using euclid division algorithm find hcf of 81 and 237

Answers

Answered by bhoomikajoisa30
18

Answer:


Step-by-step explanation

Attachments:
Answered by hukam0685
3

HCF of 81 and 237 is 3.

Given:

  • 81 and 237.

To find:

  • Using euclid division algorithm find HCF.

Solution:

Concept to be used:

Apply Euclid's division algorithm;

a=bq+r, 0 ≤ r < b

Step 1:

Put the numbers according to division algorithm.

237 = 81 \times 2 + 75 \\

Step 2:

81 is new divisor and 75 is new dividend.

81 = 75 \times 1 + 6 \\

now repeat the same process, until remainder will be zero.

75 = 6 \times 12 + 3 \\

and

6 = 3 \times 2 + 0 \\

Step 3:

Find the HCF.

HCF is remainder of second last step.

Thus,

HCF(81,237)= 3

_______________________________

Learn more:

1) Using Euclid’s division algorithm find the HCF of 95634 and 15180

https://brainly.in/question/43109764

2) Find the lcm of 25 ,90 and 180 by long division method and answer should be 900

https://brainly.in/question/44031042

Similar questions