Three dice (each having six faces with each face having one number from 1 to 6) are rolled. What is the number of possible outcomes such that at least one dice shows the number 2?

1. Fundamental Principles of Counting (basic)

Counting is the bedrock of quantitative aptitude. It allows us to determine the total number of possible outcomes in a scenario without the tedious process of listing every individual possibility. At its heart, counting relies on two logical pillars: the Multiplication Principle and the Addition Principle. These rules are not just mathematical abstractions; they are the "rules of the game" that dictate outcomes in complex systems, from voting preferences in an election to the calculation of national wealth Indian Constitution at Work, Political Science Class XI (NCERT 2025 ed.), ELECTION AND REPRESENTATION, p.55.

The Multiplication Principle (the 'AND' rule) states that if a first task can be performed in m ways and a second independent task can be performed in n ways, then the total number of ways to perform both tasks together is m × n. For instance, if you are choosing a representative from two different committees, your total options multiply. However, we must be cautious of Double Counting. Just as in macroeconomics where counting intermediate goods twice would "highly exaggerate the final value of our economic activity," in counting, we must ensure our categories are distinct and do not overlap unless we account for that overlap Macroeconomics (NCERT class XII 2025 ed.), National Income Accounting, p.11.

The Addition Principle (the 'OR' rule) applies when tasks are mutually exclusive, meaning they cannot happen at the same time. If you have to choose either one item from a set of m options or one item from a set of n options, the total number of choices is m + n. Mastery of these principles allows us to solve complex problems by breaking them into smaller, manageable events and then deciding whether to multiply or add based on the logic of the requirement.

Principle	Logic	Operation
Multiplication	Doing task A AND task B	Multiply (m × n)
Addition	Doing task A OR task B	Add (m + n)

Sources: Indian Constitution at Work, Political Science Class XI (NCERT 2025 ed.), ELECTION AND REPRESENTATION, p.55; Macroeconomics (NCERT class XII 2025 ed.), National Income Accounting, p.11

2. Permutations vs. Combinations (basic)

In the world of quantitative aptitude, the most fundamental distinction you must master is whether order matters. When we talk about Permutations, we are talking about arrangements. Think of it like a race: coming in 1st place is very different from coming in 3rd. Every time you change the position of an item, you create a new outcome. For instance, in geography, when you are asked to arrange states like Odisha and Chhattisgarh in descending order of production Geography of India, Contemporary Issues, p.113, the sequence (Odisha, Chhattisgarh) is a different answer than (Chhattisgarh, Odisha). That is a permutation problem.

On the other hand, Combinations are all about selection or grouping. Here, the order is irrelevant. If you are asked to identify five major items from India's import list INDIA PEOPLE AND ECONOMY, International Trade, p.88, it doesn't matter if you name 'Petroleum' first or 'Edible Oil' first—the collection of five items remains exactly the same. You are simply picking a subset from a larger group. In combinations, ABC is the same as CBA.

Feature	Permutations	Combinations
Main Concept	Arrangement/Ordering	Selection/Grouping
Does Order Matter?	Yes (AB ≠ BA)	No (AB = BA)
Keywords	Arrange, Line up, Rank, Schedule	Choose, Select, Group, Committee

To calculate these, we use n (the total items available) and r (how many we are choosing). The formula for Permutations is ⁿPᵣ = n! / (n - r)!, while for Combinations, we divide by an extra r! to "remove" the duplicates created by different orders: ⁿCᵣ = n! / [r!(n - r)!]. Just remember: if the sequence changes the meaning, use Permutations; if only the membership of the group matters, use Combinations.

Sources: Geography of India, Contemporary Issues, p.113; INDIA PEOPLE AND ECONOMY, International Trade, p.88

3. Probability and Sample Space (basic)

Welcome to Hop 3! Today, we are mastering the foundation of all predictive logic: Probability and Sample Space. In the context of competitive exams like the UPSC, understanding the range of possibilities is just as critical in mathematics as it is when observing scientific phenomena or recording outcomes in a laboratory Science-Class VII, Heat Transfer in Nature, p.93.

