Use app×
QUIZARD
QUIZARD
JEE MAIN 2026 Crash Course
NEET 2026 Crash Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
6.7k views
in Number System by (56.4k points)

Find the largest number which divides 615 and 963 leaving remainder 6 in each case.

1 Answer

+1 vote
by (30.6k points)
selected by
 
Best answer

Firstly, the required numbers which on dividing doesn’t leave any remainder are to be found. 

This is done by subtracting 6 from both the given numbers. 

So, the numbers are 615 – 6 = 609 and 963 – 6 = 957. 

Now, if the HCF of 609 and 957 is found, that will be the required number. 

By applying Euclid’s division lemma 

957 = 609 x 1+ 348 

609 = 348 x 1 + 261 

348 = 216 x 1 + 87 

261 = 87 x 3 + 0. 

⇒ H.C.F. = 87. 

Therefore, the required number is 87.

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.

Categories

...