[理工] [離散]-92清大-資應所

[mqazz1 (無法顯示)]

determine the number of ways to distribute 2t+1 indistinguishable coins to

three boys so that

any two boys together will have more coins that the other one


請問這題用排列組合要怎麼解?

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 61.228.29.35
推 cakeboy:不知道可不可以x1+x2+x3=2t+1 x1<x2<=x3
推 hunter0904:任兩個都不會比對方多嗎? that是than嗎?
→ hunter0904:這樣X1會=X2=X3???
→ hunter0904:看錯了= =
推 juan19283746:應該就是三個的範圍都介在1~t  然後相加=2t+1
→ qk211:我跟樓上想的一樣