At its core, Probability is the mathematical measure of how likely an event is to occur. To calculate it, we must first define the Sample Space (S), which is the complete set of all possible outcomes for an experiment. For example, if you roll a single standard die, your sample space consists of six possibilities: {1, 2, 3, 4, 5, 6}. When we move to complex scenarios involving multiple objects, we use the Fundamental Principle of Counting. This principle states that if one event can happen in n ways and a second event can happen in m ways, the two events together can happen in n × m ways.

Consider the logic of rolling three dice simultaneously. Since each die has 6 faces, the total number of ordered outcomes is 6 × 6 × 6 = 216. This systematic counting is the first step in analyzing any "outcome," a term we also use when evaluating the results and performance of complex systems like a democracy Democratic Politics-II, Outcomes of Democracy, p.63. Once you have the total sample space, you can determine the probability of a specific event (E) using the formula:

P(E) = (Number of Favorable Outcomes) / (Total Number of Possible Outcomes)

One of the most elegant tools in your kit is the Complement Rule. Often, it is difficult to count the ways an event does happen (especially when the question says "at least one"). In such cases, it is much faster to calculate the total outcomes and subtract the ways the event does not happen. This "Total - None" approach is a favorite shortcut for top aspirants.

Sources: Science-Class VII, Heat Transfer in Nature, p.93; Democratic Politics-II, Outcomes of Democracy, p.63

4. Arrangements with Repetition (intermediate)

In the world of counting, Arrangements with Repetition occur when the selection of an item does not remove it from the pool of available options. Think of it like a digital lock: if you use the number '5' for the first digit, you are perfectly free to use '5' again for the second and third digits. Unlike standard permutations where the number of choices decreases (e.g., picking a President then a Vice-President), here the number of choices remains constant for every position or 'slot' you need to fill.

The mathematical logic is elegantly simple. If you have n distinct items to choose from, and you need to fill r positions, each position has n possibilities. By the fundamental principle of counting, you multiply these possibilities together: n × n × n ... (r times), which gives us the formula nʳ. This principle is a universal rule, much like how scientific formulas are valid in all situations for specific physical phenomena Science, Class X (NCERT 2025 ed.), Light – Reflection and Refraction, p.143. Whether you are counting the total possible outcomes of rolling multiple dice or creating complex passwords, the logic of independent slots remains the same.

A frequent challenge in UPSC-style aptitude tests is the 'At Least One' problem. Instead of counting every successful scenario (which can be tedious), we use Complementary Counting. We calculate the total possible arrangements (nʳ) and subtract the cases where the specific item never appears. For instance, if you are looking for how many outcomes of three dice rolls contain at least one '6', you would take the total outcomes (6³) and subtract the outcomes where a '6' is forbidden (5³). This method is far more efficient than trying to list every combination manually.

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

5. Set Theory: Intersection and Union (intermediate)

In quantitative aptitude, understanding how sets interact is vital for solving logical reasoning and data interpretation problems. The Union (denoted by A ∪ B) of two sets represents the collection of all elements that belong to either set A, set B, or both. Think of this as the logic of 'inclusive growth' in economics—where we aim to account for the total progress across various sectors like Primary, Secondary, and Tertiary combined (Indian Economy, Vivek Singh, p.253). Conversely, the Intersection (denoted by A ∩ B) consists only of the elements that are common to both sets. For instance, if you are comparing UPSC Question Sets for Prelims and Mains, the intersection would be those specific sub-topics, such as 'Fundamental Rights,' that appear in both examination formats (Indian Polity, M. Laxmikanth, p.745). To calculate the total number of unique elements in a union, we apply the Principle of Inclusion-Exclusion. If you simply add the number of elements in set A and set B, you will double-count the elements that exist in both. Therefore, the formula is: |A ∪ B| = |A| + |B| - |A ∩ B|. This mathematical rigor is essential when analyzing data tables, such as calculating the total Gross Value Added (GVA) across different years without overlapping the contributions of specific sub-industries (Understanding Economic Development, Class X, p.36). An advanced application of set theory is the use of the Complement, often used to solve 'at least one' problems. Instead of calculating every successful combination, it is often faster to find the 'Total' and subtract the 'None' (the complement). This logical shortcut is a favorite in aptitude tests because it reduces complex multi-step additions into a single subtraction. Whether you are classifying karst landforms like stalactites and stalagmites into sets of 'above-ground' or 'underground' features, these principles ensure no data point is missed or counted twice (Certificate Physical and Human Geography, p.79).

