Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Post History

#1: Initial revision by user avatar Peter Taylor‭ · 2022-01-25T09:23:44Z (about 2 years ago)
You can rewrite it in different notation with sum limits if you want. You just need to use a different way to express the constraint on which terms to include in the sum. E.g. with the [Iverson bracket](https://en.wikipedia.org/wiki/Iverson_bracket) notation the LHS becomes

$$\sum_{k_1 = 0}^m \sum_{k_2 = 0}^m \cdots \sum_{k_p = 0}^m [k_1+\cdots +k_p = m] {n_1\choose k_1} {n_2\choose k_2} \cdots {n_p\choose k_p}$$