• Algorithms
  • Throwing dice.

    Welcome back my friend! With this post I want to talk about some interesting applications of the theory of generating functions in relation to the enumeration of combinations. For this purpose let’s introduce a very simple problem: “Say we throw three regular dice, in how many ways the sum of the upper faces can be […]

  • Algorithms
  • Stern-Brocot tree’s.

    I’ve encountered this mirable structure this weekend when dealing with cleaver ways to represent fraction¬†of rational numbers n/m where gcd(n,m)=1¬†(nominator and denominator are relatively prime), Stern-Brocot tree’s are just all about building all the possible fractions that are in they lowest form. What’s interesting (but that came as evident once one understand this structure) is […]