It is a surprising fact that ideas and tools from infinitary mathematics can be used to resolve problems about finite sets. I will discuss one result of this kind; a theorem about colourings of finite graphs whose proof involves algebra, analysis and nonlinear programming.