A combination lock will open if a right choice of three numbers (from
\(1\) to
\(9\)) is selected.
Suppose that we use a brute force attack to open the lock (we try all possibilities). To try one
code takes \(20\)
seconds. What is the maximal time (in seconds) required to open the lock by brute
force?
The king has eight daughters. A dragon asks two daughters, otherwise he will
destroy the whole country. In how many ways can we choose a pair of king's
daughters for the dragon?
A bowl contains \(12\) different
gummy-bears and \(20\)
different sweet-drops. Anne can choose either one sweet-drop or one gummy-bear.
From the rest, Jane can choose one sweet-drop and two gummy-bears. Anne wants to
provide a maximum of the possibilities for Jane's choice. What should Anne choose?
There are seven different yellow apples, eight different green apples and ten different
red apples. How many ways are there to choose three apples, if we wish to have three
apples of different colors?
There are four paths from a city to the top of nearby mountain. Find the number of
possible treks from the city to the mountain and back, if it is required to use one
path up and another one down.