Problem

Source: Germany 2016 - Problem 2

Tags: combinatorics, combinatorics unsolved, Germany, counting



A very well known family of mathematicians has three children called Antonia, Bernhard and Christian. Each evening one of the children has to do the dishes. One day, their dad decided to construct of plan that says which child has to do the dishes at which day for the following $55$ days. Let $x$ be the number of possible such plans in which Antonia has to do the dishes on three consecutive days at least once. Furthermore, let $y$ be the number of such plans in which there are three consecutive days in which Antonia does the dishes on the first, Bernhard on the second and Christian on the third day. Determine, whether $x$ and $y$ are different and if so, then decide which of those is larger.