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 greatest number that will divide 445, 572 and 699 leaving remainders 4, 5 and 6 respectively.
Given: 445, 572 and 699.
To find: Here we have to find the value of the greatest number which divides 445, 572 and 699 leaving remainders 4, 5 and 6 respectively.
Solution:
If the required number divide 445, 572 and 699 leaving remainders 4, 5 and 6 respectively, then this means that number will divide 441(445 $-$ 4), 567(572 $-$ 5) and 693(699 $-$ 6) completely.
Now, we just have to find the HCF of 441, 567 and 693.
First, let's find HCF of 441 and 567 using Euclid's division algorithm:
Using Euclid’s lemma to get:
- $567\ =\ 441\ \times\ 1\ +\ 126$
Now, consider the divisor 441 and the remainder 126, and apply the division lemma to get:
- $441\ =\ 126\ \times\ 3\ +\ 63$
Now, consider the divisor 126 and the remainder 63, and apply the division lemma to get:
- $126\ =\ 63\ \times\ 2\ +\ 0$
The remainder has become zero, and we cannot proceed any further.
Therefore the HCF of 441 and 567 is the divisor at this stage, i.e., 63.
Now, let's find HCF of 63 and 693 using Euclid's division algorithm:
Using Euclid’s lemma to get:
- $693\ =\ 63\ \times\ 11\ +\ 0$
The remainder has become zero, and we cannot proceed any further.
Therefore the HCF of 63 and 693 is the divisor at this stage, i.e., 63.
So, the greatest number which divides 445, 572 and 699 leaving remainders 4, 5 and 6 respectively is 63.
Updated on: 10-Oct-2022
3K+ Views
Advertisements