2
$\begingroup$

Recently I encountered a problem I was not familiar with. So hope someone can help me for this.

Here is the problem. Given any odd integer, how many different ways of decomposition into sum of three differetn positive odd number?

  • 0
    Hint: Consider that you can first consider in how many ways you can write your number as a sum of an odd and an even number. And then compute how many ways you have to write an even number as the sum of two odd numbers. And then I have a question, do you want to distinguish sums which differ only by the order of the addends?2012-11-08

3 Answers 3