Ramsey partitions of integers and pair divisions

Ifk ₁ andk ₂ are positive integers, the partitionP = (₁,₂,..., _n ) ofk ₁+k ₂ is said to be a Ramsey partition for the pairk ₁,k ₂ if for any sublistL ofP, either there is a sublist ofL which sums tok ₁ or a sublist ofP –L which sums tok ₂. Properties of Ramsey partitions are discussed. In particular it is shown that there is a unique Ramsey partition fork ₁,k ₂ having the smallest numbern of terms, and in this casen is one more than the sum of the quotients in the Euclidean algorithm fork ₁ andk ₂.An application of Ramsey partitions to the following fair division problem is also discussed: Suppose two persons are to divide a cake fairly in the ratiok ₁k ₂. This can be done trivially usingk ₁+k ₂-1 cuts. However, every Ramsey partition ofk ₁+k ₂ also yields a fair division algorithm. This method yields fewer cuts except whenk ₁=1 andk ₂=1, 2 or 4.