Found problems: 15925
2012 Mathcenter Contest + Longlist, 5 sl13
Define $f : \mathbb{R}^+ \rightarrow \mathbb{R}$ as the strictly increasing function such that
$$f(\sqrt{xy})=\frac{f(x)+f(y)}{2}$$ for all positive real numbers $x,y$. Prove that there are some positive real numbers $a$ where $f(a)<0$.
[i] (PP-nine) [/i]
2000 Estonia National Olympiad, 2
Which of the numbers $2^{2002}$ and $2000^{200}$ is bigger?
2003 Portugal MO, 6
Given six irrational numbers, will it be possible to choose three such that the sum of any two of these three is irrational?
2013 China National Olympiad, 2
Find all nonempty sets $S$ of integers such that $3m-2n \in S$ for all (not necessarily distinct) $m,n \in S$.
2018 Math Hour Olympiad, 6-7
[u]Round 1[/u]
[b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games?
(Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.)
[b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year?
[b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle?
[b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may
1. move the next ball in line from the input tube into the upper left square of the board,
2. move a ball already on the board to an adjacent square to its right or below, or
3. move a ball from the lower right square into the exit tube.
No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start.
[img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img]
[b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board?
[img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img]
[u]Round 2[/u]
[b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament.
[b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2009 Today's Calculation Of Integral, 428
Let $ f(x)$ be a polynomial and $ C$ be a real number.
Find the $ f(x)$ and $ C$ such that $ \int_0^x f(y)dy\plus{}\int_0^1 (x\plus{}y)^2f(y)dy\equal{}x^2\plus{}C$.
1975 Canada National Olympiad, 7
A function $ f(x)$ is [i]periodic[/i] if there is a positive number $ p$ such that $ f(x\plus{}p) \equal{} f(x)$ for all $ x$. For example, $ \sin x$ is periodic with period $ 2 \pi$. Is the function $ \sin(x^2)$ periodic? Prove your assertion.
1995 Niels Henrik Abels Math Contest (Norwegian Math Olympiad) Round 2, 10
Let $ p(x) \equal{} x^6 \plus{} ax^5 \plus{} bx^4 \plus{} cx^3 \plus{} dx^2 \plus{} ex \plus{} f$ be a polynomial such that $ p(1) \equal{} 1, p(2) \equal{} 2, p(3) \equal{} 3, p(4) \equal{} 4, p(5) \equal{} 5,$ and $ p(6) \equal{} 6.$ What is $ p(7)$?
A. 0
B. 7
C. 14
D. 49
E. 727
Russian TST 2022, P3
Let $n\geqslant 1$ be an integer, and let $x_0,x_1,\ldots,x_{n+1}$ be $n+2$ non-negative real numbers that satisfy $x_ix_{i+1}-x_{i-1}^2\geqslant 1$ for all $i=1,2,\ldots,n.$ Show that \[x_0+x_1+\cdots+x_n+x_{n+1}>\bigg(\frac{2n}{3}\bigg)^{3/2}.\][i]Pakawut Jiradilok and Wijit Yangjit, Thailand[/i]
2022 Belarusian National Olympiad, 9.8
Does there exist a polynomial $p(x)$ with integer coefficients for which
$$p(\sqrt{2})=\sqrt{2}$$
$$p(2\sqrt{2})=2\sqrt{2}+2$$
1962 Leningrad Math Olympiad, grade 6
[b]6.1 [/b] Three people with one double seater motorbike simultaneously headed from city A to city B . How should they act so that time, for which the last of them will get to , was the smallest? Determine this time. Pedestrian speed - 5 km/h, motorcycle speed - 45 km/h, distance from A to B is equal to 60 kilometers .
[b]6.2 / 7.2[/b] The numbers $A$ and $B$ are relatively prime. What common divisors can have the numbers $A+B$ and $A-B$?
[b]6.3.[/b] A person's age in $1962$ was one more than the sum of digits of the year of his birth. How old is he?
[b]6.4. / 7.3[/b] $15$ magazines lie on the table, completely covering it. Prove that it is possible to remove eight of them so that the remaining magz cover at least $7/15$ of the table area.
[b]6.5.[/b] Prove that a $201 \times 201$ chessboard can be bypassed by moving a chess knight, visiting each square exactly once.
[b]6.6.[/b] Can an integer whose last two digits are odd be the square of another integer?
PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983459_1962_leningrad_math_olympiad]here[/url].
2008 China Team Selection Test, 2
Let $ x,y,z$ be positive real numbers, show that $ \frac {xy}{z} \plus{} \frac {yz}{x} \plus{} \frac {zx}{y} > 2\sqrt [3]{x^3 \plus{} y^3 \plus{} z^3}.$
DMM Individual Rounds, 2017 Tie
[b]p1.[/b] Find the sum of all $3$-digit positive integers $\overline{abc}$ that satisfy $$\overline{abc} = {n \choose a}+{n \choose b}+ {n \choose c}$$ for some $n \le 10$.
[b]p2.[/b] Feng and Trung play a game. Feng chooses an integer $p$ from $1$ to $90$, and Trung tries to guess it. In each round, Trung asks Feng two yes-or-no questions about $p$. Feng must answer one question truthfully and one question untruthfully. After $15$ rounds, Trung concludes there are n possible values for $p$. What is the least possible value of $n$, assuming Feng chooses the best strategy to prevent Trung from guessing correctly?
[b]p3.[/b] A hypercube $H_n$ is an $n$-dimensional analogue of a cube. Its vertices are all the points $(x_1, .., x_n)$ that satisfy $x_i = 0$ or $1$ for all $1 \le i \le n$ and its edges are all segments that connect two adjacent vertices. (Two vertices are adjacent if their coordinates differ at exactly one $x_i$ . For example, $(0,0,0,0)$ and $(0,0,0,1)$ are adjacent on $H_4$.) Let $\phi (H_n)$ be the number of cubes formed by the edges and vertices of $H_n$. Find $\phi (H_4) + \phi (H_5)$.
[b]p4.[/b] Denote the legs of a right triangle as $a$ and $b$, the radius of the circumscribed circle as $R$ and the radius of the inscribed circle as $r$. Find $\frac{a+b}{R+r}$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2005 All-Russian Olympiad, 3
Given three reals $a_1,\,a_2,\,a_3>1,\,S=a_1+a_2+a_3$. Provided ${a_i^2\over a_i-1}>S$ for every $i=1,\,2,\,3$ prove that \[\frac{1}{a_1+a_2}+\frac{1}{a_2+a_3}+\frac{1}{a_3+a_1}>1.\]
2021 Middle European Mathematical Olympiad, 1
Determine all functions $f: \mathbb{R} \to \mathbb{R}$ such that the inequality
\[ f(x^2)-f(y^2) \le (f(x)+y)(x-f(y)) \]
holds for all real numbers $x$ and $y$.
1950 Poland - Second Round, 2
Prove that if $a > 0$, $b > 0$, $abc=1$, then
$$a+b+c \ge 3$$
2013 Canada National Olympiad, 4
Let $n$ be a positive integer. For any positive integer $j$ and positive real number $r$, define $f_j(r)$ and $g_j(r)$ by
\[f_j(r) = \min (jr, n) + \min\left(\frac{j}{r}, n\right), \text{ and } g_j(r) = \min (\lceil jr\rceil, n) + \min \left(\left\lceil\frac{j}{r}\right\rceil, n\right),\]
where $\lceil x\rceil$ denotes the smallest integer greater than or equal to $x$. Prove that
\[\sum_{j=1}^n f_j(r)\leq n^2+n\leq \sum_{j=1}^n g_j(r)\]
for all positive real numbers $r$.
1987 IMO Longlists, 35
Does there exist a set $M$ in usual Euclidean space such that for every plane $\lambda$ the intersection $M \cap \lambda$ is finite and nonempty ?
[i]Proposed by Hungary.[/i]
[hide="Remark"]I'm not sure I'm posting this in a right Forum.[/hide]
2020 IOM, 3
Let $n>1$ be a given integer. The Mint issues coins of $n$ different values $a_1, a_2, ..., a_n$, where each $a_i$ is a positive integer (the number of coins of each value is unlimited). A set of values $\{a_1, a_2,..., a_n\}$ is called [i]lucky[/i], if the sum $a_1+ a_2+...+ a_n$ can be collected in a unique way (namely, by taking one coin of each value).
(a) Prove that there exists a lucky set of values $\{a_1, a_2, ..., a_n\}$ with $$a_1+ a_2+...+ a_n < n \cdot 2^n.$$
(b) Prove that every lucky set of values $\{a_1, a_2,..., a_n\}$ satisfies $$a_1+ a_2+...+ a_n >n \cdot 2^{n-1}.$$
Proposed by Ilya Bogdanov
2006 China Team Selection Test, 3
Let $a_{i}$ and $b_{i}$ ($i=1,2, \cdots, n$) be rational numbers such that for any real number $x$ there is:
\[x^{2}+x+4=\sum_{i=1}^{n}(a_{i}x+b)^{2}\]
Find the least possible value of $n$.
2003 District Olympiad, 3
Let $\displaystyle \mathcal K$ be a finite field such that the polynomial $\displaystyle X^2-5$ is irreducible over $\displaystyle \mathcal K$. Prove that:
(a) $1+1 \neq 0$;
(b) for all $\displaystyle a \in \mathcal K$, the polynomial $\displaystyle X^5+a$ is reducible over $\displaystyle \mathcal K$.
[i]Marian Andronache[/i]
[Edit $1^\circ$] I wanted to post it in "Superior Algebra - Groups, Fields, Rings, Ideals", but I accidentally put it here :blush: Can any mod move it? I'd be very grateful.
[Edit $2^\circ$] OK, thanks.
2018 Bosnia And Herzegovina - Regional Olympiad, 1
Show that system of equations
$2ab=6(a+b)-13$
$a^2+b^2=4$
has not solutions in set of real numbers.
2014 HMNT, 10
Let $z$ be a complex number and k a positive integer such that $z^k$ is a positive real number other than $1$. Let $f(n)$ denote the real part of the complex number $z^n$. Assume the parabola $p(n) = an^2 +bn+c$ intersects $f(n)$ four times, at $n = 0, 1, 2, 3$. Assuming the smallest possible value of $k$, find the largest possible value of $a$.
1992 Denmark MO - Mohr Contest, 1
A man in a rowing boat is at point A at a distance of $2$ kilometers from a straight coastline. By first rowing in to a point P and then strolling along the coast he reaches point B, which is at a distance of $5$ kilometers from C, which is the point on the coast closest to A. The man's speed at rest is $3$ kilometers per hour and his strolling speed is $5$ kilometers per hour. Decide where P should go be placed between C and B so that the man gets from A to B in the shortest possible time.
2018 Iran Team Selection Test, 1
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ that satisfy the following conditions:
a. $x+f(y+f(x))=y+f(x+f(y)) \quad \forall x,y \in \mathbb{R}$
b. The set $I=\left\{\frac{f(x)-f(y)}{x-y}\mid x,y\in \mathbb{R},x\neq y \right\}$ is an interval.
[i]Proposed by Navid Safaei[/i]