This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 2

2004 Nicolae Păun, 1
Prove that any function that maps the integers to themselves is a sum of any finite number of injective functions that map the integers to themselves. [i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]
function injectivity decomposition algebra bijection mathematical induction

2009 Bosnia And Herzegovina - Regional Olympiad, 3
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}$
combinatorics decomposition number theory