# Handouts (by competition)

Here are all of my handouts, categorized by whether or not they’re for competition math. You can view their LaTeX source files here.

If you’re looking to prepare for math contests, you should also look at PRIME. You can also view handouts categorized by subject on the main handouts page.

## Competition Math

### What Is n Choose 2?

A double counting handout specifically themed around counting pairs of things.

### Newton Interpolation and the Umbral Calculus

An explanation of Newton interpolation that I find makes it easy to remember, and its relation to the calculus of finite differences and umbral calculus in general.

### Engineering

Engineering is finding the answer to a problem without solving it. People aren’t trying to engineer enough, so I wrote this to change that.

### Lifting the Exponent

A very short handout on lifting the exponent, followed by some problems.

### Graph Theory

A handout for an introductory graph theory lesson I gave in the Philippine Math Olympiad Summer Camp.

### Synthetic Trigonometry

A problem set on deriving the values of trigonometric functions for common angles using synthetic methods. Helpful for memorizing sin 36° and cos 75°, for example.

### Angle Chasing

A problem set about angle chasing, for a class I gave in the Philippine Math Olympiad Summer Camp. Has corresponding lecture slides. Heavily based on Chapter 1 of Euclidean Geometry for Mathematical Olympiads.

### 2018–19 in Review

My top ten favorite problems from Philippine high school math contests in 2018–19, and a review of the problems in each contest. Has some insight in setting problems for competitions.

### Obscure Geometry Theorems

Discusses some techniques in computational geometry through the proofs of some lesser-known theorems.

### Constructions

An experimental problem set on geometry problems that become easier after constructing something.

### Hall’s Marriage Theorem

Discusses example problems, followed by a problem set. Some basic knowledge about graph theory assumed.

### Pascal’s Theorem

Briskly sets up the projective plane and discusses example problems using Pascal’s theorem, followed by a problem set.

### Non-Standard MMC Problems

Practice questions for the oral rounds, compiled for use of our math team. Has actual MMC questions and questions similar in format, mostly from NIMO.

## Everything else

### Machine Learning

Machine learning, for people more used to reading math textbooks than writing code. Prerequisites are some knowledge of probability theory, and dealing with matrices and vectors.

### Canonical Decomposition and the First Isomorphism Theorem

The canonical decomposition of a function, as explained in Aluffi’s *Algebra Chapter 0*, and what I think is the correct way to explain quotienting and the first isomorphism theorem.

### Convex Combinations

How I think about convex combinations, both algebraically and geometrically, why they’re named convex combinations, and their relation to Jensen’s inequality.

### Mathematical Investigations

An article on mathematical investigations. The intended audience are Philippine high school students, in view of the planned curriculum change.

### Four-Function Primality Testing

Here’s how to use a four-function calculator to check that 123,456,789,011 is prime in fifteen minutes. Discusses the Fermat test and the Miller-Rabin test.

### Nineteen Proofs There Are Infinitely Many Primes

Nineteen sketches of different proofs there are infinitely primes, each shortened to be readable in about nineteen seconds each.

### Compass and Ruler

A light-hearted problem set on compass-and-ruler constructions, as well as constructions with other tools. Best not to take it too seriously.

### Spelling Out Numbers

A recreational problem set on numbers and their spelled out forms.

### Talasalitaang Pangsipnayan

An English-Filipino mathematics glossary I compiled, aimed towards words used for math competitions. Mostly based on Maugnaying Talasalitaang Pang-Agham, edited by Gonasalo del Rosario.

### Crossing Numbers

Talks about the Euler characteristic, Kuratowski’s and Wagner’s theorems, Fáry’s theorem, and the crossing number inequality. No prerequisites, but knowledge of graph theory is useful.