« Vrati se
Find the number of partitions of the set \{1, 2, \cdots, n\} into three subsets A_1,A_2,A_3, some of which may be empty, such that the following conditions are satisfied:

(i) After the elements of every subset have been put in ascending order, every two consecutive elements of any subset have different parity.

(ii) If A_1,A_2,A_3 are all nonempty, then in exactly one of them the minimal number is even .

Proposed by Poland.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
1707IMO Shortlist 1987 problem 230
1693IMO Shortlist 1987 problem 90
1691IMO Shortlist 1987 problem 70
1259IMO Shortlist 1967 problem 31
1240IMO Shortlist 1966 problem 570
1237IMO Shortlist 1966 problem 540