IMC 2012
All the problems of the year on one page, as on the contest paper.
Official files
- Day 1: problems (PDF)
- Day 1: solutions (PDF)
- Day 2: problems (PDF)
- Day 2: solutions (PDF)
Problem 1 (Day 1)
For every positive integer , let denote the number of ways to express as a sum of positive integers. For instance, because
Also define .
Prove that is the number of ways to express as a sum of integers each of which is strictly greater than .
Problem 2 (Day 1)
Let be a fixed positive integer. Determine the smallest possible rank of an matrix that has zeros along the main diagonal and strictly positive real numbers off the main diagonal.
Problem 3 (Day 1)
Given an integer , let be the group of permutations of the numbers . Two players, A and B, play the following game. Taking turns, they select elements (one element at a time) from the group . It is forbidden to select an element that has already been selected. The game ends when the selected elements generate the whole group . The player who made the last move loses the game. The first move is made by A. Which player has a winning strategy?
Problem 4 (Day 1)
Let be a continuously differentiable function that satisfies for all . Prove that for all .
Problem 5 (Day 1)
Let be a rational number and let be a positive integer. Prove that the polynomial is irreducible in the ring of polynomials with rational coefficients.
Problem 1 (Day 2)
Consider a polynomial
Albert Einstein and Homer Simpson are playing the following game. In turn, they choose one of the coefficients and assign a real value to it. Albert has the first move. Once a value is assigned to a coefficient, it cannot be changed any more. The game ends after all the coefficients have been assigned values.
Homer's goal is to make divisible by a fixed polynomial and Albert's goal is to prevent this.
(a) Which of the players has a winning strategy if ?
(b) Which of the players has a winning strategy if ?
Problem 2 (Day 2)
Define the sequence inductively by , and
Show that the series converges and determine its value.
Problem 3 (Day 2)
Is the set of positive integers such that divides finite or infinite?
Problem 4 (Day 2)
Let be an integer. Find all real numbers such that there exist real numbers satisfying
Problem 5 (Day 2)
Let be a real number. Let be an abelian group and let be a finite set satisfying , where and denotes the cardinality of . Prove that
for every positive integer .