IMOmath

Combinatorics

1. (22 p.)
At the basement of a building with 5 floors, Adam, Bob, Cindy, Diana and Ernest entered the elevator. The elevator goes only up and doesn’t come back, and each person gets out of the elevator at one of the five floors. In how many ways can the five people leave the elevator in such a way that at no time are there a male and a female alone in the elevator?

2. (17 p.)
We are given an unfair coin. When the coin is tossed, the probability of heads is 0.4. The coin is tossed 10 times. Let \( a_n \) be the number of heads in the first \( n \) tosses. Let \( P \) be the probability that \( a_n/n \leq 0.4 \) for \( n = 1, 2, \dots , 9 \) and \( a_{10}/10 = 0.4 \). Evaluate \( \frac{P\cdot 10^{10}}{24^4} \).

3. (19 p.)
A bug moves around a triangle wire. At each vertex it has 1/2 chance of moving towards each of the other two vertices. The probability that after crawling along 10 edges it reaches its starting point can be expressed as \( p/q \) for positive relatively prime integers \( p \) and \( q \). Determine \( p+q \).

4. (36 p.)
Bob is making partitions of \( 10 \), but he hates even numbers, so he splits \( 10 \) up in a special way. He starts with \( 10 \), and at each step he takes every even number in the partition and replaces it with a random pair of two smaller positive integers that sum to that even integer. For example, \( 6 \) could be replaced with \( 1+5 \), \( 2+4 \), or \( 3+3 \) all with equal probability. He terminates this process when all the numbers in his list are odd. The expected number of integers in his list at the end can be expressed in the form \( \frac{m}{n} \), where \( m \) and \( n \) are relatively prime positive integers. Find \( m+n \).

5. (4 p.)
Let \( S = \{1, 2, 3, 5, 8, 13, 21, 34\} \). Find the sum \( \sum \max(A) \) where the sum is taken over all 28 two-element subsets \( A \) of \( S \).





2005-2018 IMOmath.com | imomath"at"gmail.com | Math rendered by MathJax
Home | Olympiads | Book | Training | IMO Results | Forum | Links | About | Contact us