## #YouCanLearnAnything

Posted in Teaching and Learning by pgadey on 2019/06/25

For a funny satire about learning from videos, see below.

Tagged with: , ,

## Quotes from “What if?” by Emily Clader

Posted in Math, Teaching and Learning by pgadey on 2019/05/23

I had to share these fantastic quotes from Emily Clader‘s piece “What If?: Mathematics, Creative Writing, and Play” in Journal of Humanistic Mathematics. The whole piece is great, and I encourage you to read it.

Mathematics … is a language, a set of structures through which ideas can be given both order and aesthetics. Like any language, it is capable of describing the world as one sees it, revealing patterns and properties that are often difficult to articulate without the right vocabulary. Yet also, like a language, mathematics can be used to explore the fantastic, the fictional, the conceivable but unreal. In providing an appropriate lexicon, mathematics gives form to our imagination of other worlds

Herein lies the true creative potential of mathematics. The precision of its language permits one to create a detailed imaginative picture of possible objects, possible structures, and possible worlds that do not, in practice,exist. Anything that can be conceived can be explored with as much rigor as the sensory world — indeed, even more so.

Tagged with: , , , , ,

Posted in Math by pgadey on 2018/07/11 I was looking through the Geogebra site and found this lovely applet Orthographic Projection by Malin Christersson.

This is a lovely tool for investigating one of my favourite facts about hexagons:

The area maximizing orthogonal projection of a cube is the regular hexagon.

It turns out that Malin has tonnes of awesome geometry stuff online!

Awesome math art!

Tagged with: , ,

## Basic Combinatorics.

Posted in Uncategorized by pgadey on 2014/07/27

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: ${X = \{1,2,3\}}$, ${Y = \{\heartsuit, \clubsuit, \star\}}$. We also use set constructor notation ${Y = \{x : P(x)\}}$ where ${P(x)}$ is some statement about ${x}$ that can be true or false. For example: ${X = \{n : n\text{ is even}\}}$, ${Z = \{n : n\text{ is prime}\}}$. We write: ${\{\} = \emptyset}$, ${{\mathbb N}}$ for the set of natural numbers, ${{\mathbb Q}}$ for the set of rational numbers, ${{\mathbb Z}}$ for the set of integers.

We write ${x \in X}$ to mean that ${x}$ is in the set ${X}$. We write ${X \cup Y = \{x : x \in X \text{ or } x \in Y\}}$. We write ${X \cap Y = \{x : x \in X \text{ and } x \in Y\}}$. We write ${X \sqcup Y}$ for ${X \cup Y}$ if ${X \cap Y = \emptyset}$. If ${X \cap Y = \emptyset}$ then we say that ${X}$ and ${Y}$ are disjoint sets.

We write ${X \times Y = \{(x,y) : x \in X,\ y \in Y\}}$ for the set of ordered pairs of elements.

Definition 1 A function ${f : X \rightarrow Y}$ is injective (one to one) if: ${x \neq y}$ implies ${f(x) \neq f(y)}$. A function is surjective (onto) if: for all ${y \in Y}$ there is ${x \in X}$ such that ${f(x) = y}$. A function is bijective if: for all ${y \in Y}$ there is ${x \in X}$ such that ${f(x) = y}$. The number of elements in a set ${X}$ is written ${|X|}$.

1.2. Basic formulae

The basic facts of combinatorics are very simple.

1. If ${k < n}$ then there is no injective function from a set with ${n}$ elements to a set with ${k}$ elements. (This is called pigeon hole principle.)
2. If there is a bijective function from ${X}$ to ${Y}$ then ${|X| = |Y|}$.
3. If ${X}$ and ${Y}$ are disjoint then ${|X \cup Y| = |X| + |Y| - |X \cap Y|}$.
4. If ${X}$ and ${Y}$ are disjoint then ${|X \sqcup Y| = |X| + |Y|}$.
5. ${|X \times Y| = |X| \cdot |Y|}$.
6. The number of ${k}$ element subsets of a set with ${n}$ elements is: ${\binom{n}{k} = \frac{ n! }{ (n-k)! k! }}$. (Why is this an integer? Prove it.)
7. The number of functions from an ${n}$-element set to a ${k}$ element set is ${k^n}$.
8. If ${|X| = n}$ then the number of bijective functions from ${X}$ to ${X}$ (permutations of ${X}$) is ${n!}$.

