1) a) far t E {0,1,2,} Comider the fa tE{0,,2,.} Conider the al fference equiim Xerg + 4Xeれ + Xt+i+ Gue=16 1) End the gureral schuhion of ths oquhim. ") Deteimine au walmes af of the sn-hön for which Appecing in you goeal. M 200 as b) Cqiven 3 dimentional veehr Space V, Comfder. of ソ-{un,ue] cv Lirew inceperndant Set reetars Let w EV be nechr that dres not Wieoe Spn of the fut Y. the fut 2 ={u, un, w} cVs is time Prave that indlependont Set.
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.
Step by step
Solved in 4 steps with 4 images
