The Central Idea
A finite sum
\[ a_1+a_2+\cdots+a_n \]can be written compactly as
\[ \boxed{\sum_{i=1}^{n}a_i}. \]A finite product
\[ a_1a_2\cdots a_n \]can be written as
\[ \boxed{\prod_{i=1}^{n}a_i}. \]Why Compact Notation Matters
Long repeated expressions are difficult to read and easy to miscopy.
Instead of writing
\[ a_1+a_2+a_3+\cdots+a_{100}, \]we can write
\[ \sum_{i=1}^{100}a_i. \]The compact form makes the repeated structure visible.
Sigma Notation
The symbol
\[ \sum \]is the uppercase Greek letter sigma.
It indicates that a collection of terms should be added.
In
\[ \sum_{i=1}^{5}i, \]the index \(i\) begins at \(1\) and ends at \(5\).
Expanding a Finite Sum
Expand
\[ \sum_{i=1}^{5}i. \]Substitute
\[ i=1,2,3,4,5. \]Therefore,
\[ \sum_{i=1}^{5}i = 1+2+3+4+5 = \boxed{15}. \]The Index of Summation
In
\[ \sum_{i=1}^{n}a_i, \]the letter \(i\) is called the index of summation.
The lower value
\[ i=1 \]specifies where the index begins, and the upper value
\[ n \]specifies where it ends.
The Index Is a Placeholder
The choice of index letter is usually arbitrary.
For example,
\[ \sum_{i=1}^{n}a_i = \sum_{j=1}^{n}a_j. \]Changing the dummy index does not change the value of the sum.
Summing a Formula
The summand can depend on the index.
For example,
\[ \sum_{i=1}^{4}i^2 \]expands to
\[ 1^2+2^2+3^2+4^2. \]Therefore,
\[ \boxed{1+4+9+16=30}. \]Changing the Starting Index
A finite sum does not need to begin at \(1\).
For example,
\[ \sum_{k=3}^{7}k \]means
\[ 3+4+5+6+7. \]Thus,
\[ \boxed{\sum_{k=3}^{7}k=25}. \]Counting the Number of Terms
If an index runs through every integer from \(a\) to \(b\), inclusive, then the number of terms is
\[ \boxed{b-a+1}. \]For example, from \(3\) through \(7\) there are
\[ 7-3+1=5 \]terms.
A Constant Finite Sum
If the same constant \(c\) is added \(n\) times, then
\[ \sum_{i=1}^{n}c = \underbrace{c+c+\cdots+c}_{n\text{ terms}}. \]Therefore,
\[ \boxed{\sum_{i=1}^{n}c=nc}. \]Linearity of Finite Sums
Constants can be factored out of finite sums:
\[ \boxed{ \sum_{i=1}^{n}ca_i = c\sum_{i=1}^{n}a_i }. \]Finite sums also distribute over addition:
\[ \boxed{ \sum_{i=1}^{n}(a_i+b_i) = \sum_{i=1}^{n}a_i + \sum_{i=1}^{n}b_i }. \]Splitting a Finite Sum
A sum can be divided at an intermediate index.
If \(m
This reflects counting by cases across index ranges.
Example: Splitting a Sum
Consider
\[ \sum_{i=1}^{8}i. \]Split after \(4\):
\[ \sum_{i=1}^{8}i = \sum_{i=1}^{4}i + \sum_{i=5}^{8}i. \]Thus,
\[ 36=10+26. \]Finite Sums in Counting by Cases
Suppose a counting problem is divided into cases indexed by
\[ i=1,2,\ldots,n. \]If case \(i\) contains \(a_i\) outcomes, then the total is
\[ \boxed{\sum_{i=1}^{n}a_i}. \]Sigma notation is therefore a compact form of the sum principle.
Example: Counting by Largest Element
The number of \(k\)-element subsets of
\[ \{1,2,\ldots,n\} \]can be counted by the largest element.
If the largest element is \(j\), then there are
\[ \binom{j-1}{k-1} \]possibilities.
Therefore,
\[ \boxed{ \binom{n}{k} = \sum_{j=k}^{n}\binom{j-1}{k-1} }. \]Product Notation
The symbol
\[ \prod \]is the uppercase Greek letter pi.
It indicates repeated multiplication.
In
\[ \prod_{i=1}^{4}i, \]multiply the values \(1,2,3,4\).
Expanding a Finite Product
Expand
\[ \prod_{i=1}^{4}i. \]This gives
\[ 1\cdot2\cdot3\cdot4 = \boxed{24}. \]Finite Products and Sequential Choices
Suppose a process has \(n\) stages, and stage \(i\) has \(c_i\) available choices.
If every combination of stage choices produces a distinct valid outcome, then the product principle gives
\[ \boxed{ \prod_{i=1}^{n}c_i }. \]Product notation is therefore a compact form of the multiplication principle.
Example: Changing Stage Counts
Suppose four sequential stages have
\[ 8,\qquad7,\qquad6,\qquad5 \]choices.
The total number of outcomes is
\[ 8\cdot7\cdot6\cdot5. \]This can be written
\[ \boxed{ \prod_{i=5}^{8}i }. \]Factorials as Finite Products
For a positive integer \(n\),
\[ n! = n(n-1)(n-2)\cdots2\cdot1. \]In product notation,
\[ \boxed{ n!=\prod_{i=1}^{n}i }. \]Factorials will become central in permutation and combination formulas.
Descending Products
A no-repetition count such as
\[ n(n-1)(n-2)\cdots(n-k+1) \]can be expressed as
\[ \boxed{ \prod_{j=0}^{k-1}(n-j) }. \]This compactly records \(k\) successive decreasing factors.
Constant Finite Products
If the same constant \(c\) is multiplied \(n\) times, then
\[ \prod_{i=1}^{n}c = \underbrace{c\cdot c\cdots c}_{n\text{ factors}}. \]Therefore,
\[ \boxed{\prod_{i=1}^{n}c=c^n}. \]Splitting a Finite Product
Products can also be split across index ranges.
If \(m
Products of Products
Suppose
\[ a_i=b_ic_i. \]Then
\[ \prod_{i=1}^{n}a_i = \prod_{i=1}^{n}(b_ic_i). \]Since multiplication is commutative,
\[ \boxed{ \prod_{i=1}^{n}(b_ic_i) = \left(\prod_{i=1}^{n}b_i\right) \left(\prod_{i=1}^{n}c_i\right) }. \]Sums and Products Behave Differently
Finite sums and products look similar symbolically, but their algebraic properties differ.
For example,
\[ \sum_{i=1}^{n}ca_i = c\sum_{i=1}^{n}a_i, \]but
\[ \prod_{i=1}^{n}ca_i = c^n\prod_{i=1}^{n}a_i. \]The constant \(c\) appears once in each factor.
Empty Sums
A finite sum over no terms is defined to be
\[ \boxed{0}. \]This convention is natural because \(0\) is the additive identity.
It allows formulas to remain valid at boundary cases.
Empty Products
A finite product over no factors is defined to be
\[ \boxed{1}. \]This convention is natural because \(1\) is the multiplicative identity.
It is also why
\[ 0!=1 \]fits naturally with factorial product notation.
Why the Empty Product Matters in Counting
A zero-stage process has one possible completed outcome:
make no choices.
Therefore,
\[ \prod_{\text{no stages}}(\text{choices}) = 1. \]This matches the combinatorial interpretation of an empty configuration.
Index Shifts
A sum can often be rewritten by changing the index.
For example,
\[ \sum_{i=1}^{n}a_i \]can be rewritten using \(j=i-1\):
\[ \boxed{ \sum_{j=0}^{n-1}a_{j+1} }. \]The terms are the same; only their labels change.
Checking an Index Shift
When changing indices, verify:
- the new starting value;
- the new ending value;
- the transformed summand or factor.
The expanded terms should remain unchanged.
Example: Reindexing a Sum
Consider
\[ \sum_{i=1}^{4}(i+2). \]Expanding gives
\[ 3+4+5+6. \]Let
\[ j=i+2. \]Then \(j\) runs from \(3\) through \(6\), so
\[ \boxed{ \sum_{i=1}^{4}(i+2) = \sum_{j=3}^{6}j }. \]Finite Geometric Sums
A common finite sum has the form
\[ 1+r+r^2+\cdots+r^{n-1}. \]In sigma notation,
\[ \sum_{i=0}^{n-1}r^i. \]For \(r\neq1\),
\[ \boxed{ \sum_{i=0}^{n-1}r^i = \frac{1-r^n}{1-r} }. \]Example: A Binary Geometric Sum
Consider
\[ 1+2+4+8+16. \]This is
\[ \sum_{i=0}^{4}2^i. \]Therefore,
\[ \boxed{ \sum_{i=0}^{4}2^i = \frac{1-2^5}{1-2} = 31 }. \]Finite Arithmetic Sums
The sum
\[ 1+2+\cdots+n \]can be written
\[ \sum_{i=1}^{n}i. \]Its closed form is
\[ \boxed{ \sum_{i=1}^{n}i = \frac{n(n+1)}{2} }. \]Counting Pairs with a Finite Sum
Suppose we count ordered pairs
\[ (i,j) \]satisfying
\[ 1\le j\le i\le n. \]For each \(i\), there are \(i\) choices for \(j\).
Therefore, the total number of pairs is
\[ \sum_{i=1}^{n}i = \boxed{\frac{n(n+1)}{2}}. \]Double Sums
Some finite counts require two indices.
For example,
\[ \sum_{i=1}^{m}\sum_{j=1}^{n}a_{ij} \]means:
- for each fixed \(i\), sum over \(j\);
- then add the resulting totals over \(i\).
Example: Counting Table Entries
An \(m\times n\) table contains
\[ mn \]cells.
We can express this as
\[ \sum_{i=1}^{m}\sum_{j=1}^{n}1. \]Since the inner sum contributes \(n\) for each of \(m\) rows,
\[ \boxed{ \sum_{i=1}^{m}\sum_{j=1}^{n}1=mn }. \]Nested Products
Multiple-index products can describe choices made across grids, arrays, or several nested stages.
For example,
\[ \prod_{i=1}^{m}\prod_{j=1}^{n}c_{ij} \]multiplies one factor for every ordered pair \((i,j)\) in the index range.
Sums of Products
Many counting formulas naturally combine the two notations.
If case \(i\) contains a multi-stage process with stage counts
\[ c_{i1},c_{i2},\ldots,c_{ik_i}, \]then the total count may have the form
\[ \boxed{ \sum_i\prod_j c_{ij} }. \]This compactly expresses “multiply within cases, add across cases.”
Products of Sums
Conversely, a multi-stage process may allow several alternatives at each stage.
If stage \(i\) has a total number of choices given by a sum \(s_i\), then the complete count may be
\[ \boxed{ \prod_i s_i }. \]The notation reflects the logical structure of the choices.
Finite Sums in Recursive Counting
A recurrence may accumulate contributions from several earlier states.
For example,
\[ a_n = a_{n-1}+a_{n-2}+\cdots+a_{n-k} \]can be written as
\[ \boxed{ a_n=\sum_{j=1}^{k}a_{n-j} }. \]Finite Products in Restricted Counting
A no-repetition process with \(k\) positions chosen from \(n\) objects has
\[ n(n-1)\cdots(n-k+1) \]outcomes.
Product notation compresses this as
\[ \boxed{ \prod_{j=0}^{k-1}(n-j) }. \]Common Error: Off-by-One Indexing
In
\[ \sum_{i=3}^{7}a_i, \]there are
\[ 7-3+1=5 \]terms.
Forgetting the \(+1\) is a common indexing error.
Common Error: Changing the Index but Not the Bounds
If
\[ j=i+2, \]then the lower and upper limits must also be shifted.
Reindexing only the summand produces the wrong set of terms.
Common Error: Treating a Product Like a Sum
In general,
\[ \prod_{i=1}^{n}(a_i+b_i) \]is not equal to
\[ \prod_{i=1}^{n}a_i + \prod_{i=1}^{n}b_i. \]Products do not distribute over addition in that way.
Common Error: Pulling a Constant from a Product Incorrectly
In a sum,
\[ \sum_{i=1}^{n}ca_i = c\sum_{i=1}^{n}a_i. \]But in a product,
\[ \prod_{i=1}^{n}ca_i = c^n\prod_{i=1}^{n}a_i. \]The constant appears in every factor.
Common Error: Ignoring Empty Cases
Boundary values often produce empty sums or empty products.
Remember:
\[ \boxed{\text{empty sum}=0} \]and
\[ \boxed{\text{empty product}=1}. \]A Reliable Procedure for Finite Sums
- Identify the index variable.
- Identify the starting index.
- Identify the ending index.
- Write the summand clearly.
- Expand a few terms to verify the pattern.
- Use algebraic sum rules when simplifying.
- Check the number of terms with \(b-a+1\) when needed.
A Reliable Procedure for Finite Products
- Identify the index variable.
- Identify the starting and ending indices.
- Write the factor determined by each index value.
- Expand several factors to verify the pattern.
- Use factorial notation when appropriate.
- Track repeated constants as powers.
- Remember that an empty product equals \(1\).
Example: Full Sum Workflow
Evaluate
\[ \sum_{i=2}^{6}(2i+1). \]Expand:
\[ (2\cdot2+1) +(2\cdot3+1) +(2\cdot4+1) +(2\cdot5+1) +(2\cdot6+1). \]This gives
\[ 5+7+9+11+13. \]Therefore,
\[ \boxed{45}. \]Example: Full Product Workflow
Evaluate
\[ \prod_{j=1}^{4}(j+1). \]Expand:
\[ (1+1)(2+1)(3+1)(4+1). \]Thus,
\[ 2\cdot3\cdot4\cdot5. \]Therefore,
\[ \boxed{120}. \]Practice 1: Expand a Sum
Expand and evaluate
\[ \sum_{i=1}^{4}(i+2). \]Practice 2: Expand a Product
Expand and evaluate
\[ \prod_{i=2}^{5}i. \]Practice 3: Count the Terms
How many terms appear in
\[ \sum_{k=7}^{15}a_k? \]Practice 4: Constant Sum
Simplify
\[ \sum_{i=1}^{12}5. \]Practice 5: Constant Product
Simplify
\[ \prod_{i=1}^{6}3. \]Practice 6: Factorial Form
Rewrite
\[ \prod_{i=1}^{8}i \]using factorial notation.
Practice 7: Reindexing
Rewrite
\[ \sum_{i=1}^{5}(i+3) \]using the new index
\[ j=i+3. \]Practice 8: Arithmetic Sum
Evaluate
\[ \sum_{i=1}^{20}i. \]Practice 9: Geometric Sum
Evaluate
\[ \sum_{i=0}^{5}2^i. \]Practice 10: Identify the Error
A student writes
\[ \prod_{i=1}^{4}(2a_i) = 2\prod_{i=1}^{4}a_i. \]Explain the error.
Practice Answers
Practice 1
\[ (1+2)+(2+2)+(3+2)+(4+2) = 3+4+5+6. \]Therefore,
\[ \boxed{18}. \]Practice 2
\[ 2\cdot3\cdot4\cdot5 = \boxed{120}. \]Practice 3
\[ 15-7+1=9. \]Therefore,
\[ \boxed{9} \]terms appear.
Practice 4
\[ \boxed{12\cdot5=60}. \]Practice 5
\[ \boxed{3^6=729}. \]Practice 6
\[ \boxed{8!}. \]Practice 7
Since \(j=i+3\), the index runs from \(4\) through \(8\):
\[ \boxed{ \sum_{i=1}^{5}(i+3) = \sum_{j=4}^{8}j }. \]Practice 8
\[ \sum_{i=1}^{20}i = \frac{20\cdot21}{2} = \boxed{210}. \]Practice 9
\[ 1+2+4+8+16+32 = \boxed{63}. \]Practice 10
The factor \(2\) appears once for each of the four product terms:
\[ \prod_{i=1}^{4}(2a_i) = 2^4\prod_{i=1}^{4}a_i. \]Therefore,
\[ \boxed{ \prod_{i=1}^{4}(2a_i) = 16\prod_{i=1}^{4}a_i }. \]What to Remember
Sigma notation compresses repeated addition:
\[ \boxed{ \sum_{i=a}^{b}a_i }. \]Product notation compresses repeated multiplication:
\[ \boxed{ \prod_{i=a}^{b}a_i }. \]- Expand a few terms whenever the indexing is unclear.
- An inclusive index range from \(a\) to \(b\) contains \(b-a+1\) terms.
- Finite sums encode repeated use of the sum principle.
- Finite products encode repeated use of the product principle.
- Factorials are special finite products.
- Empty sums equal \(0\).
- Empty products equal \(1\).
- Reindexing changes labels, not the underlying terms.
- Sums of products often represent “multiply within cases, add across cases.”
Where We Go Next
Finite sums and products provide compact notation for the counting methods developed throughout this unit. They let us express long case totals, sequential products, recurrence expansions, and combinatorial identities in a uniform symbolic language.
With these tools in place, the fundamental counting principles can be used as a foundation for more specialized topics such as permutations, combinations, arrangements, selections, and partitions.