What is the smallest number which leaves remainder 3 when divided by any of the numbers 5, 8 and 9, but leaves no remainder when it is divided by 11?
- AOption (a)
363
- BOption (b)
563
- COption (c)
463
- DOption (d)
663
View answer & explanationHide answer & explanation
Correct answer
363
Why this answer is correct
Given:
We need to find the smallest number which leaves remainder 3 when divided by 5, 8, and 9, but leaves no remainder when it is divided by 11.
Formula used:
Number = LCM(5, 8, 9) + 3
The number must also be divisible by 11.
Calculation:
LCM of 5, 8, and 9 = 360
Number = 360k + 3 (where k is an integer)
The number must be divisible by 11
⇒ 360k + 3 ≡ 0 (mod 11)
⇒ 360k ≡ -3 (mod 11)
⇒ 360 ≡ 8 (mod 11) (since 360 mod 11 = 8)
⇒ 8k ≡ -3 (mod 11)
⇒ 8k ≡ 8 (mod 11)
⇒ k ≡ 1 (mod 11)
⇒ k = 1
⇒ Number = 360 × 1 + 3 = 363
∴ The correct answer is option 1.