I made it!
I’d insert a Frozen gif here if I could find a good one, but I don’t like any of the ones I found and besides, copyright is an issue. So instead:
IMO2007.C6. In a mathematical competition some competitors are friends. Friendship is always mutual. Call a group of competitors a clique if each two of them are friends. (In particular, any group of fewer than two competitiors is a clique.) The number of members of a clique is called its size.
Given that, in this competition, the largest size of a clique is even, prove that the competitors can be arranged into two rooms such that the largest size of a clique contained in one room is the same as the largest size of a clique contained in the other room.
Author: Vasily Astakhov, Russia
If you remember where I first posted this to break a combo, you have an excellent memory and/or spend too much time stalking me. If you remember the context under which I posted this to break a combo, you have a better memory than I do.
Was my streak a success? On the bright side, I definitely generated lots of posts, many of which were radical departures from my old blogging habits:
- card game documentation,
- weird short stories and sequels to weird short stories,
- an essay (liberally defined) with two parts,
- an essay with two parts and a half,
- another bar graph that is actually documented,
- a ridiculous literate Haskell post,
- numerous facetious Paintbrush dragons,
- a post about a post on a side blog,
- and, of course, metric zarktons of shameless filler.
I also had lots of fun conversations about my posts, such as: