## SEEMOUS 2018 – Problems

**Problem 1.** Let be a Riemann integrable function. Show that

**Problem 2.** Let and let the matrices , , , be such that

Prove that .

**Problem 3.** Let such that and , where is the identity matrix. Prove that if then .

**Problem 4.** (a) Let be a polynomial function. Prove that

(b) Let be a function which has a Taylor series expansion at with radius of convergence . Prove that if converges absolutely then converges and

Source: official site of SEEMOUS 2018

**Hints: **1. Just use and . The strict inequality comes from the fact that the Riemann integral of strictly positive function cannot be equal to zero. This problem was too simple…

2. Use the fact that , therefore is symmetric and positive definite. Next, notice that . Notice that is diagonalizable and has eigenvalues among . Since it is also positive definite, cannot be an eigenvalue. This allows to conclude.

3. First note that the commutativity allows us to diagonalize using the same basis. Next, note that both have eigenvalues of modulus one. Then the trace of is simply the sum where are eigenvalues of and , respectively. The fact that the trace equals and the triangle inequality shows that eigenvalues of are a multiple of eigenvalues of . Finish by observing that they have the same eigenvalues.

4. (a) Integrate by parts and use a recurrence. (b) Use (a) and the approximation of a continuous function by polynomials on compacts to conclude.

I’m not sure about what others think, but the problems of this year seemed a bit too straightforward.

## Putnam 2017 A2 – Solution

**Problem A2.** We have the following recurrence relation

for , given and . In order to prove that is always a polynomial with integer coefficients we should prove that divides somehow. Recurrence does not seem to work very well. Also, root based arguments might work, but you need to take good care in the computation.

A simpler idea, which is classic in this context, is to try and linearize the recurrence relation. In order to do this, let’s write two consecutive recurrence relations

We add them and we obtain the following relation

which leads straightforward to a telescoping argument. Finally, we are left with a simple linear recurrence with integer coefficient polynomials, and the result follows immediately.

## Balkan Mathematical Olympiad 2017 – Problems

**Problem 1.** Find all ordered pairs of positive integers such that:

**Problem 2.** Consider an acute-angled triangle with and let be its circumscribed circle. Let and be the tangents to the circle at points and , respectively, and let be their intersection. The straight line passing through the point and parallel to intersects in point . The straight line passing through the point and parallel to intersects in point . The circumcircle of the triangle intersects in , where is located between and . The circumcircle of the triangle intersects the line (or its extension) in , where is located between and .

Prove that , , and are concurrent.

**Problem 3.** Let denote the set of positive integers. Find all functions such that

for all

**Problem 4.** On a circular table sit students. First, each student has just one candy. At each step, each student chooses one of the following actions:

- (A) Gives a candy to the student sitting on his left or to the student sitting on his right.
- (B) Separates all its candies in two, possibly empty, sets and gives one set to the student sitting on his left and the other to the student sitting on his right.

At each step, students perform the actions they have chosen at the same time. A distribution of candy is called legitimate if it can occur after a finite number of steps. Find the number of legitimate distributions.

(Two distributions are different if there is a student who has a different number of candy in each of these distributions.)

Source: AoPS

## IMC 2016 – Day 2 – Problem 8

**Problem 8.** Let be a positive integer and denote by the ring of integers modulo . Suppose that there exists a function satisfying the following three properties:

- (i) ,
- (ii) ,
- (iii) for all .

Prove that modulo .

## IMC 2016 – Day 1 – Problem 2

**Problem 2.** Let and be positive integers. A sequence of matrices is *preferred* by Ivan the Confessor if for , but for with . Show that if in al preferred sequences and give an example of a preferred sequence with for each .

## Balkan Mathematical Olympiad – 2016 Problems

**Problem 1.** Find all injective functions such that for every real number and every positive integer ,

**Problem 2.** Let be a cyclic quadrilateral with . The diagonals intersect at the point and lines and intersect at the point . Let and be the orthogonal projections of onto lines and respectively, and let , and be the midpoints of , and respectively. Prove that the second intersection point of the circumcircles of triangles and lies on the segment .

**Problem 3.** Find all monic polynomials with integer coefficients satisfying the following condition: there exists a positive integer such that divides for every prime for which is a positive integer.

**Problem 4.** The plane is divided into squares by two sets of parallel lines, forming an infinite grid. Each unit square is coloured with one of colours so that no rectangle with perimeter contains two squares of the same colour. Show that no rectangle of size or contains two squares of the same colour.

## SEEMOUS 2016 – Problems

**Problem 1.** Let be a continuous and decreasing real valued function defined on . Prove that

When do we have equality?

**Problem 2.** a) Prove that for every matrix there exists a matrix such that .

b) Prove that there exists a matrix such that for all .

**Problem 3.** Let be idempotent matrices () in . Prove that

where and is the set of matrices with real entries.

**Problem 4.** Let be an integer and set

Prove that

a)

b) .

Some hints follow.