Three dice, whose all six faces arc- marked ‘1’ to ‘6’, are thrown. The number of ways of getting a sum of 16 is

1. Fundamental Principles of Counting (basic)

Welcome to the foundation of Quantitative Aptitude! Before we dive into complex probability or permutations, we must master the Fundamental Principles of Counting. At its heart, counting isn't just about tallying items; it is the logical systematic process of determining the total number of outcomes in a given scenario without necessarily listing them all.

There are two primary pillars you must understand: the Multiplication Principle and the Addition Principle. These are the "rules of the game" that dictate how we process choices and preferences. Much like how different electoral rules can change the outcome of an election by altering how votes are counted (Indian Constitution at Work, ELECTION AND REPRESENTATION, p.55), these mathematical principles change how we arrive at a total count based on the relationship between events.

Principle	Logic (The "Keyword")	When to use it?
Multiplication	AND	When a task is performed in multiple successive stages. If stage 1 has 'm' ways and stage 2 has 'n' ways, the total is m × n.
Addition	OR	When tasks are mutually exclusive (you choose one or the other). If option A has 'm' ways and option B has 'n' ways, the total is m + n.

For example, if you are choosing an outfit and have 3 shirts AND 2 trousers, you multiply (3 × 2 = 6 ways) because you need both to complete the task. However, if you are choosing a beverage and the menu offers 3 types of tea OR 2 types of coffee, you add (3 + 2 = 5 ways) because you are only picking one drink. Understanding whether events are independent stages or alternative choices is the secret to solving 90% of counting problems.

Sources: Indian Constitution at Work, ELECTION AND REPRESENTATION, p.55

2. Permutations of Identical Objects (intermediate)

In standard permutations, we assume every object is distinct. However, when some objects are identical, switching their positions does not create a new arrangement. For example, if you have two identical red balls, swapping them doesn't change the visual order. This leads to overcounting if we simply use the standard factorial formula. To correct this, we must divide the total number of permutations by the number of ways the identical items can be rearranged among themselves. Think of it as a logical constraint similar to how we must use specific conventions in physics formulas to ensure accuracy, such as the New Cartesian Sign Convention used in the mirror formula Science, Class X (NCERT 2025 ed.), Light – Reflection and Refraction, p.143. Just as variables like object distance (u) and focal length (f) must be treated precisely based on their properties, identical objects in a set must be treated as a single functional group to find the unique arrangements. The General Formula: If there are n total objects, where p are of one kind, q are of another kind, and r are of a third kind, the total number of unique permutations is: n! / (p! × q! × r!) For example, consider the word "APPLES". It has 6 letters, but the letter 'P' repeats 2 times. Instead of 6! (720), the unique arrangements are 6! / 2! = 360. This principle is vital for solving complex probability problems, such as determining the number of ways to achieve a specific sum with dice where certain outcomes (like rolling two 6s and one 4) are treated as sets of identical values that can be arranged in specific, limited ways.

Sources: Science, Class X (NCERT 2025 ed.), Light – Reflection and Refraction, p.143

3. Combinations: The Art of Selection (basic)

In the study of Quantitative Aptitude, a Combination is defined as a selection of items where the order does not matter. Imagine you are selecting three crops to grow in a region to create a '3-crop combination'—whether you list them as Wheat-Rice-Maize or Maize-Wheat-Rice, the set of crops remains identical Geography of India, Spatial Organisation of Agriculture, p.17. This is the fundamental 'Art of Selection': focusing purely on which items are chosen rather than how they are arranged. To calculate the number of ways to select r items from a total of n items, we use the formula nCr = n! / [r!(n - r)!]. The denominator includes r! specifically to 'divide out' or remove the different arrangements of the selected items. For instance, if you are matching a list of local winds to their regions in a UPSC match-the-following question, you are essentially looking for the correct pairs (combinations) regardless of which pair you identify first Physical Geography by PMF IAS, Pressure Systems and Wind System, p.324. In practical problem-solving, identifying combinations is often the first step in logic. For example, if you are looking for specific outcomes from multiple events (like the sum of numbers on dice), you first identify the unique sets of numbers that satisfy the condition. Only after identifying these 'groups' do you determine if their sequence or order is relevant to the final answer. Understanding combinations allows you to simplify complex counting problems by grouping outcomes into distinct, non-ordered sets before applying further logic.

Sources: Geography of India, Spatial Organisation of Agriculture, p.17; Physical Geography by PMF IAS, Pressure Systems and Wind System, p.324

4. Probability and Sample Spaces (basic)

In probability, the Sample Space is the collection of all possible outcomes of a random experiment. When we roll a standard six-sided die—a classic cuboid object—the sample space for a single roll is {1, 2, 3, 4, 5, 6} Science Class VIII, The Amazing World of Solutes, Solvents, and Solutions, p.145. However, as we increase the number of dice, the complexity of the sample space grows. For three dice, the total number of possible outcomes is 6 × 6 × 6 = 216. To solve problems involving sums, we must learn to identify favorable outcomes within this large space by categorizing them logically.

To find the number of ways to achieve a specific sum, such as 16, with three dice, we follow a two-step process: identifying combinations and then calculating permutations. First, we list the sets of three numbers (between 1 and 6) that add up to the target. For a sum of 16, the possible sets are {6, 6, 4} and {6, 5, 5}. Just as we might sort scientific samples into distinct groups based on their properties, we group these outcomes to ensure we don't miss any possibilities Science Class VII, Exploring Substances: Acidic, Basic, and Neutral, p.9.