There are a couple formulae that are handy to remember:

1. There are ${2^n}$ subset of ${\{1, \dots, n\}}$.
2. Suppose you have ${n_1, \dots, n_k}$ objects of types 1, 2, ${\dots}$, ${k}$ respectively. The number of ways of arranging all the objects is: ${{ (n_1 + \dots + n_k)! }/{ n_1! n_2! \dots n_k! }}$
3. Suppose you have ${n}$ identical objects that you want to distribute among ${k}$ containers. The number of ways to do this is: ${\binom{n+k-1}{k-1}}$. (Why?)

Tagged with: , , ,

## Of Committees and Meetings

Posted in Uncategorized by pgadey on 2014/04/07

I’m happy to announce that I survived my PhD supervisory committee meeting. After 362 days, my committee met once again (we last met Apr 10th 2013), and things went well.

Below I’ve included some details on the process and some post-meeting thoughts. All of it is based purely on my own experience, but might be helpful to others.

Tagged with: , ,

## 2014 Mentoring

Posted in Math by pgadey on 2014/02/08

I’ve added a page about the mentoring project that I’m working on with three Gr. 12 students this semester. I’ll be updating the page as we go. For more information see Mentoring — 2014. From the introductory remarks:

The plan for the semester is an ambitious one. We’re going to understand the structure of all the regular convex polytopes in all dimensions, and build up a intuition for dimensions greater than three. We’ll spend most of our time learning the tools we need to understand how a geometric object can be pieced together. These tools will include vectors, metric spaces, symmetry groups, and simplicial complexes. I’m taking a very broad view of what constitutes a tool and counts as information about a space. The final result of the project will be a poster presentation about the solids and some 3-dimensional “nets” of the 4-dimemsional solids (the simplex, cube, cross-polytope, and 24-cell).

I can’t resist saying things about hyperbolic geometry. Therefore, if we get to the end of the proposed project, we’ll take a stab at using out high brow high dimensional intuition to understand the Gieseking manifold. There is more than enough stuff to say about the platonic solids, so we’ll see how far we get.

Tagged with: , , ,

## The Rotationally Distinct Ways to Label a Die

Posted in Math by pgadey on 2013/07/24

I’m giving a talk at the Canadian Math Camp this year. I’ll be showing the kids of how to count the number of ways to label a six sided die up to the rotational symmetries of the cube. Here is the handout for the talk with questions about dice labellings, the 15-puzzle, and permutation groups.

For the curious the labellings are below the cut. Please note that there are typos in the table below. Alex Fink kindly pointed them out and they will be fixed eventually. For now they are an exercise in keen observation.

Tagged with: , ,

Posted in Math by pgadey on 2013/07/20

Over the past couple weeks I’ve been asked a lot of questions about discs in Euclidean space. In this post we’ll be putting pennies on a table, refining covers of discs, and trying to cram lots of balls into high dimensional balls. Some open questions about putting pennies on tables occur below.

Tagged with: , , ,

## A Bijection

Posted in Math by pgadey on 2013/03/30

While grading an assignment on cardinality, I ran into the answer to the following problem:

Exercise 1 Show that ${f(n) = \sum_{k=0}^n (-1)^{k+1} k}$ is a bijective map ${{\mathbb N} \cup \{0\} \rightarrow {\mathbb Z}}$.

Tagged with: , ,

## The Spherical Isoperimetric Inequality

Posted in Math by pgadey on 2013/03/28

Here is an application of the spherical isoperimetric inequality.

Fact You can’t cut up a beach ball into equal parts with a path that is too short.

Tagged with: , , ,