- 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
Find the HCF of 522,812,1276.
Given :
The given numbers are 522, 812, 1276
To do :
We have to find the HCF of the given numbers.
Solution :
By Euclid's division algorithm,
$$Dividend = Divisor \times Quotient + Remainder$$
Here, $1276 > 812 > 522$
So, apply Euclid's division lemma for 1276 and 812
$1276 = 812 \times 1 + 464$
Remainder $=464$
Repeat the above process until we will get 0 as the remainder.
Now, consider 812 as the dividend and 464 as the divisor,
$812 = 464 \times 1 + 348$
Remainder $=348$
Now, consider 464 as the dividend and 348 as the divisor,
$464 = 348 \times 1+ 116$
Remainder $=116$
Now, consider 348 as the dividend and 116 as the divisor,
$348 = 116 \times 3 + 0$
Remainder $=0$
So, HCF of 1276 and 812 is 116.
Now, apply Euclid's division lemma for 522 and 116,
$522 = 116 \times 4 + 58$
Remainder $=58$
Now, consider 116 as the dividend and 58 as the divisor,
$116 = 58 \times 2 + 0$
Remainder $=0$
Therefore, HCF of 1276, 812, and 522 is 58.
To Continue Learning Please Login
Login with Google