Sources: Indian Economy, Vivek Singh, Inclusive growth and issues, p.253; Indian Polity, M. Laxmikanth, World Constitutions, p.745; Understanding Economic Development, Class X, SECTORS OF THE INDIAN ECONOMY, p.36; Certificate Physical and Human Geography, Limestone and Chalk Landforms, p.79

6. The Complement Principle (Subtraction Method) (exam-level)

In the realm of Quantitative Aptitude, the Complement Principle is your secret weapon for efficiency. Think of it as the 'Subtraction Method.' Instead of directly counting the outcomes you want (which might be numerous and complex), you calculate the Total Possible Outcomes and subtract the outcomes you don't want. This is particularly powerful when dealing with the phrase 'at least one,' where counting direct possibilities would require summing up multiple individual cases. Just as historians examine oral stories like the Jatakas to find perspectives that official inscriptions might omit THEMES IN INDIAN HISTORY PART I, Kings, Farmers and Towns, p.38, we look at the 'unwanted' space to define the 'wanted' space.

The mathematical logic is elegant and follows a simple formula: Desired Outcomes = Total Outcomes − Unfavorable Outcomes. This approach is highly useful when analyzing data sets, much like the way one might categorize electoral news into specific parts—looking at what is present versus what is missing to understand the final outcome Democratic Politics-I, ELECTORAL POLITICS, p.54. By focusing on the 'complement' (the failure), you often find a much shorter path to the solution.

To master this, always identify the 'Failure Case.' For example, if you are asked for outcomes where 'at least one die shows a 2,' the failure case is 'no die shows a 2.' If you are asked for 'at least one vowel' in a word arrangement, the failure is 'all consonants.' By calculating the total arrangements and subtracting these 'all consonant' arrangements, you arrive at your answer with far less effort than calculating 1 vowel, 2 vowels, and 3 vowels separately.

Sources: THEMES IN INDIAN HISTORY PART I, Kings, Farmers and Towns, p.38; Democratic Politics-I, ELECTORAL POLITICS, p.54

7. Solving the Original PYQ (exam-level)

Now that you have mastered the Fundamental Principle of Counting and the concept of Complementary Events, you can see how they converge in this classic UPSC-style problem. When a question asks for "at least one" occurrence, it is a strategic signal to use the Subtraction Method rather than counting complex individual cases. By calculating the total possible sample space and subtracting the scenarios where the specific event never occurs, you simplify a potentially tedious counting task into a swift, two-step calculation.

Let's walk through the coaching logic: Since each die has 6 faces, the Total Outcomes for three dice are 6 × 6 × 6 = 216. To find the outcomes where at least one 2 appears, we first determine the scenarios where no 2 appears at all. If the number 2 is excluded, each die has only 5 valid faces (1, 3, 4, 5, and 6). Thus, the outcomes with No 2 are 5 × 5 × 5 = 125. Subtracting these from the total (216 − 125) gives us 91, which is the Correct Answer (C). This logic, as illustrated in Probability Dice - Portland State University, ensures you account for all variations where a 2 appears once, twice, or thrice simultaneously.

UPSC often includes trap options to catch common errors in reasoning. Option (A) 36 is a distractor for those who mistakenly calculate for only two dice or confuse the sum with the count. Options like (B) 81 usually stem from manual counting errors where students forget to account for the different positions the '2' can occupy across the three dice. The beauty of the Complementary Method is that it bypasses these manual counting traps entirely, keeping your accuracy high under exam pressure.