Problem 157
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
In particular don't post any code fragments or results.
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
-
Georg
- Posts: 157
- Joined: Mon Jan 21, 2008 7:00 am
- Location: Mannheim, Germany
- Contact:
-
DeKlod
Re: Problem 157
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
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