using Euclid's division algorithm find the largest no. which divides 70 and 125 leaving remainders 5 and 8 respectively.
Answers
Answered by
0
Step-by-step explanation:
divide 70+5 125+8 then do by Euclid's division lemma
Answered by
2
Answer:
13 is the answer for the given problem
Attachments:
Similar questions
Social Sciences,
4 months ago
Computer Science,
4 months ago
Physics,
8 months ago
Science,
8 months ago