[理工] [離散]-成大電通97-電通甲

看板Grad-ProbAsk作者 (I'dont kown)時間12年前 (2012/02/20 21:01), 編輯推噓4(404)
留言8則, 4人參與, 最新討論串1/2 (看更多)
2. Find the number of n-digital words renerated from the alphabet{0,1,2,3,4} in each of which the total number of 0's and 1's is even. 請問這樣怎麼求出來? -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 175.98.50.200

02/20 21:20, , 1F
遞迴或指數生成函數吧
02/20 21:20, 1F

02/20 21:32, , 2F
我有想過,但一次要討論0和1就不太曉得了
02/20 21:32, 2F

02/20 21:47, , 3F
0 1 都偶 AND 0 1 都奇
02/20 21:47, 3F

02/20 22:44, , 4F
我用遞迴解也是卡住
02/20 22:44, 4F

02/20 22:45, , 5F
用生成函數解出來是 1/4*(1+5^n+2*3^n)
02/20 22:45, 5F

02/20 23:07, , 6F
最後會變((e^x)^3)((e^x+e^-x)/2)^2
02/20 23:07, 6F

02/20 23:07, , 7F
=(e^5x + 2e^3x + e^x)/4
02/20 23:07, 7F

02/20 23:08, , 8F
應該?
02/20 23:08, 8F
文章代碼(AID): #1FGaGhqE (Grad-ProbAsk)
文章代碼(AID): #1FGaGhqE (Grad-ProbAsk)