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?
ステップ 4/5: 翻訳：Classify equality
前のステップ次のステップ
A,B,C are common-difference progressions or two are singletons.A,B,C\text{ are common-difference progressions or two are singletons}.
詳しい解説

The equality characterizati上のgives these two cases.