Scribd
Upload
8 views

IMC-2012

Uploaded by

Chandan kumar Mohanta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

IMC-2012

Uploaded by

Chandan kumar Mohanta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

18th IMC Competition

2012

A1. For every positive integer n, let p(n) denote the number of ways to
express n as a sum of positive integers. For instance, p(4) = 5 because
4 = 3 + 1 = 2 + 2 = 2 + 1 + 1 = 1 + 1 + 1 + 1. Also define p(0) = 1.
Prove that p(n) − p(n − 1) is the number of ways to express n as a sum
of integers each of which is strictly greater than 1.

A2. Let n be a fixed positive integer. Determine the smallest possible rank
of an n × n matrix that has zeros along the main diagonal and strictly
positive real numbers off the main diagonal.

A3. Given an integer n > 1, let Sn be the group of permutations of the


numbers 1, 2, . . . , n. Two players, A and B, play the following game.
Taking turns, they select elements (one element at a time) from the
group Sn . It is forbidden to select an element that has already been
selected. The game ends when the selected elements generate the whole
group Sn . The player who made the last move loses the game. The
first move is made by A. Which player has a winning strategy?

A4. Let f : R → R be a continuously differentiable function that satises


f (t) > f (f (t)) for all t ∈ R. Prove that f (f (f (t))) ≤ 0 for all t ≥ 0.

A5. Let a be a rational number and let n be a positive integer. Prove that
n n
the polynomial X 2 (X + a)2 + 1 is irreducible in the ring Q[X] of
polynomials with rational coefficients.

B1. Consider a polynomial

f (x) = x2012 + a2011 x2011 + · · · + a1 x + a0 .

Albert Einstein and Homer Simpson are playing the following game.
In turn, they choose one of the coeffcients a0 , . . . , a2011 and assign a
real value to it. Albert has the first move. Once a value is assigned to
a coeffcient, it cannot be changed any more. The game ends after all
the coefficients have been assigned values. Homers goal is to make f (x)
divisible by a fixed polynomial m(x) and Alberts goal is to prevent this.

(a) Which of the players has a winning strategy if m(x) = x − 2012?


(b) Which of the players has a winning strategy if m(x) = x2 + 1?
1
B2. Define the sequence a0 , a1 , . . . inductively by a0 = 1, a1 = 2
and

na2n
an+1 = for n ≥ 1.
1 + (n + 1)an
P∞ ak+1
Show that the series k=0 ak
converges and determine its value.

B3. Is the set of positive integers n such that n! + 1 divides (2012n)! finite
or infinite?

B4. Let n ≥ 2 be an integer. Find all real numbers a such that there exist
real numbers x1 , . . . , xn satisfying

x1 (1 − x2 ) = x2 (1 − x3 ) = · · · = xn−1 (1 − xn ) = xn (1 − x1 ) = a.

B5. Let c ≥ 1 be a real number. Let G be an abelian group and let A ⊂ G


be a nite set satisfying |A + A| ≤ c|A|, where X + Y := {x + y | x ∈
X, y ∈ Y } and |Z| denotes the cardinality of Z. Prove that

|A + A + · · · + A| ≤ ck |A|

for every positive integer k.

You might also like