CAT Number System Previous Year Questions (PYQs): Chapter-wise Weightage and Solved Questions

    CAT Number System: 4 chapters, 0 practice questions and one solved question from each chapter.

    Number System Chapter Matrix

    ChapterPYQsShare of unit PYQsPractice questions
    Digit Problems, Floor Values and Number Construction00%0
    Number Theory Word Problems and Diophantine Conditions00%0
    Prime Factors, Divisors and Factorials00%0
    Remainders, Divisibility and Modular Arithmetic00%0

    One Solved Question from Each Number System Chapter

    Question 1 · Quantitative Ability NAT

    In a 3-digit number N, the digits are non-zero and distinct such that none of the digits is a perfect square, and only one of the digits is a prime number. Then, the number of factors of the minimum possible value of N is

    Correct Answer:

    6

    Step-by-Step Solution

    Pattern: this is a digit-property filtering question combined with minimize-then-compute — recognisable because the digits must satisfy several yes/no filters (non-zero, distinct, not a perfect square, exactly one prime), and then we must build the smallest number and analyse a property of it (its factor count).

    Step 1 — List the allowed digit pool.

    Digits are from to (non-zero). Perfect squares among these are — these are banned since "none of the digits is a perfect square."

    Remaining allowed digits: .

    Step 2 — Split this pool by primality.

    Prime digits in the pool: .

    Non-prime digits in the pool: (only two digits!).

    Step 3 — Use the "only one prime digit" condition.

    has 3 distinct digits, and exactly one of them is prime — so exactly two digits must be non-prime. But the non-prime pool has only two members: and . So both non-prime digits are forced: they must be exactly .

    Step 4 — Choose the prime digit to minimize N.

    The third digit is any one prime from . To make as small as possible, pick the smallest available prime digit: .

    So the digit set is .

    Step 5 — Arrange the digits to minimize the number.

    With all three digits non-zero, the smallest 3-digit number from a given digit set is formed by placing digits in ascending order: hundreds < tens < units.

    Step 6 — Verify all conditions.

    Digits : non-zero ✓, distinct ✓, none is a perfect square (1,4,9 excluded) ✓, exactly one is prime (2 is prime; 6,8 are not) ✓.

    Step 7 — Find the number of factors of 268.

    (67 is prime).

    Number of factors .

    Trap: a student who doesn't notice that the non-prime pool has only two elements might try to freely choose 2 non-prime digits from a larger set, missing that is forced — or might forget that a perfect-square digit (like 1, which looks "small" and tempting for minimizing) is actually banned.

    chapter
    CAT Number System Previous Year Questions (PYQs): Chapter-wise Weightage and Solved Questions

    CAT Number System: 4 chapters, 0 practice questions and one solved question from each chapter.

    A question from this chapter

    Question 1

    In a 3-digit number N, the digits are non-zero and distinct such that none of the digits is a perfect square, and only one of the digits is a prime number. Then, the number of factors of the minimum possible value of N is

    Free preview ends here

    Login to view the complete previous-year questions and solutions

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.