Sums of Squares and Density

Classification theorems of Euler, Lagrange, and Legendre describe the sets of integers that can be written as the sum of 2, 3, and 4 squares. In the last two cases, it follows easily that the density of these sets are 5/6 and 1.

The question of density is not so simple in the case of two squares. In this post, we resolve using an unexpected tool — Dirichlet’s theorem on primes in arithmetic progressions.

Read Article →

Maximal Products of a Given Sum

Back in high school, I came across the following contest problem – “What is the largest product of a set of positive integers totaling 20?”

It’s a fun problem, so don’t rush past the spoiler tags too fast. In this post, we’ll give the solution to this problem and discuss a “continuous” version of this question. Namely, what happens when we’re allowed to include real numbers in our product?

Read Article →

Games of Limited Information (and Topology)

In this post, we’ll look at one-player games of limited information (sometimes classified as puzzles, not games) through a topological lens, and create for each game a poset of topologies under which topologically indistinguishable points correspond to outcomes that are indiscernible in a limited-information context. Expanding this dictionary, we’ll describe a topology on the outcome space under which the “safe” or “warranted” extension of one’s limited information relates to the continuity of certain maps.

Read Article →