Can anybody guess in which way he used convolution for solving what is generally known as the change-making problem?
Wikipedia [1] mentions a &quot;probabilistic convolution tree&quot;, but that seems much more involved.<p>Edit: Solved. I&#x27;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.<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Change-making_problem" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Change-making_problem</a>