Find the H.C.F of 512 and 1280 using euclid's division algorithm
Answers
Answered by
10
Step-by-step explanation:
as euclid division lemma
a=bq+r
1280= 512×2+256
512=256×2+0
hence hcf is 256 as r=0
hope it helps. plz mark brainliest
Answered by
2
Answer:
This is the answer
Mark as Branliest and follow me
Attachments:
Similar questions