\(\sum_{k=1}^{5} (2k + 3)\)
Sigma notation: \(\sum_{i=m}^{n} f(i) = f(m) + f(m+1) + f(m+2) + \cdots + f(n)\)
Components: \(\sum\) (sigma symbol), \(i\) (index variable), \(m\) (lower limit), \(n\) (upper limit), \(f(i)\) (summand)
Evaluation: Substitute each value of the index and add all terms
- Identify the index variable, limits, and summand
- Substitute each value of the index into the summand
- Calculate each term individually
- Add all calculated terms together
Index variable: \(k\), Lower limit: 1, Upper limit: 5, Summand: \(2k + 3\)
For \(k = 1\): \(2(1) + 3 = 5\)
For \(k = 2\): \(2(2) + 3 = 7\)
For \(k = 3\): \(2(3) + 3 = 9\)
For \(k = 4\): \(2(4) + 3 = 11\)
For \(k = 5\): \(2(5) + 3 = 13\)
Sum = \(5 + 7 + 9 + 11 + 13 = 45\)
We can also use the distributive property: \(\sum_{k=1}^{5} (2k + 3) = 2\sum_{k=1}^{5} k + \sum_{k=1}^{5} 3 = 2(15) + 15 = 45\)
\(\sum_{k=1}^{5} (2k + 3) = 45\)
• Sigma notation definition: Replace index with each value in range and sum
• Distributive property: \(\sum (a_i + b_i) = \sum a_i + \sum b_i\)
• Constant multiplication: \(\sum c \cdot a_i = c \sum a_i\)
\(\sum_{i=1}^{10} (3i^2 - 2i + 1)\)
Sigma properties: Linearity allows us to split and factor constants
\(\sum_{i=m}^{n} (a_i + b_i) = \sum_{i=m}^{n} a_i + \sum_{i=m}^{n} b_i\)
\(\sum_{i=m}^{n} c \cdot a_i = c \sum_{i=m}^{n} a_i\)
Standard formulas: \(\sum_{i=1}^{n} i = \frac{n(n+1)}{2}\), \(\sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}\), \(\sum_{i=1}^{n} c = cn\)
\(\sum_{i=1}^{10} (3i^2 - 2i + 1) = 3\sum_{i=1}^{10} i^2 - 2\sum_{i=1}^{10} i + \sum_{i=1}^{10} 1\)
\(\sum_{i=1}^{10} i^2 = \frac{10(11)(21)}{6} = \frac{2310}{6} = 385\)
\(\sum_{i=1}^{10} i = \frac{10(11)}{2} = \frac{110}{2} = 55\)
\(\sum_{i=1}^{10} 1 = 10 \times 1 = 10\)
\(3\sum_{i=1}^{10} i^2 = 3 \times 385 = 1155\)
\(2\sum_{i=1}^{10} i = 2 \times 55 = 110\)
\(\sum_{i=1}^{10} 1 = 10\)
Sum = \(1155 - 110 + 10 = 1055\)
\(\sum_{i=1}^{10} (3i^2 - 2i + 1) = 1055\)
• Linearity: Split sums and factor constants
• Power sum formulas: Use established formulas for \(\sum i\), \(\sum i^2\), etc.
• Arithmetic: Careful computation with large numbers
\(\sum_{k=3}^{7} (k^2 + 2k)\)
Index shifting: Change the index variable while preserving the sum value
Substitution method: Let \(j = k - c\) where \(c\) shifts the starting point
Range adjustment: When \(k\) goes from \(a\) to \(b\), new index \(j = k - c\) goes from \(a-c\) to \(b-c\)
To shift from \(k=3\) to \(j=0\), let \(j = k - 3\), so \(k = j + 3\)
When \(k = 3\), \(j = 3 - 3 = 0\)
When \(k = 7\), \(j = 7 - 3 = 4\)
So the new sum goes from \(j = 0\) to \(j = 4\)
Replace \(k\) with \(j + 3\): \((k^2 + 2k) = ((j+3)^2 + 2(j+3))\)
Expand: \((j+3)^2 + 2(j+3) = j^2 + 6j + 9 + 2j + 6 = j^2 + 8j + 15\)
\(\sum_{k=3}^{7} (k^2 + 2k) = \sum_{j=0}^{4} (j^2 + 8j + 15)\)
Original: \(k=3\) gives \(9+6=15\), \(k=4\) gives \(16+8=24\), etc.
New: \(j=0\) gives \(0+0+15=15\), \(j=1\) gives \(1+8+15=24\), etc.
Both representations yield the same terms
\(\sum_{k=3}^{7} (k^2 + 2k) = \sum_{j=0}^{4} (j^2 + 8j + 15)\)
• Substitution: Replace index with equivalent expression
• Range adjustment: Transform both limits accordingly
• Algebraic expansion: Expand substituted expressions
Sigma notation: A compact way to represent sums using the Greek letter \(\sum\) (capital sigma)
Index variable: The variable that takes on integer values from lower to upper limit
Summand: The expression being summed (the function of the index variable)
Lower limit: Starting value of the index variable
Upper limit: Ending value of the index variable
- Identify components: Recognize the index, limits, and summand
- Choose approach: Direct evaluation vs. using properties/formulas
- Apply transformations: Use linearity, index shifting, or other properties
- Compute: Evaluate using appropriate techniques
• \(\sum_{i=1}^{n} c = cn\) (constant sum)
• \(\sum_{i=1}^{n} i = \frac{n(n+1)}{2}\) (sum of first n integers)
• \(\sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}\) (sum of squares)
• \(\sum_{i=1}^{n} i^3 = \left[\frac{n(n+1)}{2}\right]^2\) (sum of cubes)
• \(\sum_{i=m}^{n} a_i = \sum_{i=1}^{n} a_i - \sum_{i=1}^{m-1} a_i\) (splitting sums)
\(\sum_{n=1}^{10} \left(\frac{1}{n} - \frac{1}{n+1}\right)\)
Telescoping sum: A sum where consecutive terms cancel each other out
Pattern: Terms of the form \(a_n - a_{n+1}\) lead to cancellation
Result: Usually reduces to the first term minus the last term
\(\left(\frac{1}{1}-\frac{1}{2}\right) + \left(\frac{1}{2}-\frac{1}{3}\right) + \left(\frac{1}{3}-\frac{1}{4}\right) + \cdots + \left(\frac{1}{9}-\frac{1}{10}\right) + \left(\frac{1}{10}-\frac{1}{11}\right)\)
\(-\frac{1}{2}\) from the first term cancels with \(+\frac{1}{2}\) from the second term
\(-\frac{1}{3}\) from the second term cancels with \(+\frac{1}{3}\) from the third term
This pattern continues, canceling all intermediate terms
Only the first positive term \(\frac{1}{1}\) and the last negative term \(-\frac{1}{11}\) remain
Sum = \(\frac{1}{1} - \frac{1}{11} = \frac{11}{11} - \frac{1}{11} = \frac{10}{11}\)
We can check: \(\frac{1}{1} - \frac{1}{2} = \frac{1}{2}\), \(\frac{1}{2} - \frac{1}{3} = \frac{1}{6}\), etc., but the telescoping pattern is much more efficient
\(\sum_{n=1}^{10} \left(\frac{1}{n} - \frac{1}{n+1}\right) = \frac{10}{11}\)
• Telescoping principle: Identify cancellation patterns
• Term manipulation: Recognize the form \(a_n - a_{n+1}\)
• Simplification: Focus on non-canceling boundary terms
\(\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \frac{1}{16} + \cdots\)
Infinite series: A sum with infinitely many terms, represented as \(\sum_{n=1}^{\infty} a_n\)
Pattern recognition: Identify the general term \(a_n\) based on the sequence of terms
Geometric series: Series of the form \(\sum_{n=0}^{\infty} ar^n\) where each term is a constant multiple of the previous
Terms: \(\frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \frac{1}{16}, \ldots\)
Denominators: \(2, 4, 8, 16, \ldots = 2^1, 2^2, 2^3, 2^4, \ldots\)
The nth term appears to be \(\frac{1}{2^n}\) where \(n\) starts at 1
For \(n=1\): \(\frac{1}{2^1} = \frac{1}{2}\) ✓
For \(n=2\): \(\frac{1}{2^2} = \frac{1}{4}\) ✓
For \(n=3\): \(\frac{1}{2^3} = \frac{1}{8}\) ✓
The series is \(\sum_{n=1}^{\infty} \frac{1}{2^n}\)
This is a geometric series with first term \(a = \frac{1}{2}\) and ratio \(r = \frac{1}{2}\)
Since \(|r| = \frac{1}{2} < 1\), this series converges to \(\frac{a}{1-r} = \frac{\frac{1}{2}}{1-\frac{1}{2}} = \frac{\frac{1}{2}}{\frac{1}{2}} = 1\)
The series in sigma notation is: \(\sum_{n=1}^{\infty} \frac{1}{2^n}\)
• Pattern recognition: Identify the relationship between term position and value
• Sequence analysis: Examine numerators and denominators separately
• Geometric identification: Recognize constant ratios between consecutive terms
Sigma notation: A mathematical notation to represent sums in a compact form using the Greek letter \(\sum\)
Finite sum: A sum with a specific number of terms: \(\sum_{i=m}^{n} f(i)\) where \(n-m+1\) terms exist
Infinite sum: A sum with infinitely many terms: \(\sum_{i=m}^{\infty} f(i)\), requiring convergence analysis
Index variable: A "dummy variable" that takes on integer values within the specified range
- Component identification: Recognize index, limits, and summand
- Pattern recognition: Look for arithmetic or geometric sequences
- Property application: Use linearity to split or factor
- Formula selection: Apply appropriate sum formulas
- Verification: Check results with small examples
• Constant: \(\sum_{i=1}^{n} c = cn\)
• Integers: \(\sum_{i=1}^{n} i = \frac{n(n+1)}{2}\)
• Squares: \(\sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}\)
• Cubes: \(\sum_{i=1}^{n} i^3 = \left[\frac{n(n+1)}{2}\right]^2\)
• Linearity: \(\sum (a_i + b_i) = \sum a_i + \sum b_i\) and \(\sum c \cdot a_i = c \sum a_i\)
\(S_1(n) = \sum_{i=1}^{n} i\),
\(S_2(n) = \sum_{i=1}^{n} i^2\),
\(S_3(n) = \sum_{i=1}^{n} \frac{1}{i}\)
Analysis: The chart shows how different types of sums grow at different rates.
- \(S_1(n) = \frac{n(n+1)}{2}\) grows quadratically
- \(S_2(n) = \frac{n(n+1)(2n+1)}{6}\) grows cubically
- \(S_3(n)\) (harmonic series) grows logarithmically