| |||||||||
IMC2015: Problems on Day 26. Prove that ∞∑n=11√n(n+1)<2. Proposed by Ivan Krijan, University of Zagreb 7. Compute lim Proposed by Jan Šustek, University of Ostrava 8. Consider all 26^{26} words of length 26 in the Latin alphabet. Define the weight of a word as 1/(k+1), where k is the number of letters not used in this word. Prove that the sum of the weights of all words is 3^{75}. Proposed by Fedor Petrov, St. Petersburg State University 9. An n \times n complex matrix A is called \emph{t-normal} if AA^t = A^t A where A^t is the transpose of A. For each n, determine the maximum dimension of a linear space of complex n \times n matrices consisting of t-normal matrices. Proposed by Shachar Carmeli, Weizmann Institute of Science 10. Let n be a positive integer, and let p(x) be a polynomial of degree n with integer coefficients. Prove that \max_{0\le x\le1} \big|p(x)\big| > \frac1{e^n}. Proposed by Géza Kós, Eötvös University, Budapest | |||||||||
© IMC |