How to count allocation schemes

Example 3:Solutions to constrained integer equations

Q. A twist: what if the solutions must be strictly positive?

A. First give every “pirate” his required 1 “gold bar”.

Then count the ways to distribute the remaining 10-3=7 “gold bars”:

Previous slide

Next slide

Back to first slide

View graphic version