[離散] 鴿籠原理的ㄧ題
最近在複習離散數學，看到書中鴿籠原理的ㄧ題
Let A be a set of six positive integers each of which is less
than 15. Show that there must be two distinct subsets of A
whose elements when added up give the same sum.
題意看不是很懂，想請教這題意和證法。
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 218.173.15.41
※ 文章網址: http://www.ptt.cc/bbs/Math/M.1413354110.A.2AA.html
※ 編輯: netsphere (218.173.15.41), 10/15/2014 14:23:03
討論串 (同標題文章)