Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively.

0 votes
61 views
asked Jan 25, 2018 in Mathematics by Annu Priya (18,055 points) 24 45 84

Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively.

1 Answer

0 votes
answered Jan 25, 2018 by Annu Priya (18,055 points) 24 45 84
 
Best answer

The require number when divides 285 and 1249, leaves remainder 9 and 7, 

this means 285 – 9 = 276 and 1249 – 7 = 1242 are completely divisible by the number
∴ The required number = HCF of 276 and 1242
By applying Euclid’s division lemma
1242 = 276 × 4 + 138
276 = 138 × 2 + 0

∴ HCF = 138
Hence remainder is = 0
Hence required number is 138

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

One Thought Forever

“There is a close connection between getting up in the world and getting up in the morning.“
– Anon
~~~*****~~~

...