Question
Determine the largest number that divides both 1058 and 1550, leaving remainders of 5 and 11, respectively.
Asked in RRB Group D · 2025
LCM and HCF · Quantitative Aptitude
Exam PYQ4 Options
Quick Revision
For large numbers, use the Euclidean division method: divide the larger number by the smaller number repeatedly until the remainder becomes 0. The last non-zero divisor is the HCF.
Correct AnswerCorrect option for this question
Learn LCM and HCF in 60 Seconds
Quickly find the HCF of numbers using Prime Factorisation and the Euclidean Algorithm with simple tricks.
Everything you need to learn, practice & excel — in one place.
Video-Based Study Material
PYQ-Based Quizzes
1,000+ Informative Audiobooks
300+ Full-Length Mock Tests
Daily Current Affairs
5,000+ PYQs
Questions Asked from HCF: Prime Factorisation & Euclidean Algorithm in Previous Exams
See how often HCF: Prime Factorisation & Euclidean Algorithm has appeared in previous-year questions across major government exams.
15UPSC Questions Asked in These Years:2010, 2011, 2012, 2013, 2014, 2015, 2016, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2026
9SSC Questions Asked in These Years:2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026
8Railways Questions Asked in These Years:2016, 2018, 2021, 2022, 2023, 2024, 2025, 2026
15State PSC Questions Asked in These Years:2002, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025
HCF: Prime Factorisation & Euclidean Algorithm has appeared in 47 previous-year exam questions, most frequently in UPSC, State PSC and SSC.
2-Minute Revision Notes
Revise LCM and HCF and Its Related Concepts
Strengthen key concepts with exam-focused visual notes for faster revision.
Explore More Questions
Continue practising by chapter, topic and related subjects.
One question solved. Keep going.
Continue with the next Number System question and build your accuracy one question at a time.