- Hands-On Mathematics for Deep Learning
- Jay Dawani
- 146字
- 2021-06-18 18:55:22
Multinomial coefficient
We know from the binomial theorem (which you likely learned in high school) that the following is true:

Then, the trinomial is as follows:

Say we have n pieces of candy and there are blue- and red-colored candies. The different ways that we can pick the candies is defined as , which is read as n choose k.
The multinomial coefficient is as follows:

This way, we spread n items over k positions, where the ith position has ni items.
For example, say we're playing cards and we have four players. A deck of cards has 52 cards and we deal 13 cards to each player. So, the number of possible ways that we can distribute the cards is as follows:

This is absolutely massive!
This is where Stirling's formula comes to the rescue. It allows us to approximate the answer.
- 數據庫基礎與應用:Access 2010
- App+軟件+游戲+網站界面設計教程
- Modern Programming: Object Oriented Programming and Best Practices
- 大數據算法
- 區塊鏈通俗讀本
- Lean Mobile App Development
- Hadoop大數據實戰權威指南(第2版)
- 深入淺出MySQL:數據庫開發、優化與管理維護(第2版)
- Spark大數據編程實用教程
- Apache Kylin權威指南
- TextMate How-to
- 一本書講透Elasticsearch:原理、進階與工程實踐
- 智慧的云計算
- 貫通SQL Server 2008數據庫系統開發
- 改進的群智能算法及其應用