Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
((Determine if 1781 is divisible by 3, 6, 7, 8, and 9. ))
((Determine if each of the following numbers is a prime or composite.))
6. 828
7. 1666
8. 1781
9. 1125
10. 107
((Find the greatest common divisor of each of the following pairs of integers.))
11. 60 and 100
12. 45 and 33
13. 34 and 58
14. 77 and 128
15. 98 and 273
((Find the least common multiple of each of the following pairs of integers.))
16. 72 and 108
17. 175 and 245
18. 150 and 70
19. 32 and 27
20. 540 and 504
Step by step
Solved in 3 steps
