- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Use Euclid's division algorithm to find the HCF of:
184, 230 and 276
Given: 184, 230 and 276.
To find: Here we have to find the HCF of the given numbers.
Solution:
First, let's find HCF of 184 and 230 using Euclid's division algorithm:
Using Euclid’s lemma to get:
- $230\ =\ 184\ \times\ 1\ +\ 46$
Now, consider the divisor 184 and the remainder 46, and apply the division lemma to get:
- $184\ =\ 46\ \times\ 4\ +\ 0$
The remainder has become zero, and we cannot proceed any further.
Therefore the HCF of 230 and 184 is the divisor at this stage, i.e., 46.
Now, let's find HCF of 46 and 276 using Euclid's division algorithm:
Using Euclid’s lemma to get:
- $276\ =\ 46\ \times\ 6\ +\ 0$
The remainder has become zero, and we cannot proceed any further.
Therefore the HCF of 46 and 276 is the divisor at this stage, i.e., 46.
So, HCF of 184, 230 and 276 is 46.
Updated on: 10-Oct-2022
2K+ Views
Advertisements