How do I start a P&C question without guessing a formula?
If you understand a worked solution but cannot start a new question, practise constructing the counting model, not recalling more formulas. Study permutations and combinations for JEE by defining one outcome, choosing a counting route, and checking that every valid outcome is counted exactly once.
Use these six steps before doing arithmetic.
- Define one final outcome in a sentence. State whether you are counting a committee, an ordered digit string, or an allocation to labelled boxes. Describe one complete outcome, not an intermediate choice used to build it.
- Identify what is distinct and whether order matters. Swapping two people changes an ordered arrangement but not a committee. Identical balls have no individual identities, but labelled boxes do. Do not confuse the objects being distributed with their destinations.
- Translate every restriction. Record repetition allowed or forbidden, whether zero can lead, “at least” versus “exactly”, adjacency conditions, and lower or upper bounds. Translate each into a condition on your outcome, not a vague reminder.
- Choose a counting route. Multiply successive choices, add disjoint cases, subtract forbidden outcomes from a clearly defined total, or use blocks, gaps or allocation variables. Restrictions should decide your route, not the first familiar word in the question.
- Attach a meaning to every factor. Use the first expression below for selection and the second for ordered selection of distinct objects without repetition:
A question containing “choose” or “arrange” does not settle which one applies.
- Audit coverage and multiplicity. Check that every valid outcome is included exactly once. Division by the following factor is justified only when every final outcome has exactly that many representations:
Choice sets can depend on earlier choices. A fixed product works only if its successive counts remain valid along every branch. If choosing zero changes the number of permitted first digits, split cases rather than forcing one product.
Use this answer-writing scaffold throughout:
Outcome → restrictions → counting route → expression → audit
For a sanity check, shrink the problem until you can list every outcome by hand. For example, list two-person committees from three named people. Compare your model with that list: this tests whether you counted the right objects, not merely whether you multiplied correctly.
How do I count committees with “at least” conditions?
Count disjoint cases by the number of women, or subtract committees that fail the minimum. Prefer the route with fewer, simpler cases: compare valid cases with forbidden cases before calculating. All three worked examples below are original teaching problems, not previous-year JEE questions.
Problem: Form a five-person committee from five distinct men and four distinct women, with at least two women.
Outcome: An unordered set of five people. No committee roles are assigned.
Restrictions: Members are distinct; the committee contains two, three or four women.
Counting route and expression, direct cases: Each product selects the women and then the men needed to complete five members.
Alternative route, complement: Start with all five-person committees. Subtract those with zero women and those with exactly one.
Audit: A committee has exactly one number of women, so the direct cases cannot overlap. Two, three and four women exhaust the valid possibilities.
Wrong turn: Choosing two women first, then any three remaining people, overcounts committees with more than two women. The initially designated pair is not part of the final outcome. A committee containing three women can be generated through three different initial pairs.
How do I count even numbers when zero is allowed?
Fix the last digit first because it controls parity, but separate zero from the other even digits. A zero at the end leaves all remaining digits eligible for the first position. A nonzero even digit at the end leaves zero available, so the first-position count changes.
Original teaching problem: How many five-digit even numbers can be formed from the digits zero through six without repetition?
Outcome: An ordered five-digit string.
Restrictions: The first digit is nonzero, the last digit is even, and no digit repeats.
Counting route and expression:
- Last digit zero: Fill the first four positions using distinct nonzero digits.
- Last digit two, four or six: There are three last-digit choices, five nonzero first-digit choices, and five unused digits for the middle positions.
Total:
Wrong turn: The following product permits leading zero when the last digit is nonzero:
Cross-check by subtraction: invalid strings start with zero, end with one of three nonzero even digits, and have three ordered middle digits.
Audit: The two last-digit cases are disjoint and cover every permitted even ending. Each digit string has one construction within its case.
For short topic sets, JEEnius daily practice problems provide a fresh ten-question set every day, with free sets daily. Write the counting route before evaluating any expression.
How do I distribute identical objects when every box has a limit?
Translate the allocation into variables, remove the lower bounds, then subtract upper-bound violations. Stars and bars counts nonnegative solutions; it does not enforce a capacity limit. Here, subtracting single-box violations is enough because two boxes cannot violate their limits together.
Original teaching problem: Distribute ten identical balls among four labelled boxes, each receiving at least one and at most four.
Outcome and restrictions: One outcome is the allocation vector
Exchanging allocations between labelled boxes can change the outcome.
Counting route: Put one ball in each box first. Count the remaining allocation using
Ignoring upper bounds temporarily, represent the six remaining balls by stars and separate the four boxes using three bars. Choosing three separator positions among nine positions allows empty groups, including adjacent separators.

