Question

find the greatest number which can divide 89,53 and 77 leaving a remainders 3,5 and 7 respectively​

Answer 1

Answer:

2 is the answer

Step-by-step explanation:

89-3 = 86

53-5 = 48

77-7 = 70

now, we have to find the HCF of 86,48 and 70

using Euclid division algorithm

HCF of 86 and 48=

86> 48

86= 48 x 1 + 38

48 = 38 x 1 + 10

38 = 10 x 3 + 8

10 = 8 x 1 + 2

8 = 2 x 4 + 0

HCF of 86 and 48 is 2

HCF of 2 and 70 =

2<70

70 = 2 x 35 + 0

HCF of 70 and 2 is 2

so, the greatest number which can divide 89,53 and 77 leaving a remainders 3,5 and 7 id 2