EE 234b Formula Sheet: Sets, Sequences, Recurrence, and Summation

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/23

flashcard set

Earn XP

Description and Tags

Practice flashcards covering definitions, set laws, counting principles, sequence formulas, recurrence relations, and summation rules from the EE 234b formula sheet.

Last updated 4:39 PM on 10/15/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

24 Terms

1
New cards

Union of Sets (A∪BA \cup B)

The set of all elements that belong to AA or BB, defined as {x∣x∈A or x∈B}\{ x \mid x \in A \text{ or } x \in B \}.

2
New cards

Intersection of Sets (A∩BA \cap B)

The set of all elements that belong to both AA and BB, defined as {x∣x∈A and x∈B}\{ x \mid x \in A \text{ and } x \in B \}.

3
New cards

Set Difference (A∖BA \setminus B)

The set of elements belonging to AA but not to BB, defined as {x∣x∈A and x∉B}\{ x \mid x \in A \text{ and } x \notin B \}, which is equivalent to A∩B′A \cap B'.

4
New cards

Set Complement (A′A')

The set of all elements in the universal set that do not belong to AA, defined as {x∣x∉A}\{ x \mid x \notin A \}.

5
New cards

Disjoint Sets

Two sets AA and BB that share no elements, formally defined by A∩B=∅A \cap B = \emptyset.

6
New cards

Distributive Laws of Sets

The set identities stating A∪(B∩C)=(A∪B)∩(A∪C)A \cup (B \cap C) = (A \cup B) \cap (A \cup C) and A∩(B∪C)=(A∩B)∪(A∩C)A \cap (B \cup C) = (A \cap B) \cup (A \cap C).

7
New cards

De Morgan's Laws (Sets)

The set laws stating that the complement of a union is the intersection of complements, (A∪B)′=A′∩B′(A \cup B)' = A' \cap B', and the complement of an intersection is the union of complements, (A∩B)′=A′∪B′(A \cap B)' = A' \cup B'.

8
New cards

Symmetric Difference of Sets

The set consisting of elements in either set but not in both, expressed as (A∖B)∪(B∖A)=(A∪B)∖(A∩B)(A \setminus B) \cup (B \setminus A) = (A \cup B) \setminus (A \cap B).

9
New cards

Inclusion-Exclusion Principle (Two Sets)

The formula for the cardinality of the union of two sets: ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B|.

10
New cards

Inclusion-Exclusion Principle (Three Sets)

The formula for the cardinality of the union of three sets: ∣A∪B∪C∣=∣A∣+∣B∣+∣C∣−∣A∩B∣−∣A∩C∣−∣B∩C∣+∣A∩B∩C∣|A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C|.

11
New cards

nthn\text{th} Term of an Arithmetic Sequence

The formula for the nthn\text{th} term given by an=a1+(n−1)da_n = a_1 + (n - 1)d, where the common difference is d=a2−a1d = a_2 - a_1.

12
New cards

Sum of an Arithmetic Sequence (SnS_n)

The sum of the first nn terms given by Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n), or Sn=n2[2a1+(n−1)d]S_n = \frac{n}{2}[2a_1 + (n - 1)d] when the last term is unknown.

13
New cards

nthn\text{th} Term of a Geometric Sequence

The formula for the nthn\text{th} term given by an=arn−1a_n = a r^{n-1}, where the common ratio is r=a2a1r = \frac{a_2}{a_1}.

14
New cards

Sum of a Finite Geometric Sequence (SnS_n)

The sum of the first nn terms given by Sn=a(1−rn)1−rS_n = \frac{a(1 - r^n)}{1 - r}, where r≠1r \neq 1.

15
New cards

Sum of an Infinite Geometric Series (S∞S_\infty)

The infinite sum given by S∞=a1−rS_\infty = \frac{a}{1 - r}, which is valid when ∣r∣<1|r| < 1.

16
New cards

Arithmetic Recurrence Relation

A recurrence of the form an=an−1+da_n = a_{n-1} + d, with closed-form solution an=a0+nda_n = a_0 + nd.

17
New cards

Geometric Recurrence Relation

A recurrence of the form an=ran−1a_n = r a_{n-1}, with closed-form solution an=a0rna_n = a_0 r^n.

18
New cards

Fibonacci Recurrence Relation

A recurrence defined by an=an−1+an−2a_n = a_{n-1} + a_{n-2} with initial conditions a0=0a_0 = 0 and a1=1a_1 = 1.

19
New cards

Unrolling Method

A technique for solving recurrence relations by expanding successive terms (a1,a2,a3,…a_1, a_2, a_3, \dots), spotting the pattern, and writing ana_n using nn only.

20
New cards

Number of Terms in a Summation

In sigma notation ∑i=mnai\sum_{i=m}^n a_i, the total number of terms summed is given by n−m+1n - m + 1.

21
New cards

Sum of a Constant Formula

The summation formula for a constant cc given by ∑i=1nc=cn\sum_{i=1}^n c = c n.

22
New cards

Sum of Integers Formula

The summation formula for the first nn positive integers: ∑i=1ni=n(n+1)2\sum_{i=1}^n i = \frac{n(n + 1)}{2}.

23
New cards

Sum of Squares Formula

The summation formula for the first nn squares: ∑i=1ni2=n(n+1)(2n+1)6\sum_{i=1}^n i^2 = \frac{n(n + 1)(2n + 1)}{6}.

24
New cards

Series Expansion of sin⁡(x)\sin(x)

The Taylor/power series expansion given by sin⁡(x)=∑n=0∞(−1)nx2n+1(2n+1)!\sin(x) = \sum_{n=0}^\infty \frac{(-1)^n x^{2n+1}}{(2n + 1)!}.