problem #3: Loopy Subsets
Call a set S “loopy” if it contains |S|. A set S is minimally loopy if it is loopy but contains no loopy proper subset. Find the number of minimally loopy subsets of {1,2,3,…,n}.
problem #2: Empty Squares on Peaceful Chessboards (IMO 2014 P2)
Let be an integer. Consider an chessboard consisting of unit squares. A configuration of rooks on this board is if every row and every column contains exactly one rook. Find the greatest…
problem #1: The Happy Ending Problem
Show that given any 5 points in the plane, no 3 of which are collinear, 4 of them must form the vertices of a convex quadrilateral.
An Elementary Solution to The Isoperimetric Problem
Why circles are the best shape.
Recursions, Differential Equations, and Unexpected Expectations
You won’t believe the answer to this one! Statisticians will hate you!
Intuition vs. Technique: On Taking Paths Around Circles
Two ways to solve a problem (and why I like my way better).
Light Rays and a Minimum Perimeter Triangle
Using physics to solve a math problem.
Follow My Blog
Get new content delivered directly to your inbox.