Decomposition of number $n$ is showing $n$ as a sum of positive integers (not neccessarily distinct). Order of addends is important. For every positive integer $n$ show that number of decompositions is $2^{n-1}$
Problem
Source: Regional Olympiad - Federation of Bosnia and Herzegovina 2009
Tags: Decomposition, combinatorics