Question

find the greatest positive integer which divides 332 and 447 leaving remainder 2 in each case​

Answer 1

$\huge \boxed{hello \: mate}$

We need to find the number which divides 332 and 447 leaving remainder 6.

So, 332-2=330

447-2=445

The required number= HCF of 330 and 445

By Euclid's division lemma,

445=330×1+115

330=115×2+100

115=100×1+15

100=15×6+10

15=10×1+5

10=5×2+0

HCF=5

Hence, answer=5.

Answer 2

Answer:

The answer is 5

When a no: is divides 332 and 447 , it leaves a remainder 2 in both the case .

to find the no: , follow these steps :-

1) Subtract the remainders from the numbers :-

332 - 2 = 330

447 - 2 = 445

2) HCF of 330 and 445 = greatest positive integer which divides 332 and 447 leaving remainder 2 in each case

330 = 2 . 3 . 5 . 11

445 = 5 . 89

hcf = 5

5 is the greatest positive integer which divides 332 and 447 leaving remainder 2 in each case

    MAKE ME THE BRAINALIEST ANSWER