IMOmath

Combinatorics

1. (5 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 \).

2. (22 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 \).

3. (8 p.)
Given a regular 12-gon D, determine the number of squares that have two or more vertices among the vertices of D.

4. (22 p.)
A frog is jumping in the coordinate plane according to the following rules: (i) From any lattice point \( (a,b) \), the frog can jump to \( (a+1,b) \), \( (a,b+1) \), or \( (a+1,b+1) \). (ii) There are no right angle turns in the frog’s path. How many different paths can the frog take from \( (0,0) \) to \( (5,5) \)?

5. (42 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 \).





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