Introduction

Topic 1: Sets

Day 1

Learning Objective 1.1. Definitions and Notation. I understand the concepts of definitions and notation. Given a mathematical term, I can write down the precise definition, my personal understanding, an example, and a non-example. Given a mathematical symbol, I can understand its context in a mathematical expression, and translate its meaning and use into English.

Day 2

Learning Objective 1.2. Set Notation. I can represent a set in roster notation and set-builder notation. I can determine if an object is an element of a set. I can determine whether two sets are equal or subsets of one another. I understand the difference between a finite and infinite set.

Background Reading: Read Section 0.3 of our textbook up to but not including the part labeled “Operations on Sets”.
Also recommended is Hammack’s Book of Proof. See Sections 1.1 and 1.3.

Day 3

On this day there will be a quiz on learning objectives 1.1 and 1.2.

Learning Objective 1.3. Set Operations and Venn Diagrams. I can perform operations on sets (intersection, union, complement, difference) and represent the operations as Venn Diagrams. I can compute the power set of a set and the Cartesian product of multiple sets.

Background Reading: Read the remainder of Section 0.3 of our textbook.
Also recommended is Hammack’s Book of Proof. See Sections 1.5, 1.6, 1.2, and 1.4.

Day 4

Learning Objective 1.4. Set Operations as English Language. I can convert between real-world situations involving collections of objects and abstract expressions involving sets. I can determine the English equivalent of the complement of a set. I can apply De Morgan’s Laws when finding the complements of expressions involving AND or OR.

Topic 2: Combinatorics

Day 5

On this day there will be a quiz on learning objectives 1.3 and 1.4.

Learning Objective 2.1. Addition, Multiplication, and Permutations. I can use the additive principle when counting disjoint sets. I can use the multiplicative principle when counting sequences of independent events. I can count the number of permutations and k-permutations of a set of n objects.

Background Reading: Read Section 1.1, up to and including Multiplicative Principle (with sets).
Section 1.3 up through but not including Example 1.3.4.

Day 6

Learning Objective 2.2. Applications of Venn Diagrams. Given a counting word problem, I can develop an appropriate model involving set notation and Venn diagrams. I can apply the Principle of Counting the Complement and the Principle of Inclusion and Exclusion to solve counting problems.

Background Reading: Read the remainder of Section 1.1, starting with the subsection on the Principle of Inclusion/Exclusion. You may wish to refresh your understanding of sets and set operations as discussed on Days 3 and 4.

Day 7

On this day there will be a quiz on learning objectives 2.1 and 2.2.

Learning Objective 2.3. Combinations and Binomial Coefficients.I can count the number of ways to choose k objects from a group of n objects when repetition IS NOT allowed. I can count the number of bit strings of length n and weight k. I understand how these two concepts are related. I can calculate the binomial coefficient (n choose k). 

Background Reading: Read Section 1.2 and Section 1.3 starting here.

Day 8

Learning Objective 2.4. Multicombinations. I can count the number of ways to choose k objects from a group of n objects when repetition IS allowed. I can use the “stars and bars” method to count the number of ways to distribute objects among a group. I can calculate (n multichoose k).

Background Reading: Read Section 1.5.

Day 9

Today there will be a quiz on learning objectives 2.3 and 2.4.

Learning Objective 2.5. Applying the correct method. I can determine whether a real-world scenario involves ordered or unordered objects, distinct or identical objects, and whether repetition is allowed or not allowed. I can then apply the correct method of counting.

Background Reading: Read Section 1.7.

Day 10

Learning Objective 2.5. Applying the correct method. I can determine whether a real-world scenario involves ordered or unordered objects, distinct or identical objects, and whether repetition is allowed or not allowed. I can then apply the correct method of counting.

Background Reading: Read Section 1.7.

Day 11

Either on Day 11 or Day 12, there will be a quiz on learning objective 2.5.

There are no new video lectures for today.

The remainder of the class period: More practice with counting problems.

Day 12

The remainder of the class period: Review session for the first midterm.

Day 13

On this day is Midterm 1, covering Learning Objectives 1.1-1.4 and 2.1-2.5.

Topic 3: Functions

Day 14

Learning Objective 3.1. Defining Functions. I can determine whether a rule described in words is a function, including whether it is well defined.

Background reading: Read the sections of Chapter 0.4 up to but not including the definition of Recursively Defined Functions.

Day 15

Learning Objective 3.2. Domain, Range, and Codomain. I can determine the domain, range, and codomain of a function, especially a discrete function defined using words.

Background Reading: Read the beginning of Chapter 0.4, which discusses domains, codomains, and ranges.

Day 16

On this day there will be a quiz on learning objectives 3.1 and 3.2.

Learning Objective 3.3. Images and Preimages. I can determine the image of an element in the domain and a preimage of an element in the codomain.

Background Reading: Read the section of Chapter 0.4 that discusses images and pre-images.
Note: The book uses the words inverse image to mean the same thing as pre-image.

Day 17

Learning Objective 3.4. Injective, Surjective, and Bijective Functions. I can determine whether a function is injective, surjective, or bijective.

