- 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 441, 567 and 693.
Given:
441, 567 and 693.
To find:
Here we have to find the HCF of the given numbers.
Solution:
Using Euclid's division algorithm to find HCF:
$a=693$ and $b=567$
Using Euclid’s lemma to get:
$693\ =\ 567\ \times\ 1\ +\ 26$
$567\ =\ 126\ \times\ 4\ +\ 63$
$126\ =\ 63\ \times\ 2\ +\ 0$
HCF(693, 567) $=63$
Now,
$c=441$ and $d=63$
Using Euclid’s lemma to get:
$441\ =\ 63\ \times\ 7\ +\ 0$
HCF(693, 567, 441) $=63$
So, HCF of 693, 567 and 441 is 63.
Advertisements