MathLabs

第4問

A magician has one hundred cards 数ed 11 へ100100. He puts them inへthree boxes, red, white およびblue, 各nonempty. A member selects two boxes, chooses one card からeach, およびannounces their 和. Given thは和, magician identifies box からwhich no card was chosen. How many assignments のcards へthree boxes make thはalways possible?
ステップ 2/5: 用いる 和set bound
∣X+Y∣≥∣X∣+∣Y∣−1.|X+Y|\ge|X|+|Y|-1.
詳しい解説

適用 standard finite-set 和set inequality へthree boxes.