Problems
Day 1
Let and be two sequences of positive numbers. Show that the following statements are equivalent:
(1) There is a sequence of positive numbers such that and both converge;
(2) converges.
(Proposed by Tomáš Bárta, Charles University, Prague)
Does there exist a field such that its multiplicative group is isomorphic to its additive group?
(Proposed by Alexandre Chapovalov, New York University, Abu Dhabi)
Determine all rational numbers for which the matrix is the square of a matrix with all rational entries.
(Proposed by Daniël Kroes, University of California, San Diego)
Find all differentiable functions such that (Proposed by Orif Ibrogimov, National University of Uzbekistan)
Let and be prime numbers with . Suppose that in a convex polygon all angles are equal and the side lengths are distinct positive integers. Prove that holds for every integer with .
(Proposed by Ander Lamaison Vidarte, Berlin Mathematical School, Berlin)
Day 2
Let be a positive integer. Find the smallest positive integer for which there exist nonzero vectors in such that for every pair of indices with the vectors and are orthogonal.
(Proposed by Alexey Balitskiy, Moscow Institute of Physics and Technology and M.I.T.)
Let be a sequence of real numbers such that and Prove that the following series is convergent: (Proposed by Orif Ibrogimov, National University of Uzbekistan)
Let . A frog moves along the points of by jumps of length 1. For every positive integer , determine the number of paths the frog can take to reach starting from in exactly jumps.
(Proposed by Fedor Petrov and Anatoly Vershik, St. Petersburg State University)
Determine all pairs , of complex polynomials with leading coefficient 1 such that divides and divides .
(Proposed by Rodrigo Angelo, Princeton University and Matheus Secco, PUC, Rio de Janeiro)
For let . Compute (Proposed by Rodrigo Angelo, Princeton University and Matheus Secco, PUC, Rio de Janeiro)