Problems
Day 1
Determine all pairs satisfying (proposed by Mike Daas, Universiteit Leiden)
For let where denotes the natural logarithm. Find .
(proposed by Sergey Chernov, Belarusian State University, Minsk)
For which positive integers does there exist an matrix whose entries are all in , such that is the matrix of all ones?
(proposed by Alex Avdiushenko, Neapolis University Paphos, Cyprus)
Let and be two distinct elements of a group , and let be a positive integer. Consider a sequence which is not eventually periodic and where each is either or . Denote by the subgroup of generated by all elements of the form with . Prove that does not depend on the choice of the sequence (but may depend on ).
(proposed by Ivan Mitrofanov, Saarland University)
Let be positive integers. Choose independent, uniformly distributed random points in the unit ball centered at the origin. For a point denote by the probability that the convex hull of contains . Prove that if and the distance of from the origin is smaller than the distance of from the origin, then .
(proposed by Fedor Petrov, St Petersburg State University)
Day 2
Prove that for any function , there exist such that , , and .
(proposed by Mehdi Golafshan & Markus A. Whiteland, University of Liège, Liège)
Let be a positive integer. Suppose that and are invertible matrices with complex entries such that (where is the identity matrix) and Find all possible values of for the given .
(proposed by Sergey Bondarev, Sergey Chernov, Belarusian State University, Minsk)
Define the sequence by the initial terms , , and the recurrence relation Prove that exists and satisfies (proposed by Karen Keryan, Yerevan State University & American University of Armenia, Armenia)
A matrix is called nice, if it has the following properties:
(i) the set of all entries of is for some integer ;
(ii) the entries are non-decreasing in every row and in every column: and ;
(iii) equal entries can appear only in the same row or the same column: if , then either or ;
(iv) for each , there exist and such that and .
Prove that for any positive integers and , the number of nice matrices is even.
For example, the only two nice matrices are and .
(proposed by Fedor Petrov, St Petersburg State University)
We say that a square-free positive integer is almost prime if for all integers , where are all the positive divisors of . Suppose that is a Fermat prime (i.e. it is a prime of the form for an integer ), is a prime divisor of an almost prime integer , and . Show that, with the above notation, for all .
(An integer is called square-free if it is not divisible by for any integer .)
(proposed by Tigran Hakobyan, Yerevan State University, Vanadzor, Armenia)