Tag: combinatorics

This blog post corresponds to my newest olympiad handout on discrete continuity. The concept of discrete continuity is an extremely effective and versatile method in tackling a wide variety of combinatorics problems. This technique has been used extensively for many years especially in particular classes of problems. Here, after a quick recap of the basics we shall… Continue reading Discrete Continuity in Combinatorics →

In this article we provide investigate a famous classical process involving piles of stones (or originally cards) introduced by Martin Gardner. The game involves a set of piles of stones with $latex \frac{n(n+1)}{2}$ stones in total. In each move, the topmost stone in each pile is picked and a new pile is formed with these… Continue reading Bulgarian Solitaire →