Foundations — General term of binomial expansion — finding specific terms
Before you can read the parent note fluently, you need to own every symbol it fires at you. This page builds each one from absolute zero, in an order where each idea leans on the one before it. Nothing is assumed.
0. What a "term" and a "coefficient" even are
WHAT. A term is a single chunk in a sum that is separated by or signs. In there are three terms: , , and .
The picture. Look at the first figure: a sum is a train, and each term is one carriage. You can point at one carriage without touching the others.

A coefficient is the plain number multiplying the variable part of a term. In the coefficient is and the variable part is .
WHY the topic needs it. The whole parent topic is about grabbing one carriage from a very long train (the expansion) — either the carriage itself (a "specific term") or just the number painted on it (a "coefficient"). If those two words are fuzzy, the questions are unreadable.
1. Exponents (powers) — the little raised number
WHAT. means "multiply by itself times": . The raised number is the exponent (or power, or index); is the base.
The picture. is a stack of three identical factors of — a tower three blocks tall. The exponent is the height of the tower.
Two rules the parent uses constantly:
Negative and zero exponents — these show up in Examples 2 and 3:
WHY the topic needs it. In the two pieces are (power ) and (power ). The whole method — "collect the power, set it equal, solve" — is nothing but adding these exponents using the rules above. And "term independent of " literally means "the exponent equals ," which needs .
2. Factorials — the shrinking-product symbol
WHAT. (read " factorial") means "multiply all whole numbers from down to ":
The picture. In the second figure, is a staircase of factors that shrinks by one at each step until it hits .

One special value you must accept:
WHY the topic needs it. The binomial coefficient is built entirely out of factorials. Without (and the fact ) you cannot even write or .
See Factorials for a deeper build.
3. Combinations — "how many ways to choose from "
WHAT. (also written , read " choose ") counts the number of ways to pick objects out of when order does not matter.
The picture. In the third figure there are boxes in a row. You must shade exactly of them. Count all the distinct shading patterns — that count is . Which two boxes, not in what order.

Why the factorial formula? in the bottom divides out the orderings of the chosen boxes (we don't care about order), and divides out orderings of the ones left behind.
Edge cases you'll meet:
WHY the topic needs it. This is the number sitting in front of every term: counts how many of the brackets you took from. It is the heart of the general term. Build it up further in Combinations nCr and see its pattern in Binomial coefficients and Pascal's Triangle.
4. Sigma — the "add-them-all-up" symbol
WHAT. is shorthand for "plug , then , ... up to , and add every result."
The picture. is a machine with a counter: it starts the counter at the bottom number, runs the expression, bumps the counter, and stops after the top number — then totals everything.
WHY the topic needs it. The Binomial Theorem is written . Reading that line means knowing just gathers one general term for every from to . Each single term inside the sum is the object this whole topic hunts for.
5. Subscripts and the term-number twist:
WHAT. A subscript is a small label that names which item you mean. are the 1st, 2nd, 3rd terms. The subscript is just an index tag, not a multiplication.
The counting twist. The parent writes the general term as , not . Here is why, in one picture:
| (b's chosen) | ||||
|---|---|---|---|---|
| term number |
Because starts counting at , the very first term () is . So the term number is always one more than : term number .
WHY the topic needs it. Every "find the -th term" question is solved by setting . Get this offset wrong and every answer is one term off.
6. The two-piece bracket — naming the parts
WHAT. is a binomial ("bi" = two) raised to a power. The pieces:
- — the first entry (in Example 1, ),
- — the second entry (in Example 1, ),
- — the index, how many brackets are multiplied.
The picture. drawn out is identical copies of the same two-choice bracket standing in a row. Each bracket is a fork: go left to or right to .
WHY the topic needs it. Recognising which part is , which is , and what is — including their signs and coefficients — is step 1 of the universal method. Missing the sign in is exactly "Slip 3" on the parent page. The full statement lives in Binomial Theorem for positive integer index.
Recall Why do the powers always add to
? Each of the forks contributes exactly one factor. If of them are 's and the other are 's, then : every term carries a total of factors. That is your instant sanity check on any term.
How these feed the topic
Equipment checklist
Cover the right side and test yourself — you're ready when every line is instant.
What does equal?
What does equal?
What is , and why does it matter here?
Rewrite with a negative exponent.
Compute .
What is and why?
Write the formula for .
What does count, and does order matter?
Value of and ?
What does tell you to do?
Which value of gives the 5th term?
In , what are , , called?
For , write with sign separated.
Connections
- Yeh note Hinglish mein padho →
- Binomial Theorem for positive integer index
- Binomial coefficients and Pascal's Triangle
- Combinations nCr
- Factorials
- Middle term of a binomial expansion
- Greatest coefficient and greatest term