Counting, Probability and Number Properties
CSIR NET Part A: permutations, combinations, dice and coin probability, expected marks from guessing, divisors, HCF-LCM, unit digits and remainders.
- 14 min
On this page · 12 sections
Prerequisites
- Fractions and percentages from Percentages, Ratios, Averages and Mixtures: a probability is a fraction of outcomes.
- Powers and exponent rules from Speed, Time, Work and Growth.
- The diagonal formula used in Mensuration, Geometry and Quantitative Comparison is derived here.
The Hook: Why the Genetic Code Is Read in Triplets
Counting Principles
Multiplication principle: if one choice can be made in \( m \) ways and, for each of those, a second choice in \( n \) ways, the pair can be made in \( m \times n \) ways.
Addition principle: if a choice is either of type A (\( m \) ways) or of type B (\( n \) ways), with no overlap, there are \( m + n \) ways.
“And” multiplies; “or” adds.
Arrangements (order matters)
| Situation | Count |
|---|---|
| Arrange \( n \) distinct objects in a row | \( n! \) |
| Arrange \( r \) of \( n \) distinct objects | \( {}^nP_r = \frac{n!}{(n-r)!} \) |
| Strings of length \( r \) from \( n \) symbols, repetition allowed | \( n^r \) |
| \( n \) objects with \( p \) alike of one kind, \( q \) alike of another | \( \frac{n!}{p!\,q!} \) |
| \( n \) distinct objects round a table | \( (n - 1)! \) |
Selections (order does not matter)
$$\boxed{{}^nC_r = \binom{n}{r} = \frac{n!}{r!\,(n-r)!}} \qquad \boxed{\binom{n}{r} = \binom{n}{n-r}}$$Classic applications:
| Question | Count |
|---|---|
| Handshakes among \( n \) people | \( \binom{n}{2} = \frac{n(n-1)}{2} \) |
| Matches in a round-robin of \( n \) teams | \( \binom{n}{2} \) |
| Diagonals of an \( n \)-gon | \( \binom{n}{2} - n = \frac{n(n-3)}{2} \) |
| Triangles from \( n \) points, no three collinear | \( \binom{n}{3} \) |
| Subsets of an \( n \)-element set | \( 2^n \) |
10 people shaking hands once each: \( \binom{10}{2} = 45 \). A decagon has \( \frac{10 \times 7}{2} = 35 \) diagonals.
“At least” questions: count the complement
Probability
For equally likely outcomes,
$$\boxed{P(E) = \frac{\text{favourable outcomes}}{\text{total outcomes}}} \qquad \boxed{P(\text{not } E) = 1 - P(E)}$$Rules you will use
| Rule | Formula | When |
|---|---|---|
| Complement | \( P(\bar{E}) = 1 - P(E) \) | “at least one” questions |
| Addition | \( P(A \cup B) = P(A) + P(B) - P(A \cap B) \) | “A or B” |
| Mutually exclusive | \( P(A \cup B) = P(A) + P(B) \) | A and B cannot both happen |
| Independent events | \( P(A \cap B) = P(A)\,P(B) \) | one does not affect the other |
| Conditional | \( P(A \mid B) = \frac{P(A \cap B)}{P(B)} \) | “given that” |
Coins and dice
- \( n \) fair coins: \( 2^n \) equally likely outcomes. P(exactly \( k \) heads) \( = \binom{n}{k}/2^n \).
- Two dice: 36 equally likely ordered pairs. The sum 7 is the most likely (6 ways); sums 2 and 12 the least (1 way each).
| Sum of two dice | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Ways | 1 | 2 | 3 | 4 | 5 | 6 | 5 | 4 | 3 | 2 | 1 |
Expected value, and what it says about guessing in Part A
The expected value of a random score is the sum of (value × probability) over all outcomes.
Part A gives +2 for a correct answer and −0.5 for a wrong one (per the NTA bulletin for December 2026). For a four-option question with exactly one correct option:
| Your position | P(correct) | Expected marks |
|---|---|---|
| Pure guess among 4 | \( \frac{1}{4} \) | \( \frac{1}{4}(2) - \frac{3}{4}(0.5) = +0.125 \) |
| One option ruled out (guess among 3) | \( \frac{1}{3} \) | \( \frac{1}{3}(2) - \frac{2}{3}(0.5) = +0.333 \) |
| Two options ruled out (guess among 2) | \( \frac{1}{2} \) | \( \frac{1}{2}(2) - \frac{1}{2}(0.5) = +0.75 \) |
An informed guess has a positive expected value. But the bulletin also says that if you answer more than 15 Part A questions, only the first 15 answered are evaluated. A guess entered early can push a question you actually solved out of the count. So the arithmetic supports guessing only on a question that is genuinely one of your 15.
Number Properties
Divisibility rules
| Divisor | Test |
|---|---|
| 2, 5, 10 | last digit |
| 4 | last two digits divisible by 4 |
| 8 | last three digits divisible by 8 |
| 3, 9 | sum of digits divisible by 3 or 9 |
| 6 | divisible by both 2 and 3 |
| 11 | (sum of digits in odd places) − (sum in even places) is 0 or a multiple of 11 |
Example: 918,082 → odd-place digits (from the right) \( 2 + 0 + 1 = 3 \), even-place \( 8 + 8 + 9 = 25 \), difference 22, so divisible by 11.
Prime factorisation and divisors
If \( N = p^a q^b r^c \cdots \), then
$$\boxed{\text{number of positive divisors} = (a+1)(b+1)(c+1)\cdots}$$\( 360 = 2^3 \times 3^2 \times 5 \) has \( 4 \times 3 \times 2 = 24 \) divisors. A number has an odd number of divisors only if it is a perfect square.
HCF and LCM
- HCF: product of the common primes, each to its lowest power. LCM: all primes, each to its highest power.
- For two numbers, \( \text{HCF} \times \text{LCM} = \text{product of the numbers} \).
- For fractions in lowest terms: HCF of fractions = HCF of numerators ÷ LCM of denominators; LCM of fractions = LCM of numerators ÷ HCF of denominators.
“Leaves the same remainder” questions are LCM questions: a number that leaves remainder \( r \) when divided by each of \( a, b, c \) has the form \( k \cdot \text{LCM}(a, b, c) + r \).
Unit digits: cyclicity
The last digit of \( a^n \) depends only on the last digit of \( a \), and it repeats with period at most 4.
| Last digit | Cycle | Period |
|---|---|---|
| 0, 1, 5, 6 | stays the same | 1 |
| 4 | 4, 6 | 2 |
| 9 | 9, 1 | 2 |
| 2 | 2, 4, 8, 6 | 4 |
| 3 | 3, 9, 7, 1 | 4 |
| 7 | 7, 9, 3, 1 | 4 |
| 8 | 8, 4, 2, 6 | 4 |
Method: divide the exponent by 4 and use the remainder (a remainder of 0 means the 4th term of the cycle).
Remainders
Remainders can be multiplied and powered: if \( a \equiv r \pmod{m} \) then \( a^n \equiv r^n \pmod{m} \). Look for a power that gives remainder 1.
Example: \( 2^3 = 8 \equiv 1 \pmod 7 \), so \( 2^{100} = 2^{99} \cdot 2 = (2^3)^{33} \cdot 2 \equiv 2 \pmod 7 \).
Trailing zeros of a factorial
Each trailing zero needs a factor 10 = 2 × 5, and 5s are scarcer than 2s, so count the 5s:
$$\boxed{Z(n!) = \left\lfloor \frac{n}{5} \right\rfloor + \left\lfloor \frac{n}{25} \right\rfloor + \left\lfloor \frac{n}{125} \right\rfloor + \cdots}$$\( 100! \) ends in \( 20 + 4 = 24 \) zeros.
Sums worth knowing
| Sum | Value |
|---|---|
| \( 1 + 2 + \cdots + n \) | \( \frac{n(n+1)}{2} \) |
| \( 1 + 3 + 5 + \cdots \) (first \( n \) odd numbers) | \( n^2 \) |
| \( 1^2 + 2^2 + \cdots + n^2 \) | \( \frac{n(n+1)(2n+1)}{6} \) |
| \( 1^3 + 2^3 + \cdots + n^3 \) | \( \left(\frac{n(n+1)}{2}\right)^2 \) |
These come back in puzzle form: “how many squares on a chessboard” is \( 1^2 + 2^2 + \cdots + 8^2 = 204 \).
Memory Tricks
Don’t Confuse
| This | vs | That |
|---|---|---|
| Permutation: arrangements, order matters | Combination: selections, order irrelevant | |
| Mutually exclusive: cannot happen together, \( P(A \cap B) = 0 \) | Independent: \( P(A \cap B) = P(A)P(B) \) | |
| \( P(\text{at least one six in 4 throws}) \approx 0.518 \) | \( 4 \times \frac{1}{6} \approx 0.667 \) (wrong) | |
| HCF × LCM = product (two numbers only) | does not hold for three numbers in general | |
| Number of divisors: \( (a+1)(b+1)\cdots \) | number of prime factors: \( a + b + \cdots \) |
Common Mistakes
Practice
All questions below are original practice questions written for this page. They are not from any CSIR NET paper.
Level 1: Foundation
- Compute \( 5! \).
- Compute \( \binom{6}{2} \).
- A fair coin is tossed twice. What is the probability of two heads?
Answers
- 120. \( 5 \times 4 \times 3 \times 2 \times 1 \).
- 15. \( \frac{6 \times 5}{2} \).
- \( \frac{1}{4} \). \( \frac{1}{2} \times \frac{1}{2} \).
Level 2: Part A Style
Practice Q1. The number of distinct arrangements of the letters of the word LEVEL is:
(a) 20 (b) 30 (c) 60 (d) 120
Answer: (b) 30
5 letters with L twice and E twice: \( \frac{5!}{2!\,2!} = \frac{120}{4} = 30 \).
Option (c) divides by only one repeat; option (d) ignores both.
Practice Q2. Two fair dice are thrown. The probability that the sum is a prime number is:
(a) \( \frac{1}{3} \) (b) \( \frac{7}{18} \) (c) \( \frac{5}{12} \) (d) \( \frac{1}{2} \)
Answer: (c) 5/12
Prime sums: 2, 3, 5, 7, 11, with 1, 2, 4, 6 and 2 ways respectively. Total \( 15 \) of 36, so \( P = \frac{15}{36} = \frac{5}{12} \).
Practice Q3. The unit digit of \( 3^{47} \) is:
(a) 1 (b) 3 (c) 7 (d) 9
Answer: (c) 7
Cycle of 3: 3, 9, 7, 1. \( 47 = 4 \times 11 + 3 \), remainder 3, so the 3rd term: 7.
Practice Q4. How many positive divisors does 720 have?
(a) 24 (b) 28 (c) 30 (d) 32
Answer: (c) 30
\( 720 = 2^4 \times 3^2 \times 5 \). Divisors \( = (4+1)(2+1)(1+1) = 30 \).
Level 3: Multi-Step (Part C depth)
Practice Q5. In Part A (+2 for correct, −0.5 for wrong), a candidate faces three four-option questions. On each one she can rule out exactly one wrong option, and she guesses uniformly among the remaining three, independently. Consider the statements:
- Her expected net score from the three questions is +1 mark.
- The probability that her net score from the three is negative is \( \frac{8}{27} \).
- The probability that she gets all three right is \( \frac{1}{27} \).
- Without ruling out any option, a pure guess on a four-option question has a negative expected score.
Which are correct?
(a) 1 and 2 only (b) 1, 2 and 3 only (c) 2, 3 and 4 only (d) 1 and 4 only
Answer: (b) 1, 2 and 3 only
Each guess: +2 with probability \( \frac{1}{3} \), −0.5 with probability \( \frac{2}{3} \).
- Expected per question \( = \frac{2}{3} - \frac{1}{3} = \frac{1}{3} \); for three, +1. Correct.
- With \( k \) correct, score \( = 2k - 0.5(3 - k) = 2.5k - 1.5 \). This is negative only for \( k = 0 \): probability \( \left(\frac{2}{3}\right)^3 = \frac{8}{27} \). Correct.
- \( \left(\frac{1}{3}\right)^3 = \frac{1}{27} \). Correct.
- Pure guess: \( \frac{1}{4}(2) - \frac{3}{4}(0.5) = +0.125 \), positive. Wrong.
Remember the separate rule that only the first 15 answered Part A questions are evaluated; positive expected value does not justify answering a sixteenth.
Practice Q6. A 4-member panel is to be chosen from 6 physicists and 4 chemists, with at least 2 chemists. In how many ways can this be done?
(a) 90 (b) 115 (c) 120 (d) 185
Answer: (b) 115
- 2 chemists, 2 physicists: \( \binom{4}{2}\binom{6}{2} = 6 \times 15 = 90 \)
- 3 chemists, 1 physicist: \( \binom{4}{3}\binom{6}{1} = 4 \times 6 = 24 \)
- 4 chemists: \( \binom{4}{4} = 1 \)
Total \( = 115 \). Check by complement: \( \binom{10}{4} - \binom{6}{4} - \binom{4}{1}\binom{6}{3} = 210 - 15 - 80 = 115 \).
Option (a) counts only the “exactly 2” case.
Practice Q7. The smallest positive integer that leaves remainder 3 when divided by 4, 5 or 6, and is exactly divisible by 7, is:
(a) 63 (b) 123 (c) 183 (d) 243
Answer: (a) 63
Numbers leaving remainder 3 on division by 4, 5 and 6 are \( 60k + 3 \) (LCM 60). Try \( k = 0, 1, 2, \ldots \): 3 (not divisible by 7), 63 \( = 7 \times 9 \).
Check: \( 63 = 4 \times 15 + 3 = 5 \times 12 + 3 = 6 \times 10 + 3 \).
Practice Q8. How many trailing zeros does \( 250! \) have?
(a) 50 (b) 60 (c) 62 (d) 63
Answer: (c) 62
\( \left\lfloor \frac{250}{5} \right\rfloor + \left\lfloor \frac{250}{25} \right\rfloor + \left\lfloor \frac{250}{125} \right\rfloor = 50 + 10 + 2 = 62 \).
Option (a) stops at the first term; option (b) stops at the second.
Quick Revision Table
| Idea | Formula or fact |
|---|---|
| Arrangements with repeats | \( \frac{n!}{p!\,q!} \) |
| Circular arrangements | \( (n-1)! \) |
| Selections | \( \binom{n}{r} = \frac{n!}{r!(n-r)!} \) |
| Handshakes / diagonals | \( \frac{n(n-1)}{2} \) / \( \frac{n(n-3)}{2} \) |
| At least one | \( 1 - P(\text{none}) \) |
| Two dice | 36 outcomes; sum 7 has 6 ways |
| Guessing in Part A (4 options) | EV +0.125; one option eliminated +0.333 |
| Number of divisors | \( (a+1)(b+1)(c+1)\cdots \) |
| HCF × LCM | product of the two numbers |
| Unit digit cycles | 2, 3, 7, 8 period 4; 4, 9 period 2 |
| Trailing zeros of n! | \( \lfloor n/5 \rfloor + \lfloor n/25 \rfloor + \cdots \) |
| \( 1 + 2 + \cdots + n \) | \( \frac{n(n+1)}{2} \) |
Key Takeaways
What’s Next
- Numerical Ability: Quick Revision: the whole chapter on one page.
- Back to the chapter overview or the General Aptitude (Part A) overview.
- Mathematics and statistics candidates will meet probability properly in Mathematical Sciences.