Olympiad problems

2020/2021 Tournament of Towns, P2

Tags: geometry , algebra , polynomial , Vieta , Tournament of Towns , ToT , Baron Munchausen

Baron Munchausen presented a new theorem: if a polynomial $x^{n} - ax^{n-1} + bx^{n-2}+ \dots$ has $n$ positive integer roots then there exist $a$ lines in the plane such that they have exactly $b$ intersection points. Is the baron’s theorem true?

2010 Tuymaada Olympiad, 1

Tags: quadratics , calculus , integration , algebra , polynomial , algebra unsolved , Baron Munchausen

Baron Münchausen boasts that he knows a remarkable quadratic triniomial with positive coefficients. The trinomial has an integral root; if all of its coefficients are increased by $1$, the resulting trinomial also has an integral root; and if all of its coefficients are also increased by $1$, the new trinomial, too, has an integral root. Can this be true?

2022/2023 Tournament of Towns, P3

Tags: combinatorics , geometry , Tournament of Towns , Baron Munchausen

Baron Munchausen claims that he has drawn a polygon and chosen a point inside the polygon in such a way that any line passing through the chosen point divides the polygon into three polygons. Could the Baron’s claim be correct?

2022 Saint Petersburg Mathematical Olympiad, 7

Tags: combinatorics , Baron Munchausen

Given is a set of $2n$ cards numbered $1,2, \cdots, n$, each number appears twice. The cards are put on a table with the face down. A set of cards is called good if no card appears twice. Baron Munchausen claims that he can specify $80$ sets of $n$ cards, of which at least one is sure to be good. What is the maximal $n$ for which the Baron's words could be true?

2010 Tournament Of Towns, 4

Tags: algebra , polynomial , algebra unsolved , Baron Munchausen

Assume that $P(x)$ is a polynomial with integer non negative coefficients, different from constant. Baron Munchausen claims that he can restore $P(x)$ provided he knows the values of $P(2)$ and $P(P(2))$ only. Is the baron's claim valid?

2008 Tournament Of Towns, 4

Tags: combinatorics proposed , combinatorics , Baron Munchausen

Baron Munchausen claims that he got a map of a country that consists of five cities. Each two cities are connected by a direct road. Each road intersects no more than one another road (and no more than once). On the map, the roads are colored in yellow or red, and while circling any city (along its border) one can notice that the colors of crossed roads alternate. Can Baron's claim be true?

2011 Tournament of Towns, 3

Tags: combinatorics , Baron Munchausen

Baron Munchausen has a set of $50$ coins. The mass of each is a distinct positive integer not exceeding $100$, and the total mass is even. The Baron claims that it is not possible to divide the coins into two piles with equal total mass. Can the Baron be right?