# Quasicoherent

A blog about math and code that sometimes makes sense.

• # A Short Proof of Brickman's Theorem

This was based on a conversation with Alex Wang and Mark Gillespie. Alex has a blog post about Dine’s theorem, which is very related to this theorem. There are a lot of places in algebraic geometry where convexity appears in surprising places.

Most high school students already know far more about the binomial coefficients than they need to, and one of the things that they might know is the fact that if $k < \frac{n}{2}$, then  \binom{n}{k} \le \binom{n}{k+1}.