NCERI Edempi
23. Use Euclid's division algorithm, to find
the largest number, which divides 957 and
1280 leaving remainder 5 in each case.
CBSE 2012
Answers
Answered by
0
Answer:
Step-by-step explanation:
first subtract 5 from 957 and 1280
957 – 5 = 952
1280 – 5 = 1275
Now using Euclid's Division Algorithm we will find the HCF of 952 and 1275
1275 = 952 ×1+323
952 = 323 × 2 + 306
323 = 306 × 1+ 17
306 = 17 × 18 + 0
The largest no. that divides 957 and 1280 leaving a reminder 5 is 17
Mark as Brainlist
Answered by
1
Answer:
957 are divide by 7 and remainder is 5
Similar questions