News for hackers. Stuff that matters.
Re:What Every Programmer Should Know About Enumerative Combi... by rck on Sunday May 18, 2025 @09:11AM (#44021169)
Just about everything that a non-specialist in combinatorics needs to know about counting can be found in Rota's twelvefold way, which lists the 12 counting problems that you can define for finite sets and shows how to solve them:

https://en.wikipedia.org/wiki/Twelvefold_way

This also takes care of most of discrete probability.

There are no comments on this comment yet.