Sign up to access problem solutions.

Already have an account? Log in here.

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. See more

Three points are chosen randomly from the circumference of a circle. What is the probability that they lie on a common semicircle?

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

Sign up to access problem solutions.

Already have an account? Log in here.

\(20\) men are held captive by a pirate lord, including two friends Jack and Tony.

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.\)

Sign up to access problem solutions.

Already have an account? Log in here.

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?

Sign up to access problem solutions.

Already have an account? Log in here.

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?

Sign up to access problem solutions.

Already have an account? Log in here.

Sign up to access problem solutions.

Already have an account? Log in here.

×

Problem Loading...

Note Loading...

Set Loading...