Math, asked by ppetaramu, 16 days ago

use eucludingdivision algorithm to find the HCF of 81 and 237

Answers

Answered by deekshastudynets

Answer:

To find the HCF of 81 and 237, we will find the prime factorization of the given numbers, i.e. 81 = 3 × 3 × 3 × 3; 237 = 3 × 79. ⇒ Since 3 is the only common prime factor of 81 and 237. Hence, HCF (81, 237) = 3.

Step-by-step explanation:

Previous Question

Next Question

Similar questions

Science, 8 days ago

how can you identify contaminated food?

Math, 8 days ago

13. The money that we borrow is known as (a) Interest(b) Amount(c) Principal(d) None of these...

Physics, 8 days ago

A gas kept in a flask expands to fill the entire room when cork is removed but the reverse process never happens why?

Social Sciences, 16 days ago

English, 16 days ago

essay writing an electronic device you find most useful 350 words...

Computer Science, 9 months ago

b. Explain different input controls of a Form.

Geography, 9 months ago

give me only right answer answer not your comments okay please and fast fast fast fast fast fast fast fast fast fast fast fast please please ...

English, 9 months ago

which of these are free ended questions. a) where dod you live? b)are you hungry? c)how do you feel? d) did you meet him?

use eucludingdivision algorithm to find the HCF of 81 and 237​

Answers

use eucludingdivision algorithm to find the HCF of 81 and 237