Obscure Geometry Theorems. Discusses 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. Knowledge on graph theory assumed.
Pascal’s Theorem. Briskly sets up the projective plane and discusses example problems, followed by a problem set.
Crossing Numbers. No prerequisites, but knowledge of graph theory is useful, and so is familiarity with reading proofs. Goes from a light overview to the crossing number inequality.
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.
Image: Pascal’s Theorem.
Bounds on metric dimension for families of planar graphs.
C. J. Quines and M. Sun.
Second Prize, Mathematics, ISEF 2017.
Spelling Out Numbers. A recreational problem set on numbers and their spelled out forms.
Talasalitaang Pangsipnayan. An English-Filipino mathematics glossary I compiled.
Image: Talasalitaang Pangsipnayan.