Problem 78 of Project Euler has been in my scope for a long time, since it is the first exercise on the list which is solved by less than 5000 people at the time of writing this post. The problem reads Let p(n) represent the number of different ways in which n coins can be separated intoContinue reading →
The post Project Euler 78: Investigating the number of ways in which coins can be separated into piles. appeared first on mathblog.dk.