Advanced Concepts
The JEE-Advanced / NEET-hard concepts that separate top rankers — each a titled nugget with a real-world story, the idea in plain words, and a memory trick. Works even when the internet doesn't.
400 advanced concepts
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
A frequent error is counting forbidden arrangements without subtracting. In reality, gap and grouping methods handle 'together' or 'never together' conditions.
Memory trick: 'never together' = total minus together.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
Arranging n distinct items in a circle gives (n-1)! because rotations coincide.
Memory trick: circular arrangements: (n-1)!.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
A frequent error is using n! for a circular arrangement. In reality, arranging n distinct items in a circle gives (n-1)! because rotations coincide.
Memory trick: circular arrangements: (n-1)!.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
The expansion of (a+b)^n has coefficients from Pascal's triangle (the nCr values).
Memory trick: (a+b)^n has n+1 terms.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
A frequent error is miscounting the number of terms as n instead of n+1. In reality, the expansion of (a+b)^n has coefficients from Pascal's triangle (the nCr values).
Memory trick: (a+b)^n has n+1 terms.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
The (r+1)th term of a binomial expansion is nCr a^(n-r) b^r.
Memory trick: general term T_{r+1} = nCr a^(n-r) b^r.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
A frequent error is offsetting the term index wrongly. In reality, the (r+1)th term of a binomial expansion is nCr a^(n-r) b^r.
Memory trick: general term T_{r+1} = nCr a^(n-r) b^r.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
The coefficients are symmetric and their total is 2^n.
Memory trick: sum of nCr over r = 2^n.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
A frequent error is forgetting the sum of all coefficients is 2^n. In reality, the coefficients are symmetric and their total is 2^n.
Memory trick: sum of nCr over r = 2^n.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
Permutations of r from n. Use it when order matters.
nPr = n!/(n-r)!
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
Combinations of r from n. Use it when order irrelevant.
nCr = n!/(r!(n-r)!)
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
Arrangements around a circle. Use it when n distinct objects.
Circular permutations = (n-1)!
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
Binomial theorem. Use it when non-negative integer n.
(a+b)^n = sum nCr a^(n-r) b^r
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
Total of the nCr row. Use it when expansion of (1+1)^n.
Sum of binomial coefficients = 2^n
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
General term of the expansion. Use it when counting from r=0.
T_{r+1} = nCr a^(n-r) b^r
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
A permutation counts arrangements where order matters (nPr); a combination counts selections where order does not (nCr = nPr / r!).
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
N objects arrange in n! ways in a line but only (n-1)! ways in a circle, because a circle has no fixed starting point.
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
With repetition each position can reuse items (n^r); without repetition items are used once (nPr).
“A 4-digit PIN hides 10,000 possibilities — combinatorics protecting your account.”
It has n+1 terms, since r runs from 0 to n.
“GPS pinpoints you by solving triangles between satellites — trigonometry from space.”
The Pythagorean identities relate sin, cos and tan, underpinning all simplification.
Memory trick: sin^2 + cos^2 = 1; 1 + tan^2 = sec^2.
“GPS pinpoints you by solving triangles between satellites — trigonometry from space.”
A frequent error is misremembering 1 + tan^2 = sec^2. In reality, the Pythagorean identities relate sin, cos and tan, underpinning all simplification.
Memory trick: sin^2 + cos^2 = 1; 1 + tan^2 = sec^2.
“GPS pinpoints you by solving triangles between satellites — trigonometry from space.”
Sum, difference and double-angle formulas expand or contract angles.
Memory trick: sin(2x) = 2 sin x cos x, not 2 sin x.
“GPS pinpoints you by solving triangles between satellites — trigonometry from space.”
A frequent error is assuming sin(2x) = 2 sin x. In reality, sum, difference and double-angle formulas expand or contract angles.
Memory trick: sin(2x) = 2 sin x cos x, not 2 sin x.
“GPS pinpoints you by solving triangles between satellites — trigonometry from space.”
Trigonometric equations have infinitely many solutions written with an integer n.
Memory trick: add the general period (2n pi or n pi).