Back to all chapters
# Discrete Mathematics Warmups

If there are only a handful of objects, then you can count them with a moment's thought, but the techniques of combinatorics can extend to quickly and efficiently tabulating astronomical quantities.

**Bonus**: Generalize this to \(n\) points.

The pirate decides to set \(10\) of them free. The \(20\) men are randomly divided into \(10\) pairs. Each pair of men then flip a fair coin to decide who goes free.

The probability that both Jack and Tony are set free is \(\frac{A}{B}\) where \(A\) and \(B\) are co-prime positive integers. Find the value of \(A+B.\)

Consider a \(100\)-sided polygon. If you join any \(4\) of the \(100\) vertices of the polygon, you get a quadrilateral.

How many quadrilaterals can be formed **without** including the sides of the \(100\)-sided polygon?

There is a combination safe with four switches on the front, each with three positions – low, medium, and high. There are \(3^{4} = 81\) possible combinations.

However, this is a cheap safe and only two of the switches actually matter. If you set those two switches right, the safe will open. You do not know which are the important switches or which positions work. What is the minimum number of combinations you must try to **guarantee** that you will open the safe?

×

Problem Loading...

Note Loading...

Set Loading...