## Anki Spaced Repetition

If you’re looking for spaced repetition software, check out Anki. It is a great program.

There are other good programs that do spaced repetition.

## Extra Office Hours

There will be additional office hours from MAT A29 and MAT A31 on **Friday Oct 14th** from **11am to 2pm** in **IC 481**.

Feel free to drop by for a cookie and some math!

## Running Late

Hi — MAT A29,

I am running late this morning. Please expect a short delay.

## The Epsilon-Delta Story and Examples

Epsilon-delta proofs are the cornerstone of rigorous mathematical analysis.

To help you out, I’ve written up some additional notes on this material.

- Examples of epsilon-delta proofs: contains some proofs with epsilons and deltas.
**The Delta-Epsilon Story**: This is extra material to illustrate the purpose of epsilon-delta proofs. It’s a fictitious dialogue between Alice and Bob, two students in MAT A31, who disagree about the value of .

[Graphic by User:HiTe – Own work, Public Domain, https://commons.wikimedia.org/w/index.php?curid=2314281]

## Office Hours!

This week we had great attendance at office hours. We solved some questions on the white board in my office; the photos are available below the cut.

To make things more convenient:

Office hours are now **11:30-12:30 on Tuesday and Thursday**, and **11-1pm on Wednesday**.

## Trigonometry Review

Some notes that I prepared about trigonometry are available here.

The notes sketch things like and solve equations like .

## MAT 237 — Week 3a

* This blog post contains my notes for MAT 237. It includes links to the peer instruction slides, practice problems, and some additional references for the curious. Blackboard photos are below the cut. Peer Instruction questions and problem solving work sheets are available two days after being shown in class. *

## Question 4 and Question 6

These questions kept coming up during my MAT A33 office hours. The notes below are an extended set of hints for these questions.

## The Hardware and Software of Theoretical Machines

** The Hardware and Software of Theoretical Machines **

*(This blog entry is a written summary of an pair of talks given at Canada Math Camp on 2015-07-28 and 2015-07-30. The official notes are on pgadey.ca.)*

Computers are all around us. This fact is so self-evident that writing it down, on a computer no less, is slightly embarassing. And yet, very few people ever talk about exactly what a computer is. Whenever it comes up one feels like St. Augustine, who said: “What *is* a computer? If no one asks me, I know what it is. If I wish to explain it to him who asks, I do not know.”

This talk is an informal introduction to the formalizations of computation adopted by Alonzo Church and Alan Turing, the two Great Definers of Computation. We’ll also say something about Charles Babbage because he too was awesome.

## Basic Combinatorics.

First we recall a little bit of terminology:

** 1.1. Sets and functions **

A set is a collection of elements . We write a set by surrounding its list elements with curly braces. For example: , . We also use set constructor notation where is some statement about that can be true or false. For example: , . We write: , for the set of natural numbers, for the set of rational numbers, for the set of integers.

We write to mean that is in the set . We write . We write . We write for if . If then we say that and are disjoint sets.

We write for the set of ordered pairs of elements.

Definition 1A function isinjective (one to one)if: implies . A function issurjective (onto)if: for all there is such that . A function isbijectiveif: for all there is such that . The number of elements in a set is written .

** 1.2. Basic formulae **

The basic facts of combinatorics are very simple.

- If then there is no injective function from a set with elements to a set with elements. (This is called pigeon hole principle.)
- If there is a bijective function from to then .
- If and are disjoint then .
- If and are disjoint then .
- .
- The number of element subsets of a set with elements is: . (Why is this an integer? Prove it.)
- The number of functions from an -element set to a element set is .
- If then the number of bijective functions from to (permutations of ) is .

There are a couple formulae that are handy to remember:

- There are subset of .
- Suppose you have objects of types 1, 2, , respectively. The number of ways of arranging all the objects is:
- Suppose you have identical objects that you want to distribute among containers. The number of ways to do this is: . (Why?)

leave a comment