Unnecessarily detailed stories of my Mystery Hunt puzzles

As a follow-up to the previous post, I am recording here some details about the (numerous, varied, and deep) revisions that a bunch of my puzzles went through during the production process. These puzzles are in chronological order of when I wrote the puzzle. Spoiler warning: Unlike the last post, these will completely spoil all… Continue reading Unnecessarily detailed stories of my Mystery Hunt puzzles

Some puzzle-writing thoughts from an amateur

The 2021 Mystery Hunt concluded a while ago, and wow, what an experience. I was lucky enough to be on the organizing team, and I am so proud right now to be able to say I am a ✈️✈️✈️ Galactic Trendsetter ✈️✈️✈️. (If you don't know what a puzzle hunt is, betaveros has a great… Continue reading Some puzzle-writing thoughts from an amateur

USEMO Problem Development, Behind the Scenes

In this post I'm hoping to say a bit about the process that's used for the problem selection of the recent USEMO: how one goes from a pool of problem proposals to a six-problem test. (How to write problems is an entirely different story, and deserves its own post.) I choose USEMO for concreteness here,… Continue reading USEMO Problem Development, Behind the Scenes

USA Special Team Selection Test Series for IMO 2021

A lot of people have been asking me how team selection is going to work for the USA this year. This information was sent out to the contestants a while ago, but I understand that there's a lot of people outside of MOP 2020 who are interested in seeing the TST problems :) so this… Continue reading USA Special Team Selection Test Series for IMO 2021

USEMO sign-ups are open

I'm happy to announce that sign-ups for my new olympiad style contest, the United States Ersatz Math Olympiad (USEMO), are open now! The webpage for the USEMO is https://web.evanchen.cc/usemo.html (where sign-ups are posted). The US Ersatz Math Olympiad is a proof-based competition open to all US middle and high school students. Like many competitions, its… Continue reading USEMO sign-ups are open

Circular optimization

This post will mostly be focused on construction-type problems in which you're asked to construct something satisfying property $latex {P}&fg=000000$. Minor spoilers for USAMO 2011/4, IMO 2014/5. 1. What is a leap of faith? Usually, a good thing to do whenever you can is to make ``safe moves'' which are implied by the property $latex… Continue reading Circular optimization