You can find combinations in Pascal's triangle. Memorize Pascal's triangle and you have memorized combinations. Here are the first few rows of the triangle. (1); (1, 1); (1, 2, 1); (1, 3, 3, 1). The equivalent of that is these combinations: (1C0); (2C0, 2C1); (3C0, 3C1, 3C2); (4C0, 4C1, 4C2, 4C3). You'll find that the numbers are the same. Permutation is another kind of thing like Combination. Using Combination, the order of the sets don't matter. So, there would be more possible combinations if you were to use permutation, where order of the sets does matter. To make it easier to understand, here's an example: Using C, (4 choose 2), and that's 6 possible combinations. Using P, (4 choose 2), and that's 12 possible combinations, which is more than 6. To memorize these Permutation numbers, say hello to the 3D Pascal's Pyramid! Lol
Clear message, clear structure, easy to understand, thank you
You can find combinations in Pascal's triangle.
Memorize Pascal's triangle and you have memorized combinations. Here are the first few rows of the triangle. (1); (1, 1); (1, 2, 1); (1, 3, 3, 1). The equivalent of that is these combinations: (1C0); (2C0, 2C1); (3C0, 3C1, 3C2); (4C0, 4C1, 4C2, 4C3). You'll find that the numbers are the same. Permutation is another kind of thing like Combination. Using Combination, the order of the sets don't matter. So, there would be more possible combinations if you were to use permutation, where order of the sets does matter. To make it easier to understand, here's an example: Using C, (4 choose 2), and that's 6 possible combinations. Using P, (4 choose 2), and that's 12 possible combinations, which is more than 6. To memorize these Permutation numbers, say hello to the 3D Pascal's Pyramid! Lol
nvm. I got it!
Wait wait wait... What??? Confusing :p
The image is too offensive
peasy
easy