You want to hike an entire subrange. Assuming you summit exactly one mountain with each hike, what is the fewest number of hikes necessary to hike an entire subrange? Briefly justify the answer. Your friend wants to hike all 10 mountains. To decide the order, they will pick a new mountain of a hat each week (they don't replace the mountain, once it is hiked they move on to a new one until they get all 10). After how many hikes will they be guaranteed to hike an entire subrange? Justify your answer. Hint: It may help to first determine the subranges.
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.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps