Skip to content
🎯⭐ INTERACTIVE LESSON

Series and Probability

Learn step-by-step with interactive practice!

Series and Probability - Complete Interactive Lesson

Part 1: Series & Sigma Notation

🎲 Series and Probability

Part 1 of 5 — Series & Sigma Notation


Topics in This Part

Section
Sequence vs. Series
Reading Summation (Sigma) Notation
Expanding & Writing a Series

🔑 Key Concept: A sequence is a list of numbers; a series is what you get when you add the terms of a sequence. This lesson has two big ideas — series (Parts 1–2) and probability (Parts 3–5) — and they meet in the world of counting and patterns.

Sequence vs. Series

A sequence is an ordered list of terms:

3,  7,  11,  15,  193,\; 7,\; 11,\; 15,\; 19

A series is the sum of those terms:

3+7+11+15+19=553 + 7 + 11 + 15 + 19 = 55

We label terms with subscripts: a1a_1 is the first term, a2a_2 the second, and ana_n the general (nth) term.

NotationMeans
a1a_1first term
ana_nthe nnth term (general term)
SnS_nthe sum of the first nn terms

💡 Think of it this way: a sequence is the ingredients, a series is the total on the receipt.

Concept Check 🎯

Summation (Sigma) Notation

Writing long sums gets tedious, so we use the Greek capital letter sigma, Σ\Sigma, to mean "add up":

∑k=1nak=a1+a2+a3+⋯+an\sum_{k=1}^{n} a_k = a_1 + a_2 + a_3 + \cdots + a_n

The pieces:

  • kk is the index — a counter.
  • k=1k=1 (bottom) is where the counter starts.
  • nn (top) is where the counter ends.
  • aka_k is the rule — plug each value of kk into it.

Worked Example

∑k=14(2k+1)=(2⋅1+1)+(2⋅2+1)+(2⋅3+1)+(2⋅4+1)\sum_{k=1}^{4} (2k+1) = (2\cdot 1+1) + (2\cdot 2+1) + (2\cdot 3+1) + (2\cdot 4+1)

=3+5+7+9=24= 3 + 5 + 7 + 9 = 24

🔑 To expand a sigma: substitute each integer from the bottom number up to the top number, then add the results.

Expand & Evaluate 🧮

Find each sum.

1) ∑k=134k\displaystyle\sum_{k=1}^{3} 4k 2) ∑k=14(k2)\displaystyle\sum_{k=1}^{4} (k^2) 3) ∑k=15(3k−2)\displaystyle\sum_{k=1}^{5} (3k-2)

Read the Sigma 🔽

Match each part of ∑k=16(3k−2)\displaystyle\sum_{k=1}^{6}(3k-2) to its meaning.

Wrapping Up Part 1

You can now tell a sequence from a series and read, expand, and evaluate sigma notation.

SkillQuick reminder
Sequencea list of terms
Seriesthe sum of the terms
∑k=1nak\sum_{k=1}^{n} a_ksubstitute k=1k=1 up to k=nk=n, then add

Right now we are adding terms one by one. In Part 2 you'll learn formulas that add hundreds of terms in a single step.

Part 2: Arithmetic & Geometric Series

🎲 Series and Probability

Part 2 of 5 — Arithmetic & Geometric Series


🔑 The Idea: Two of the most important series follow simple patterns. Arithmetic series add a constant each step; geometric series multiply by a constant. Each has a sum formula that beats adding by hand.

Arithmetic Series

An arithmetic sequence adds a fixed amount — the common difference dd — each step. Its series sum is:

Sn=n2 (a1+an)S_n = \frac{n}{2}\,(a_1 + a_n)

In words: the number of terms, times the average of the first and last term.

Worked Example: 3+7+11+⋯3 + 7 + 11 + \cdots (first 10 terms)

Here a1=3a_1 = 3 and d=4d = 4. First find the 10th term with an=a1+(n−1)da_n = a_1 + (n-1)d:

a10=3+(10−1)(4)=3+36=39a_{10} = 3 + (10-1)(4) = 3 + 36 = 39

Now apply the sum formula:

S10=102 (3+39)=5⋅42=210S_{10} = \frac{10}{2}\,(3 + 39) = 5 \cdot 42 = 210

💡 The famous trick: to add 1+2+3+⋯+1001+2+3+\cdots+100, pair the ends — 1+100=1011+100=101, and there are 5050 pairs, so S=50⋅101=5050S = 50 \cdot 101 = 5050.

Arithmetic Sums 🧮

Use Sn=n2(a1+an)S_n = \dfrac{n}{2}(a_1 + a_n) (find ana_n first if needed).

1) Sum of the first 2020 terms of 5,8,11,…5, 8, 11, \ldots (a1=5, d=3a_1=5,\,d=3) 2) Sum of the first 5050 positive even numbers: 2+4+⋯+1002 + 4 + \cdots + 100 3) Sum: 1+2+3+⋯+1001 + 2 + 3 + \cdots + 100

Geometric Series

A geometric sequence multiplies by a fixed common ratio rr each step. The sum of the first nn terms is:

Sn=a1 1−r n1−r,r≠1S_n = a_1\,\frac{1 - r^{\,n}}{1 - r}, \qquad r \ne 1

Worked Example: 2+6+18+54+1622 + 6 + 18 + 54 + 162 (first 5 terms)

Here a1=2a_1 = 2 and r=3r = 3 (each term is 3×3\times the one before):

S5=2⋅1−351−3=2⋅1−243−2=2⋅−242−2=2⋅121=242S_5 = 2 \cdot \frac{1 - 3^5}{1 - 3} = 2 \cdot \frac{1 - 243}{-2} = 2 \cdot \frac{-242}{-2} = 2 \cdot 121 = 242

✅ Check: 2+6+18+54+162=2422+6+18+54+162 = 242 ✓

Concept Check 🎯

Infinite Geometric Series

If ∣r∣<1|r| < 1, the terms shrink toward 00 and the infinite sum converges to a finite number:

S=a11−r,∣r∣<1S = \frac{a_1}{1 - r}, \qquad |r| < 1

Worked Example: 8+4+2+1+⋯8 + 4 + 2 + 1 + \cdots

Here a1=8a_1 = 8 and r=12r = \frac{1}{2}:

S=81−12=812=16S = \frac{8}{1 - \frac{1}{2}} = \frac{8}{\frac{1}{2}} = 16

Repeating Decimals

A repeating decimal is an infinite geometric series. 0.7777…=710+7100+⋯0.7777\ldots = \frac{7}{10} + \frac{7}{100} + \cdots with a1=710a_1 = \frac{7}{10}, r=110r = \frac{1}{10}:

S=7/101−1/10=7/109/10=79S = \frac{7/10}{1 - 1/10} = \frac{7/10}{9/10} = \frac{7}{9}

⚠️ The infinite formula only works when ∣r∣<1|r| < 1. If ∣r∣≥1|r| \ge 1 the terms don't shrink, so the sum grows without bound.

Infinite Geometric Sums 🧮

Use S=a11−rS = \dfrac{a_1}{1 - r}. Enter a whole number, decimal, or fraction.

1) 27+9+3+1+⋯27 + 9 + 3 + 1 + \cdots (a1=27, r=13a_1 = 27,\, r = \frac{1}{3}) 2) 4+2+1+12+⋯4 + 2 + 1 + \frac{1}{2} + \cdots 3) The repeating decimal 0.3333…0.3333\ldots as a fraction (form like 1/3)

Part 3: Counting Principles

🎲 Series and Probability

Part 3 of 5 — Counting Principles


🔑 Why counting first? Probability is just favorable outcomes ÷ total outcomes. To find those numbers you must be able to count outcomes fast. The counting tools here power every probability question in Parts 4 and 5.

The Fundamental Counting Principle

If one choice can be made mm ways and a second independent choice nn ways, then together there are:

m×n waysm \times n \text{ ways}

This extends to any number of stages — just multiply.

Worked Example: Building an Outfit

You have 33 shirts, 44 pairs of pants, and 22 pairs of shoes. The number of outfits is:

3×4×2=243 \times 4 \times 2 = 24

Worked Example: Lining Up

How many ways can 55 people stand in a line? The first spot has 55 choices, the next 44, then 33, 22, 11:

5×4×3×2×1=1205 \times 4 \times 3 \times 2 \times 1 = 120

💡 The product 5×4×3×2×15 \times 4 \times 3 \times 2 \times 1 is written 5!5! ("five factorial"). By definition 0!=10! = 1.

Count the Ways 🧮

1) A menu has 44 appetizers, 66 entrées, and 33 desserts. How many 3-course meals? 2) Evaluate 6!6! (=6⋅5⋅4⋅3⋅2⋅1= 6\cdot 5\cdot 4\cdot 3\cdot 2\cdot 1). 3) A 4-digit PIN uses digits 00–99 and digits may repeat. How many PINs? (enter the number)

Permutations vs. Combinations

The big question: does order matter?

Order matters?Formula
Permutation P(n,k)P(n,k)Yes (arrangements)n!(n−k)!\dfrac{n!}{(n-k)!}
Combination C(n,k)C(n,k)No (groups)n!k! (n−k)!\dfrac{n!}{k!\,(n-k)!}
  • Permutation — 1st/2nd/3rd place in a race, a seating order, a password. Rearranging counts as different.
  • Combination — a committee, a hand of cards, a pizza's toppings. Rearranging is the same group.

Worked Example: Race Medals (order matters → permutation)

From 55 runners, how many ways to award gold, silver, bronze?

P(5,3)=5!(5−3)!=1202=60P(5,3) = \frac{5!}{(5-3)!} = \frac{120}{2} = 60

Worked Example: Committee (order doesn't matter → combination)

From 55 people, how many 33-person committees?

C(5,3)=5!3! 2!=1206⋅2=10C(5,3) = \frac{5!}{3!\,2!} = \frac{120}{6 \cdot 2} = 10

🔑 Sanity check: there are always fewer combinations than permutations of the same nn and kk, because a combination doesn't count the different orderings separately.

Permutation or Combination? 🎯

Compute Them 🧮

1) P(6,2)=6!4!P(6,2) = \dfrac{6!}{4!} 2) C(10,3)=10!3! 7!C(10,3) = \dfrac{10!}{3!\,7!} 3) A pizza shop has 55 toppings; choose any 2. How many topping pairs? (order doesn't matter)

Part 4: Probability Basics

🎲 Series and Probability

Part 4 of 5 — Probability Basics


🔑 The Big Formula: For equally likely outcomes, P(event)=number of favorable outcomestotal number of outcomes.P(\text{event}) = \frac{\text{number of favorable outcomes}}{\text{total number of outcomes}}. Every probability is between 00 (impossible) and 11 (certain).

Theoretical Probability

Count the favorable outcomes, divide by the total. The counting tools from Part 3 do the heavy lifting.

Worked Example: One Die

Roll a fair 66-sided die. P(rolling an even number)P(\text{rolling an even number})? The evens are 2,4,62,4,6 — three favorable out of six total:

P(even)=36=12P(\text{even}) = \frac{3}{6} = \frac{1}{2}

Worked Example: One Card

Draw from a standard 5252-card deck. There are 1313 hearts:

P(heart)=1352=14P(\text{heart}) = \frac{13}{52} = \frac{1}{4}

ProbabilityMeaning
00impossible
12\frac{1}{2}as likely as not
11certain

💡 A probability can be written as a fraction, a decimal, or a percent: 14=0.25=25%\frac{1}{4} = 0.25 = 25\%.

Find the Probability 🧮

Give each answer as a fraction in lowest terms (e.g. 1/2).

1) Rolling a number greater than 44 on a fair die. 2) Drawing a King from a 5252-card deck. 3) A bag has 44 red and 66 green marbles. P(green)P(\text{green})?

The Complement Rule

The complement of an event AA is "AA does not happen," written A′A' or AcA^c. Since something either happens or doesn't:

P(A′)=1−P(A)P(A') = 1 - P(A)

Worked Example

If P(rain)=0.3P(\text{rain}) = 0.3, then:

P(no rain)=1−0.3=0.7P(\text{no rain}) = 1 - 0.3 = 0.7

💡 When to use it: problems that say "at least one" are usually fastest through the complement. P(at least one)=1−P(none)P(\text{at least one}) = 1 - P(\text{none}).

Worked Example: At Least One Head

Flip a coin twice. The only way to get no heads is TT, which has probability 14\frac{1}{4}:

P(at least one head)=1−14=34P(\text{at least one head}) = 1 - \frac{1}{4} = \frac{3}{4}

The Addition Rule (Or)

For the probability that AA or BB happens:

P(A or B)=P(A)+P(B)−P(A and B)P(A \text{ or } B) = P(A) + P(B) - P(A \text{ and } B)

You subtract the overlap so it isn't counted twice. If AA and BB can't both happen (mutually exclusive), the overlap is 00 and it simplifies to P(A)+P(B)P(A) + P(B).

Worked Example: Heart or King

In a 5252-card deck: 1313 hearts, 44 Kings, but the King of Hearts is in both:

P(heart or King)=1352+452−152=1652=413P(\text{heart or King}) = \frac{13}{52} + \frac{4}{52} - \frac{1}{52} = \frac{16}{52} = \frac{4}{13}

⚠️ Forgetting to subtract the overlap is the #1 mistake. Always ask: can both happen at once?

Concept Check 🎯

Pick the Right Rule 🔽

Part 5: Compound Events & Mastery Check

🎲 Series and Probability

Part 5 of 5 — Compound Events & Mastery Check


You can sum series, count outcomes, and find single-event probabilities. The last skill: chaining events together with and.

The Multiplication Rule (And)

For two events happening in sequence, multiply:

P(A and B)=P(A)⋅P(B given A)P(A \text{ and } B) = P(A) \cdot P(B \text{ given } A)

The key question is whether the first event changes the second.

Independent Events (no effect)

A coin flip doesn't affect a die roll. P(heads and a 6)P(\text{heads and a }6):

P=12⋅16=112P = \frac{1}{2} \cdot \frac{1}{6} = \frac{1}{12}

Dependent Events (the first changes the second)

A bag has 33 red and 55 blue marbles (88 total). Draw two without replacement. P(both red)P(\text{both red}):

P=38⋅27=656=328P = \frac{3}{8} \cdot \frac{2}{7} = \frac{6}{56} = \frac{3}{28}

The second fraction is 27\frac{2}{7} because after removing one red, only 22 reds and 77 marbles remain.

🔑 "And" → multiply. Just decide first: does removing the first item change the odds for the second? If yes, it's dependent and the second fraction shrinks.

Concept Check 🎯

Compound Probability 🧮

Give each answer as a fraction in lowest terms.

1) Flip 22 coins: P(both heads)P(\text{both heads}). 2) Roll two dice: P(sum=7)P(\text{sum} = 7). (There are 66 favorable pairs out of 3636.) 3) Bag of 55 red, 33 blue (88 total). Draw 22 without replacement: P(both red)P(\text{both red}).

Quick Reference — The Whole Lesson

GoalKey move
Evaluate ∑k=1nak\sum_{k=1}^{n} a_ksubstitute k=1k=1 to nn, add
Arithmetic sumSn=n2(a1+an)S_n = \dfrac{n}{2}(a_1 + a_n)
Finite geometric sumSn=a11−rn1−rS_n = a_1\dfrac{1-r^n}{1-r}
Infinite geometric ($r
Count (stages)multiply choices (FCP)
Order matterspermutation P(n,k)=n!(n−k)!P(n,k)=\dfrac{n!}{(n-k)!}
Order doesn'tcombination C(n,k)=n!k!(n−k)!C(n,k)=\dfrac{n!}{k!(n-k)!}
Single probabilityfavorabletotal\dfrac{\text{favorable}}{\text{total}}
"Not" / "at least one"complement 1−P1 - P
"Or"add, subtract overlap
"And"multiply (mind dependence)

⚠️ The two probability traps: forgetting the overlap in "or," and forgetting that "without replacement" makes the second fraction shrink.

Mixed Review 🔽

One quick decision for each scenario.

Exit Quiz ✅

Answer all three to finish the lesson.