Using Euclid’s division algorithm, check whether 231, 396 are co-prime or not. Justify your answer.

0 votes
29 views
asked Mar 12, 2018 in Mathematics by Golu (37,045 points) 19 145 415

Using Euclid’s division algorithm, check whether 231, 396 are co-prime or not. Justify your answer.

1 Answer

0 votes
answered Mar 12, 2018 by faiz (82,347 points) 6 6 11
 
Best answer
396 = 1 × 231 + 165
231 = 1 × 165 + 66
165 = 2 × 66 + 33
66 = 2 × 33 + 0
∴ The HCF of 231, 396 is 33 not 1, so they are not co-prime.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

One Thought Forever

“There is a close connection between getting up in the world and getting up in the morning.“
– Anon
~~~*****~~~

...