Background Reading: Read the section of Chapter 0.4 that discusses Surjections, Injections, and Bijections.
Read these two examples: Counting Bijections and Counting Injections.

Day 18

On this day there will be a quiz on learning objectives 3.3 and 3.4.

Learning Objective 3.5. Special Functions. I can evaluate special computer science functions: floor, ceiling, factorial, DIV (//), and MOD (%).
Given an integer a and a positive integer b, I can find integers q and r such that a=qb+r and 0≤r<b.

Background Reading: Here is more information about the floor and ceiling and DIV and MOD functions.

Topic 4: Algebra, Sequences, Series, and Products

Day 19

 Learning Objective 4.1. Exponents and Logarithms. I can convert between expressions involving exponents and expressions involving logarithms. I can apply exponential and logarithmic rules to expand or simplify expressions. I can convert between log₂, ln, and log₁₀.

Background Reading: This topic is not in our textbook. If you need a refresher about exponents and rules of exponents, here is a textbook section to read and here is a no-frills video. For logarithms, here is a textbook with a detailed explanation about logarithm basics and rules of logarithms and here is a different textbook with less-detailed explanations about logarithm basics and rules of logarithms. In addition to the videos shared here, there are many videos online with examples of solving exponential and logarithmic equations.

Day 20

Learning Objective 4.2. Sequences. If I am given a function (as a formula or in words) that defines a sequence, I can determine the value of a specified term of the sequence. If I am given a constant sequence, arithmetic sequence, geometric sequence, or alternating sequence written using ellipses, I can find a formula for the sequence. I can determine the number of terms in a finite sequence

Background Reading: Read Chapter 2.1 (ignoring discussion of recursion) and the section of Chapter 2.2 that discusses arithmetic and geometric sequences. 

Day 21

On this day there will be a quiz on learning objectives 4.1 and 4.2.

Learning Objective 4.3. Series and Products. I can write a finite or infinite sum in sigma notation. I can write a finite or infinite product in pi notation. I can interpret an expression written in sigma or pi notation correctly. I can find the sum of a finite arithmetic series. I can find the sum of a finite or infinite geometric series.

Background Reading: Our textbook discusses these topics in a very limited fashion in Section 2.1 and Section 2.2. Here is a simple explanation about sigma and pi notation. Here is a more detailed explanation of sigma notation. Here there is a discussion about sigma, pi, and set intersection notation. Here is a nice interpretation of sigma and pi notation in code. 

Day 22

Learning Objective 4.4. Σ and 𝚷 Manipulations. I can do sigma and pi manipulations involving sums, products, exponentiation, and logarithms.

Background Reading: See the background reading from Day 20. In addition, two-thirds of the way down this post there is a discussion of converting between sigma and pi notation using logarithms. 

Day 23

On this day there will be a quiz on learning objectives 4.3 and 4.4.

The remainder of the class will be a review session for the second midterm.

Day 24

On this day is Midterm 2, covering Topics 3 and 4.
In other words, Midterm 2 assesses Learning Objectives 3.1-3.5 and 4.1-4.4.
This exam is not cumulative: It does not assess content that was assessed in Midterm 1.

Topic 5: Modular Arithmetic and Divisibility

Day 25

Learning Objective 5.1. Modular Arithmetic.  I can add, subtract, and multiply numbers in Z_n. I can find powers of numbers in Z_n by applying rules of exponents, the technique of repeated squaring, and Fermat’s Little Theorem.

Background Reading. Congruence mod n, Modular Arithmetic and Modular Exponentiation.

Day 26

Learning Objective 5.2. Divisibility, GCD, and the Euclidean Algorithm I can determine if one number divides another. I understand the concept of the GCD of two numbers. I can use the Euclidean algorithm to find the GCD of two given numbers.

Background Reading: Divisibility Basics, GCD, Read Sections 11.4.1 and 11.4.2 of Applied Discrete Structures by Al Doerr and Ken Levasseur.

Day 27

On this day there will be a quiz on learning objectives 5.1 and 5.2.

Learning Objective 5.3. Prime Factorization. I can determine the prime factorization of a positive integer and use this information to determine all divisors of an integer.

Background Reading:  Definition of a prime, Prime Factorization, Finding all divisors of a number, and computing the number of divisors of a number.

Day 28

On this day there will be a quiz on learning objective 5.3.

The remainder of the class will be a review session for the final exam.

Final Exam Day

Congratulations! You’ve made it to the end of the semester.

Your instructor will inform you about when and where the final exam will be held.

The final exam IS cumulative. There will be questions assessing learning objectives from throughout the semester, including divisibility and modular arithmetic. Make sure you remember to study the materials from the beginning of the semester with your study group.

Course Acknowledgments

This course is the product of a collaboration between the Queens College Departments of Mathematics and Computer Science. We gratefully acknowledge the open education resources community, including the textbook author Oscar Levin, and the Grading for Growth community, especially Robert Talbert and his course on Discrete Structures for Computer Science at Grand Valley State University, which served as an inspiration for the structure of this course and much of its content.

Course content was created by Christopher Hanusa, Moshe Adrian, David Miller, Steven Goldman, Wjeewani Boteju, Kirsten Berger, and Adam Wang. This webpage was developed by Christopher Hanusa.