Question

Find the smallest positive integer that leaves a remainder of 2 when divided by 3, a remainder of 3 when divided by 4, and a remainder of 4 when divided by 5.

Asked in RRB NTPC (UG) CBT-I · 2026
LCM and HCF · Quantitative Aptitude
Exam PYQ4 Options
Quantitative AptitudeNumber SystemLCM and HCFApplication of LCM and HCFSingle RemainderRRB NTPC (UG) CBT-I2026
💡
Quick Revision

When a number leaves the same remainder \(r\) when divided by several divisors, subtract \(r\) first; the remaining part must be divisible by the LCM of the divisors.

Correct AnswerCorrect option for this question
Option C — 59

Learn LCM and HCF in 60 Seconds

Learn how to solve LCM and HCF problems using simple concepts, formulas, and quick methods.

Topic Video
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 & LCM: Word Problems Decoded in Previous Exams

See how often HCF & LCM: Word Problems Decoded has appeared in previous-year questions across major government exams.

High Exam Frequency
12UPSC Questions Asked in These Years:2010, 2011, 2013, 2014, 2016, 2017, 2020, 2021, 2022, 2023, 2024, 2026
9SSC Questions Asked in These Years:2016, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026
8Railways Questions Asked in These Years:2016, 2018, 2020, 2021, 2022, 2024, 2025, 2026
11State PSC Questions Asked in These Years:2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025
HCF & LCM: Word Problems Decoded has appeared in 40 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.

Open Revision Notes ↗

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.