The final step is to recognize that in probability, dice are treated as distinct. This means the order matters. A set like {6, 6, 4} can occur in 3 different ways (permutations): (6, 6, 4), (6, 4, 6), and (4, 6, 6). Similarly, the set {6, 5, 5} can occur in 3 ways: (6, 5, 5), (5, 6, 5), and (5, 5, 6). Adding these together, we find there are 6 total favorable outcomes. This systematic approach—moving from the total sample space to specific permutations—is the bedrock of solving CSAT probability questions accurately.

Sources: Science Class VIII, The Amazing World of Solutes, Solvents, and Solutions, p.145; Science Class VII, Exploring Substances: Acidic, Basic, and Neutral, p.9

5. Partitioning Integers and Sum Constraints (intermediate)

In quantitative aptitude, Partitioning Integers refers to the process of breaking a total sum into a specific number of parts (summands) while adhering to defined boundary constraints. For instance, if you are rolling dice, each part is constrained between 1 and 6. This concept is fundamental to probability and combinatorics because it requires a bridge between finding combinations (the sets of numbers) and permutations (the order in which they appear).

To solve these problems systematically, we follow a two-step process:

• Step 1: Systematic Listing (Combinations): Identify all unique sets of numbers that satisfy the sum. To avoid missing any, always start with the highest possible value for the first number and work downwards. For example, to get a sum of 16 using three dice, we look for sets where each number is ≤ 6. We find {6, 6, 4} and {6, 5, 5}.
• Step 2: Calculating Arrangements (Permutations): Once the sets are identified, we determine how many ways those specific numbers can be ordered. If the dice are distinct (e.g., Red, Blue, Green), the order matters. Just as in economic modeling where Total Cost is the sum of its distinct components like Total Variable Cost and Total Fixed Cost Microeconomics (NCERT class XII 2025 ed.), Production and Costs, p.50, the total number of ways to reach a sum is the sum of the permutations of each valid set.

Consider the permutations for our sum of 16 example. For the set {6, 6, 4}, there are 3 ways: (6, 6, 4), (6, 4, 6), and (4, 6, 6). Similarly, for {6, 5, 5}, there are 3 ways: (6, 5, 5), (5, 6, 5), and (5, 5, 6). Summing these gives us 6 total outcomes. If a set had three distinct numbers, like {6, 5, 4}, it would result in 3! = 6 permutations.

Type of Set	Example	Permutations (Ways)
All numbers same	{5, 5, 5}	1 way
Two numbers same	{6, 6, 4}	3 ways (3! / 2!)
All numbers distinct	{6, 5, 4}	6 ways (3!)

Sources: Microeconomics (NCERT class XII 2025 ed.), Production and Costs, p.50

6. Systematic Enumeration for Dice Problems (exam-level)

In probability problems involving dice, Systematic Enumeration is a foolproof strategy to ensure every possible outcome is accounted for without duplication. This method involves a two-step logical process: first, identifying the unique combinations (sets of numbers) that satisfy the condition, and second, calculating the permutations (the specific orders) for each set. Just as an 'Outcome Budget' seeks to quantify deliverables to ensure accuracy and transparency (Indian Economy, Vivek Singh (7th ed. 2023-24), Government Budgeting, p.147), systematic enumeration allows us to quantify every specific outcome to avoid 'conflicting results' in our final calculation (Microeconomics (NCERT class XII 2025 ed.), Theory of Consumer Behaviour, p.14). To find the number of ways to obtain a specific sum, say 16, with three six-sided dice, we list the sets of three numbers between 1 and 6 that add up to 16. We do this systematically by starting with the highest possible number (6):

• Set 1: {6, 6, 4} — Because two numbers are identical, there are 3 possible arrangements: (6, 6, 4), (6, 4, 6), and (4, 6, 6).
• Set 2: {6, 5, 5} — Similarly, there are 3 arrangements: (6, 5, 5), (5, 6, 5), and (5, 5, 6).

By summing these permutations (3 + 3), we find there are exactly 6 total ways. This structured approach prevents the common error of missing a set or miscounting the internal arrangements of the dice.

Sources: Indian Economy, Vivek Singh (7th ed. 2023-24), Government Budgeting, p.147; Microeconomics (NCERT class XII 2025 ed.), Theory of Consumer Behaviour, p.14

7. Solving the Original PYQ (exam-level)

This question is a perfect application of the Fundamental Principle of Counting and Permutations with Repetition that you just mastered. In UPSC CSAT, dice problems often test your ability to systematically list combinations and then arrange them. To solve this, you must first identify the unique sets of numbers that sum to 16. Since the maximum value on a die is 6, we start from the highest possible values: the set {6, 6, 4} and the set {6, 5, 5}. These are the only combinations possible, as any further reduction in one number (like changing 5 to 4) would require another number to exceed the limit of 6.

As your coach, I want you to remember that the dice are distinct entities (often implied in such problems unless stated otherwise), meaning the order in which the numbers appear matters. For the set {6, 6, 4}, we use the formula for permutations of objects where some are identical: 3! / 2! = 3 ways (6-6-4, 6-4-6, 4-6-6). Similarly, for the set {6, 5, 5}, we have 3! / 2! = 3 ways (6-5-5, 5-6-5, 5-5-6). Summing these distinct arrangements (3 + 3) leads us directly to the correct answer: (C) 6. This systematic approach prevents the common error of missing a combination or miscounting an arrangement.

UPSC often includes "trap" options to catch students who rush their logic. Option (A) 3 is the most common trap; it targets students who correctly identify the two sets but forget to permute them, or those who only find one set and permute it. Option (D) 12 is another distractor, often chosen by those who treat the numbers as unique (calculating 3! + 3! = 12) without accounting for the repeated digits in the sets. Success in these problems relies on consistency: find the combinations first, then apply the correct arrangement logic based on the repetition of numbers.