1/23
Practice flashcards covering definitions, set laws, counting principles, sequence formulas, recurrence relations, and summation rules from the EE 234b formula sheet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
Union of Sets (A∪B)
The set of all elements that belong to A or B, defined as {x∣x∈A or x∈B}.
Intersection of Sets (A∩B)
The set of all elements that belong to both A and B, defined as {x∣x∈A and x∈B}.
Set Difference (A∖B)
The set of elements belonging to A but not to B, defined as {x∣x∈A and x∈/B}, which is equivalent to A∩B′.
Set Complement (A′)
The set of all elements in the universal set that do not belong to A, defined as {x∣x∈/A}.
Disjoint Sets
Two sets A and B that share no elements, formally defined by A∩B=∅.
Distributive Laws of Sets
The set identities stating A∪(B∩C)=(A∪B)∩(A∪C) and A∩(B∪C)=(A∩B)∪(A∩C).
De Morgan's Laws (Sets)
The set laws stating that the complement of a union is the intersection of complements, (A∪B)′=A′∩B′, and the complement of an intersection is the union of complements, (A∩B)′=A′∪B′.
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).
Inclusion-Exclusion Principle (Two Sets)
The formula for the cardinality of the union of two sets: ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣.
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∣.
nth Term of an Arithmetic Sequence
The formula for the nth term given by an=a1+(n−1)d, where the common difference is d=a2−a1.
Sum of an Arithmetic Sequence (Sn)
The sum of the first n terms given by Sn=2n(a1+an), or Sn=2n[2a1+(n−1)d] when the last term is unknown.
nth Term of a Geometric Sequence
The formula for the nth term given by an=arn−1, where the common ratio is r=a1a2.
Sum of a Finite Geometric Sequence (Sn)
The sum of the first n terms given by Sn=1−ra(1−rn), where r=1.
Sum of an Infinite Geometric Series (S∞)
The infinite sum given by S∞=1−ra, which is valid when ∣r∣<1.
Arithmetic Recurrence Relation
A recurrence of the form an=an−1+d, with closed-form solution an=a0+nd.
Geometric Recurrence Relation
A recurrence of the form an=ran−1, with closed-form solution an=a0rn.
Fibonacci Recurrence Relation
A recurrence defined by an=an−1+an−2 with initial conditions a0=0 and a1=1.
Unrolling Method
A technique for solving recurrence relations by expanding successive terms (a1,a2,a3,…), spotting the pattern, and writing an using n only.
Number of Terms in a Summation
In sigma notation ∑i=mnai, the total number of terms summed is given by n−m+1.
Sum of a Constant Formula
The summation formula for a constant c given by ∑i=1nc=cn.
Sum of Integers Formula
The summation formula for the first n positive integers: ∑i=1ni=2n(n+1).
Sum of Squares Formula
The summation formula for the first n squares: ∑i=1ni2=6n(n+1)(2n+1).
Series Expansion of sin(x)
The Taylor/power series expansion given by sin(x)=∑n=0∞(2n+1)!(−1)nx2n+1.