Can anybody guess in which way he used convolution for solving what is generally known as the change-making problem?
Wikipedia [1] mentions a "probabilistic convolution tree", but that seems much more involved.
Edit: Solved. I've missed that the problem only deals with change amounts that can be reached with one or two coins. So a single convolution is sufficient in this specific case.