The Logic Puzzle of JEE Mathematics
Most of JEE Mathematics is computational—solve the equation, draw the graph, evaluate the integral. Permutations & Combinations (P&C) and Probability are different. They require minimal computation but intense logical clarity.
You can write down the correct answer in 20 seconds, or you can spend 10 minutes filling a page with nCr formulas and still arrive at the wrong answer because you counted one specific scenario twice.
These chapters are deeply interconnected. Probability is essentially: (Favorable P&C cases) / (Total P&C cases). If your P&C is weak, your Probability will inevitably fail.
Part 1: Permutations & Combinations
The core of P&C is understanding exactly when to multiply and when to add.
The Fundamental Principles of Counting:
- Addition Principle (OR task): If a task can be done in m ways, AND another task can be done in n ways, and they are mutually exclusive, then either of the tasks can be done in m + n ways.
- Multiplication Principle (AND task): If a task is a sequence of steps, and step 1 can be done in m ways, and step 2 can be done in n ways, the total task can be done in m × n ways.
Identifying the Action: Arrange vs Select
1. Combinations (Selection): Order does NOT matter.
- Formula: nCr = n! / [r! * (n-r)!]
- Choosing a committee of 3 students from a class of 10. (Choosing RAM, SHYAM, RAHUL is the same as choosing RAHUL, SHYAM, RAM).
2. Permutations (Arrangement): Order DOES matter.
- Formula: nPr = n! / (n-r)! (Which is simply nCr × r!)
- Arranging 3 students in a line for a photograph.
High-Yield P&C Profiles
A. Gap Method (Ensuring objects are NEVER together): "Arrange 4 boys and 3 girls in a row such that no two girls sit together." Strategy: Seat the boys first. 4 boys can be seated in 4! ways. This creates 5 gaps between and around the boys (_ B _ B _ B _ B _). Select 3 gaps out of 5 for the girls (5C3), and arrange the girls in those gaps (3!). Total = 4! × 5C3 × 3!
B. Tie Method / String Method (Ensuring objects are ALWAYS together): "Arrange 4 boys and 3 girls such that all girls sit together." Strategy: Tie the 3 girls together with a string. Treat them as 1 "super-unit". Now you are arranging 4 boys + 1 super-unit = 5 units. This takes 5! ways. Finally, the girls can swap seats within the string in 3! ways. Total = 5! × 3!
C. Beggar Method / Stars and Bars (Distribution of Identical Objects): "Number of ways to distribute 10 identical chocolates among 3 children such that a child can receive zero chocolates." Strategy: Formula is (n + r - 1) C (r - 1). Where n = objects (10), r = recipients (3). *Total = (10 + 3 - 1) C (3 - 1) = 12C2. (If each child MUST get at least one, modify the formula or give them each 1 chocolate first, leaving n-r objects to distribute).
Part 2: Probability
Once P&C is clear, Probability is about categorizing the events.
Basic Formula: P(E) = n(E) / n(S) Odds in favor: n(E) / n(E')
Conditional Probability
The probability of an event happening GIVEN that another event has already occurred. This reduces your Sample Space. P(A | B) = P(A ∩ B) / P(B)
Independent Events
The occurrence of A does not affect B. (e.g., throwing a coin and rolling a die). Condition: P(A ∩ B) = P(A) × P(B). Trap: Do not confuse Mutually Exclusive (P(A ∩ B) = 0) with Independent.
Total Probability Theorem and Bayes' Theorem
This is the holy grail of JEE Advanced Probability.
The Setup: You have multiple mutually exclusive paths (E₁, E₂, E₃...) that cause an ultimate Event (A).
-
Total Probability: "What is the probability of picking a defective bulb?" (It could come from Factory 1, or 2, or 3). P(A) = P(E₁)P(A|E₁) + P(E₂)P(A|E₂) + ...
-
Bayes' Theorem (Reverse Probability): The event has already occurred. What is the probability it came from a specific path? "Given the bulb is defective, what is the probability it came from Factory 2?" P(E₂ | A) = [ P(E₂) × P(A|E₂) ] / [ Total Probability P(A) ]
Strategy: Never try to memorize the Bayes formula. Draw a probability tree diagram. Let the branches represent the factories, and sub-branches represent defective/non-defective rates. Multiply along the branches to find specific path probabilities.
Binomial Distribution
Used for repeated, independent trials with only two outcomes (Success/Failure). "Probability of getting exactly r heads in n coin tosses." P(X = r) = nCr * (p)^r * (q)^(n-r) (Where p = prob of success, q = prob of failure = 1-p).
Preparation Strategy
- Venn Diagrams: For set-based probability questions involving unions and intersections, draw a Venn diagram immediately. It turns complex algebra into simple arithmetic.
- Read Carefully: In P&C, a single word changes the whole problem. Are the balls "identical" or "distinct"? Does the box matter? Slow down and read the premise twice before calculating.