MathDB
combinatorics with some sets

Source: IZHO2015 P5

January 15, 2015
inductionfloor functionceiling functioncombinatorics unsolvedbijectionpartitionInteger Partition

Problem Statement

Let An A_n be the set of partitions of the sequence 1,2,...,n 1,2,..., n into several subsequences such that every two neighbouring terms of each subsequence have different parity,and Bn B_n the set of partitions of the sequence 1,2,...,n 1,2,..., n into several subsequences such that all the terms of each subsequence have the same parity ( for example,the partition (1,4,5,8),(2,3),(6,9),(7) {(1,4,5,8),(2,3),(6,9),(7)} is an element of A9 A_9 ,and the partition (1,3,5),(2,4),(6) {(1,3,5),(2,4),(6)} is an element of B6 B_6 ). Prove that for every positive integer n n the sets An A_n and Bn+1 B_{n+1} contain the same number of elements.