Expression: The unrestricted count is
A specified box violates its upper bound when its remaining allocation is at least four. Subtract four from that variable, leaving a nonnegative sum of two across four variables:
There are four choices of violating box.
Audit: Two violations would require at least eight units, but only six remain. No intersections need adding back, so
Wrong turns: Stars and bars alone ignores capacity. Dividing by the factorial of four is invalid because the boxes are labelled.
When two violations can coexist, simple subtraction removes their intersection twice. Inclusion–exclusion must correct that overlap.
What should I practise next, and how do I know I am ready?
Progress by counting structure, then mix questions without method labels. Use explanation as your readiness test: justify every factor and prove complete, non-overlapping coverage. Recognising a solution is not enough; you must choose and defend the route independently.
Check factorial manipulation, addition and multiplication principles, and the meanings of ordered selection and unordered selection:
Probability is not a prerequisite. Use this study order:
- Basic selections and arrangements.
- Restricted digits and positions.
- Repeated objects and block/gap methods.
- Identical-object distributions.
- Mixed restrictions and inclusion–exclusion.
For each structure, study one worked model, close it, reconstruct the reasoning, then solve a changed version. Begin with short single-structure sets. Move to unlabelled mixed sets once you can explain why your route works.
Change one condition in each example before calculating:
- Add committee roles: identify where order enters.
- Allow digit repetition: identify which position counts change.
- Change box capacity: check whether violations can overlap.
Keep an error log with four categories:
- Outcome misdefined.
- Restriction missed.
- Cases overlapping or incomplete.
- Arithmetic error.
Record the first incorrect modelling decision, not the entire solution. Attempt relevant JEE Main PYQs, then JEE Advanced PYQs as structures become secure; verify the paper source before treating a question as a PYQ.
During revision, redo logged mistakes without solutions. Retain only formulas whose assumptions you can state.
For unseen practice, JEEnius practice mode offers topic sets that skip questions already seen, with free sets included. Keep a separate redo list for old mistakes: new questions test transfer, while redoing mistakes checks whether your original modelling error is fixed.
Next step: practice mode on JEEnius and practise a topic in sets that skip questions you have already seen (free sets included).
Related on JEEnius: Oscillations Practice Questions JEE: 6 Solved Drills.
Frequently asked questions
How do I start a permutations and combinations question?
Define one complete outcome, identify what is distinct and decide whether order matters. Translate every restriction before choosing a counting route. Write the expression only after you can explain every factor, then check that every valid outcome is counted exactly once.
In what order should I study permutations and combinations for JEE?
First check factorial manipulation, addition and multiplication principles, and ordered versus unordered selection. Study basic selections and arrangements, restricted digits and positions, repeated objects and block/gap methods, identical-object distributions, then mixed restrictions and inclusion–exclusion. Move to unlabelled mixed sets once you can independently explain why your counting route works.
How do I count even numbers when zero is allowed?
For numbers formed without repetition, fix the last digit first and separate a zero ending from nonzero even endings. A zero ending leaves only nonzero digits for the first position, while a nonzero even ending leaves zero available but forbidden at the start. Count these disjoint cases separately and add them.
Can I use stars and bars when every box has a maximum capacity?
Stars and bars alone does not enforce upper bounds. For identical objects in labelled boxes, first remove lower bounds, count the resulting nonnegative solutions and subtract upper-bound violations. If multiple boxes can violate their limits together, use inclusion–exclusion to correct the overlap.