CET Remainders Questions with Solutions
- 14 questions from MBA CET 2025 (8) and 2026 (6)
- Asked in 10 of 13 slots
- Difficulty: 9 Easy / 5 Medium / 0 Hard
- Question and answer free · detailed solution after free login · updated 6 Nov 2026
Remainders questions ask what is left when a number or an expression is divided by another. Cyclicity and remainder theorems make the large ones manageable.
Tap Show answer, or open the detailed solution (free login). Page 1 of 3.
- 1683
- 1598
- 1458
- 1692
- 1703
Show answerHide answer
Answer: A. 1683
- 2
- 4
- 5
- 7
- 9
Show answerHide answer
Answer: B. 4
- 2
- 5
- 0
- 4
- 8
Show answerHide answer
Answer: C. 0
- 1
- 2
- 3
- 4
- 0
Show answerHide answer
Answer: D. 4
A number when divided by 256 gives a remainder 73.
When the same number is divided by 16, what will be the remainder?
- 1
- 7
- 9
- 11
- 13
Show answerHide answer
Answer: C. 9
Frequently asked questions
How many Remainders questions came in MBA CET 2025 and 2026?
14 Remainders questions were asked: 8 in MBA CET 2025 and 6 in MBA CET 2026. Every one is on this page with its answer (twin papers are not counted).
Which CET slots asked Remainders? Which had the most?
Remainders questions came in 10 of 13 slots. CET 2025 Slot 2 had the most (3 questions). Slot-wise lists: CET 2026 and CET 2025.
How difficult are CET Remainders questions?
Of the 14 Remainders questions that carry a difficulty rating, 9 are Easy, 5 Medium and 0 Hard.
Are the solutions free?
The question and its answer are free for everyone. The detailed Cetking solution opens after a free login with your mobile number (OTP).
Where can I practise more Remainders?
Open all Numbers chapters for the other chapters, all CET papers and topics for every slot, or the Arena to practise.
We learn about remainders in grade school .It isn’t hard to see that when 16 is divided by 7, the remainder is 2. How can it possibly be the case that something we learned in fifth grade is included on a test that helps determine where we go to graduate school?
But in mathematics, seemingly basic topics often have broader applications. So let’s consider both simple and complex applications of remainders on the CAT. The most straightforward scenario is for the question to ask what the remainder is in a given context.
What is the remainder when x is divided by 3?
1) The sum of the digits of x is 5
2) When x is divided by 9, the remainder is 2
Pretty straightforward question. In Statement 1, we could approach by simply picking numbers. If the sum of the digits of x is 5, x could be 14. When 14 is divided by 3, the remainder is 2. Similarly, x could be 32. When 32 is divided by 3, the remainder will again be 2. Or x could be 50, and still, the remainder when x is divided by 3 will be 2. So no matter what number we pick, the remainder will always be 2. Statement 1 alone is sufficient.
Note that if we know the rule for divisibility by 3 – if the digits of a number sum to a multiple of 3, the number itself is a multiple of 3 – we can reason this out without picking numbers. If the sum of the digits of x were exactly 3, the remainder would be 0. If the sum of the digits of x were 4, then logically, the remainder would be 1. Consequently, if the sum of the digits of x were 5, the remainder would have to be 2.
Again, in Statement 2, we can pick numbers. We’re told that when x is divided by 9, the remainder is 2. To quickly generate a list of numbers that we might test, we can start with multiples of 9: 9, 18, 27, 36, etc. Then, we can add two to each of those multiples of 9 to get the following list of numbers: 11, 20, 29, 38, etc. All of these numbers will give us a remainder of 2 when divided by 9. Now we can test them. If x is 11, when x is divided by 3, the remainder will be 2. If x is 20, when x is divided by 3, the remainder will be 2. We’ll quickly see that the remainder will always be 2, so Statement 2 is also sufficient on its own. The answer to this question is D, either statement alone is sufficient. That’s not too bad.
But the CAT won’t always be so conspicuous about what category of math it’s testing. Take this more challenging question, for example:
June 25, 1982 fell on a Friday. On which day of the week did June 25, 1987 fall. (Note: 1984 was a leap year.)
A) Sunday
B) Monday
C) Tuesday
D) Wednesday
E) Thursday
If you’re anything like my students, it’s not blindingly obvious that this is a remainder question in disguise. But that is precisely what we’re dealing with. Consider a very simple case. Say that June 1 is a Monday, and you want to know what day of the week it will be 14 days later. Clearly, that would also be a Monday. And if asked what day of the week it would be 16 days later, you’d know that it would be a Wednesday – two days after Monday. Put another way – because we’re dealing with weeks, or increments of 7 – all we need to do is divide the number of days elapsed by 7 and then find the remainder in order to determine the day of the week. 16 divided by 7 gives a remainder of 2, so if June 1 is a Monday, 16 days later must be 2 days after Monday.
Suddenly the aforementioned question is considerably more approachable. From June 25, 1982 to June 25, 1983 a total of 365 days will pass. 365/7 gives a remainder of 1, so if June 25, 1982 was a Friday, June 25 1983 will be a Saturday. From June 25, 1983 to June 25, 1984, 366 days will pass because 1984 is a leap year. 366/7 gives a remainder of 2, so if June 25, 1983 was a Saturday, June 25, 1984 will be 2 days later, or Monday. We already know that in a typical 365 day year, the remainder will be 1, so June 25, 1985 will be Tuesday, June 25, 1986 will be Wednesday and June 25, 1987 will be Thursday, which is our answer.
Takeaway: the challenge of the CAT isn’t necessarily that questions are asking you to do difficult math, but that it can be hard to figure out what the questions are asking you to do. When you encounter something that seems unfamiliar or strange, remind yourself that virtually every problem you encounter will involve the application of a concept considerably simpler than the nebulous wording the question might suggest.