by using euclid's division algorithm find the largest number which when divides 969 and 2056 given the remainder 9 and 11 respectively
Answers
Answered by
13
firstly,
subtract, 969-9=960
2056-11=2045
now, do their HCF by Euclid's division lemma.
hope it helps
plz mark it as brainliest please, plz, plz, plz,pkz
subtract, 969-9=960
2056-11=2045
now, do their HCF by Euclid's division lemma.
hope it helps
plz mark it as brainliest please, plz, plz, plz,pkz
riya2234:
u belongs to Punjab,correct
hmm
why??
how do you know ??
I know
this is a procedure
if someone who likes our answers, mark them as brainliest
ohk
happy ??????
hmm
Similar questions