arrow
arrow
arrow
What is the smallest possible number which when divided by 7, 9 and 11 leaves a remainder 2 in each case?
Question

What is the smallest possible number which when divided by 7, 9 and 11 leaves a remainder 2 in each case?

A.

600

B.

695

C.

750

D.

693

Correct option is B

Given:
We are asked to find the smallest possible number which when divided by 7, 9, and 11 leaves a remainder of 2 in each case.
Formula Used:
LCM (Least Common Multiple) is used to find the smallest number divisible by multiple numbers.
If a number leaves the same remainder 'r' when divided by a, b, c, then:
Required number = LCM(a, b, c) + r
Solution:
Since 7, 9, and 11 are co-prime (no common factors),
LCM = 7 × 9 × 11 = 693
Required number = 693 + 2 = 695

Free Tests

Free
Must Attempt

SSC CGL T-I Similar Paper (Held on 12 Sep 2025 S2)

languageIcon English
  • pdpQsnIcon100 Questions
  • pdpsheetsIcon200 Marks
  • timerIcon60 Mins
languageIcon English
Free
Must Attempt

SSC CGL T-I GA Section Test 01

languageIcon English
  • pdpQsnIcon25 Questions
  • pdpsheetsIcon50 Marks
  • timerIcon15 Mins
languageIcon English
Free
Must Attempt

SSC CGL T-I Full Mock Test 1 (Exam Level)

languageIcon English
  • pdpQsnIcon100 Questions
  • pdpsheetsIcon200 Marks
  • timerIcon60 Mins
languageIcon English
test-prime-package

Access ‘IB ACIO’ Mock Tests with

  • 60000+ Mocks and Previous Year Papers
  • Unlimited Re-Attempts
  • Personalised Report Card
  • 500% Refund on Final Selection
  • Largest Community
students-icon
383k+ students have already unlocked exclusive benefits with Test Prime!
Our Plans
Monthsup-arrow