What is the largest number that divides 445 572 and 699?

AcademicMathematicsNCERTClass 10

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 10:15:16

Related Questions & Answers
Find sum of the series 1-2+3-4+5-6+7....in C++
The 5 Soft Skills that will get you Hired
Sum of the series 2 + (2+4) + (2+4+6) + (2+4+6+8) + ... + (2+4+6+8+...+2n) in C++
How To Fix and Protect The Linux Server Against the Dirty COW Vulnerability on CentOS 5/6/7 or RHEL 5/6/7
Difference between Kerberos Version 4 and Version 5
Find count of digits in a number that divide the number in C++
Find the number of ways to divide number into four parts such that a = c and b = d in C++
Finding two missing numbers that appears only once and twice respectively in JavaScript
Number of digits that divide the complete number in JavaScript
C++ program to find the sum of the series (1*1) + (2*2) + (3*3) + (4*4) + (5*5) + … + (n*n)
How do we specify that the list order should be descending (9,8,7, 6, 5...) in HTML?
Finding difference of greatest and the smallest digit in a number - JavaScript
Sum of series 2/3 – 4/5 + 6/7 – 8/9 + …… upto n terms
Find the nth term of the given series 0, 0, 2, 1, 4, 2, 6, 3, 8, 4… in C++
Implement GREATEST() in MySQL and update the table?
Find position of the given number among the numbers made of 4 and 7 in C++

Since the respective remainders of 445, 572, and 699 are 4, 5, and 6, we have to find the number which exactly divides (445-4), (572-5), and (696-6).So, the required number is the HCF of 441, 567, and 693.Firstly, we will find the HCF of 441 and 567.

∴ HCF = 63
Now, we will find the HCF of 63 and 693.

∴ HCF = 63
Hence, the required number is 63.

Given:

445, 572 and 699.

To do:

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: