4. Recall that an n-gon is a polygon with n sides. For example, a polygon with 17 sides can be called a 17-gon. A triangle could be called a 3-gon. Find formulas (in terms of n) for the following, and explain why your formulas are valid: a. Number of faces (including the bases) on a prism that has n-gon bases b. Number of edges on a prism that has n-gon bases c.Number of vertices on a prism that has n-gon bases d. Number of faces (including the base) on a pyramid that has an n-gon base e. Number of edges on a pyramid that has an n-gon base f.Number of vertices on a pyramid that has an n-gon base
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.
13.1 #4 parts d, e, and f
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images