Re: Problem 157
Posted: Thu Oct 08, 2015 1:19 am
Yes.
Can I just add another voice to the call for a slight clarification on this problem: I feel that instead of asking for how many solutions there are for 1<=n<=9, it would be clearer of the question asked for the sum of s(n) where s(n) stands for the number of solutions for a particular value of n...
I know that many people have solved the problem already and so it's not a big issue, but I wonder how many (like me) only got it on the second try, having initially gone for the number of distinct solutions over all n...
Claude