Question

using euclid's division algorithm find largest number which when divided 969 and 2059 gives the reminder 9 and 11

Answer 1

if 969 is divided and leaves a remainder 9 then the number which it exactly divides is 960

if 2059 is divided and leaves a remainder 11 then the number which it exactly divides is 2048

now let us find it's hcf

2048 = 960 × 2 +128

960 = 128 × 7 + 64

128 = 64 × 2 + 0

therefore the largest number that divides 969 and 2059 to leave remainder 9 and 11 respectively is 64.

Answer 2

Answer:

The and iis, 64

hope u all liike this

thk u