An Oddition Problem

There are 3 ways to write 4 as a sum of odd numbers (assuming order matters and numbers can be repeated in the sum): 3 + 1 3 + 1 , 1 + 3 1 + 3 , and 1 + 1 + 1 + 1 1 + 1 + 1 + 1 .

How many ways are there to write 20 as a sum of odd numbers?


The answer is 6765.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Vishnu Bhagyanath
Mar 12, 2016

Relevant wiki: Partition of an Integer

It's interesting to note that the n th \text{n}^{\text{th}} fibonacci number corresponds to the number of composition of n n into odd parts. Proof - Page 259

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...