[理工] 離散 排列問題
Consider the permutations of 1, 2, 3, 4. The permutation 1432 is said to have
one ascent (since 1<4) and two descents (since 4>3 and 3>2). Suppose a
permutation of 1, 2,3, ... ,m has k ascents, for 0<=k<=m-1. How many descents
does the permutation have?
102成大資工數學的題目 不知正確答案為何 我算的答案是m-1-k
但是覺得似乎太容易些 所以請教大家一下
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.26.71.193
→
09/03 23:02, , 1F
09/03 23:02, 1F
→
09/03 23:06, , 2F
09/03 23:06, 2F
→
09/03 23:07, , 3F
09/03 23:07, 3F
討論串 (同標題文章)