What I have done up to day 4 in Stanford’s Honor Academy Program (Topic 1 and 2)

Permutations: They are problems in which ORDER MATTERS to find a solution. Here is the formula:   With repetition: N^r             Without: n! / ( n – r )!       Examples: Combination lock (with repeats) and pool game (without repeats)

Image                                                Image

Combinations: They are problems in which ORDER DOESN’T MATTER. The formula is:

Without Repeats: n! / r! (n – r)!

With Repeats: (n + r – 1)! / r! (n – 1)!

Sorry, but I couldn’t find examples for the combinations

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 )

Google photo

You are commenting using your Google 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 )

Connecting to %s