Clik here to view.
Factorization diagrams
In an idle moment a while ago I wrote a program to generate "factorization diagrams". Here’s 700: It’s easy to see (I hope), just by looking at the arrangement of dots, that there are in total. Here’s...
View ArticleClik here to view.
More factorization diagrams
My post on factorization diagrams from a month ago turned out to be (unexpectedly) quite popular! I got ten times as many hits as usual the day it was published, and since then quite a few other people...
View ArticleClik here to view.
Apollonian gaskets
In my last post I showed off this tantalizing picture: This pattern of infinitely nested circles is called an Apollonian gasket. Over the next post or two I’ll explain some cool math behind actually...
View ArticleClik here to view.
Apollonian gaskets and Descartes’ Theorem
In my previous post, I explained a recursive procedure for drawing Apollonian gaskets. Given any three mutually tangent circles, there are exactly two other circles which are mutually tangent to all...
View ArticleClik here to view.
Apollonian gaskets and Descartes’ Theorem II
In a few previous posts I wrote about “kissing sets” of four mutually tangent circles, and the fact that their signed bends satisfy Descartes’ Theorem, (Remember that the signed bend of a circle is...
View ArticleClik here to view.
The Recamán sequence
I recently learned about a really interesting sequence of integers, called the Recamán sequence (it’s sequence A005132 in the Online Encyclopedia of Integer Sequences). It is very simple to define, but...
View ArticleClik here to view.
Computing optimal play for the greedy coins game
Recall the greedy coins game, in which two players alternate removing one of the coins from either end of a row, and the player with the highest total at the end is the winner. What if we wanted to...
View ArticleClik here to view.
Computing optimal play for the greedy coins game, part 2
I want to explain in more detail how we can think about computing the best possible score for Alice in the greedy coins game, assuming best play on the part of both players. I glossed over this too...
View ArticleClik here to view.
Computing optimal play for the greedy coins game, part 3
In a previous post we saw how we can organize play sequences in the greedy coins game into a tree. Then in the last post, we saw how to work our way from the bottom of the tree upward and compute the...
View ArticleClik here to view.
Computing optimal play for the greedy coins game, part 4
Last time I explained a method for computing best play for instances of the greedy coins game, which is feasible even for large games. This general approach is known as dynamic programming and is...
View Article![Personal Investments • Re: 401k investments [which to choose?]](http://i.imgur.com/wA51OIw.png)
