CET Remainders Questions with Solutions – Page 2
All 14 Remainders questions from MBA CET 2025 and 2026 papers. Tap Show answer, or open the detailed solution (free login). Page 2 of 3.
What least number must be added to 1056, so that the sum is completely divisible by 23 ?
Answer: A. 2
Solution — first steps
Approach: Remainder method: add (divisor − remainder). Solution: 1056 ÷ 23: 23 × 45 = 1035, remainder = 1056 − 1035 = 21.
The full step-by-step working opens with a free login.
Find the remainder when : (1719 X 1721 X 1723 X 1725 X 1727) is divided by 18 ?

Answer: A. 9
Solution — first steps
Approach: Replace each factor by its remainder mod 18. Solution: 1719 = 18 × 95 + 9 → 9 1721 → 11, 1723 → 13, 1725 → 15, 1727 → 17 Product ≡ 9 × (11 × 13 × 15 × 17) (mod 18) 11 × 13 × 15 × 17 is odd, and 9 × odd ≡ 9 (mod 18) Remainder = 9 Cetking shortcut: One factor leaves 9 and all others are odd: 9 × odd always leaves 9 on division by 18.
The full step-by-step working opens with a free login.
When 3³³³ is divided by 11, the remainder is …?
Answer: E. 5
Solution — first steps
Approach: Find a small power of 3 that leaves remainder 1 when divided by 11. Solution: 3⁵ = 243 = 11 × 22 + 1 → 3⁵ ≡ 1 (mod 11).
The full step-by-step working opens with a free login.
Find smallest number which leaves remainder 4 when divided by 16, 18, 20, 25, but divisible by 7:
Answer: B. 18004
Solution — first steps
Approach: Number = LCM × k + remainder; then apply the divisibility-by-7 condition. Solution: 16 = 2⁴, 18 = 2 × 3², 20 = 2² × 5, 25 = 5² → LCM = 2⁴ × 3² × 5² = 3600.
The full step-by-step working opens with a free login.
A University has less than 5000 students. If students are divided equally into teams of either 9, 10, 12, or 25 each, exactly 4 students are always left out. However, dividing them into teams of 11 leaves no student out. Determine the maximum number of teams of 12 students that can be formed.
Answer: A. 150
Solution — first steps
Approach: Same remainder 4 → number = LCM × k + 4; then impose divisibility by 11. Solution: LCM(9, 10, 12, 25) = 2² × 3² × 5² = 900 → x = 900k + 4 Cetking shortcut: List 4, 904, 1804, 2704, 3604, 4504 and test divisibility by 11 (alternating digit sums): only 1804.
The full step-by-step working opens with a free login.