[問題] 離散數學
(a) Find the number of n-dight words generated from the alphabet {0,1,2}
in each of which none of the dights appears exactly three times.
(b) Find the number of n-dight words generated 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: 140.114.216.145
討論串 (同標題文章)