Pascal’s Rule and double induction


If S is a set with \#S=n and T\subset S such that \#T=k then there are {n\choose k} different of them.

Follow the link pascalbernoulli for a double induction proof.

Leave a comment

Filed under math

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s