combinatorics with some sets
Source: IZHO2015 P5
January 15, 2015
inductionfloor functionceiling functioncombinatorics unsolvedbijectionpartitionInteger Partition
Problem Statement
Let be the set of partitions of the sequence into several subsequences such that every two neighbouring terms of each subsequence have different parity,and the set of partitions of the sequence into several subsequences such that all the terms of each subsequence have the same parity ( for example,the partition is an element of ,and the partition is an element of ).
Prove that for every positive integer the sets and contain the same number of elements.