5
Part of 1997 Irish Math Olympiad
Problems(2)
hard exercise
Source: Ireland 1997
7/3/2009
Let be the set of odd integers greater than . For each , denote by the unique integer satisfying the inequality 2^{\delta (x)} , define:
a \ast b\equal{}2^{\delta (a)\minus{}1} (b\minus{}3)\plus{}a.
Prove that if , then:
and
(a \ast b)\ast c\equal{}a \ast (b \ast c).
inequalitiesnumber theory unsolvednumber theory
p-partitionable
Source: Ireland 1997
7/3/2009
Let be an odd prime number and a natural number. Then is called p\minus{}partitionable if T\equal{}\{1,2,...,n \} can be partitioned into (disjoint) subsets with equal sums of elements. For example, is -partitionable since we can take T_1\equal{}\{ 1,6 \}, T_2\equal{}\{ 2,5 \} and T_3\equal{}\{ 3,4 \}.
Suppose that is -partitionable. Prove that divides or n\plus{}1.
Suppose that is divisible by . Prove that is -partitionable.
combinatorics unsolvedcombinatorics