Found problems: 85335
2016 Croatia Team Selection Test, Problem 1
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that for all real $x,y$:
$$ f(x^2) + xf(y) = f(x) f(x + f(y)) \, . $$
1987 AMC 12/AHSME, 24
How many polynomial functions $f$ of degree $\ge 1$ satisfy
\[ f(x^2)=[f(x)]^2=f(f(x)) \ ? \]
$ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ \text{finitely many but more than 2} \\ \qquad\textbf{(E)}\ \text{infinitely many} $
2024 Kyiv City MO Round 2, Problem 2
Find the smallest positive integer $n$ for which one can select $n$ distinct real numbers such that each of them is equal to the sum of some two other selected numbers.
[i]Proposed by Anton Trygub[/i]
2020 Kazakhstan National Olympiad, 3
Let $p$ be a prime number and $k,r$ are positive integers such that $p>r$. If $pk+r$ divides $p^p+1$ then prove that $r$ divides $k$.
2018 Nepal National Olympiad, 1c
[b]Problem Section #1
c) Find all pairs $(m, n)$ of non-negative integers for which $m^2+2.3^n=m(2^{n+1}-1).$
2014 Turkey Team Selection Test, 3
At the bottom-left corner of a $2014\times 2014$ chessboard, there are some green worms and at the top-left corner of the same chessboard, there are some brown worms. Green worms can move only to right and up, and brown worms can move only to right and down. After a while, the worms make some moves and all of the unit squares of the chessboard become occupied at least once throughout this process. Find the minimum total number of the worms.
2002 AMC 10, 14
The number $ 25^{64}\cdot64^{25}$ is the square of a positive integer $ N$. In decimal representation, the sum of the digits of $ N$ is
$ \textbf{(A)}\ 7 \qquad
\textbf{(B)}\ 14 \qquad
\textbf{(C)}\ 21 \qquad
\textbf{(D)}\ 28 \qquad
\textbf{(E)}\ 35$
2012 Bosnia And Herzegovina - Regional Olympiad, 2
Let $a$, $b$, $c$ and $d$ be integers such that $ac$, $bd$ and $bc+ad$ are divisible with positive integer $m$. Show that numbers $bc$ and $ad$ are divisible with $m$
2024 Indonesia TST, 2
Consider a $100 \times 100$ table, and identify the cell in row $a$ and column $b$, $1 \leq a, b \leq 100$, with the ordered pair $(a, b)$. Let $k$ be an integer such that $51 \leq k \leq 99$. A $k$-knight is a piece that moves one cell vertically or horizontally and $k$ cells to the other direction; that is, it moves from $(a, b)$ to $(c, d)$ such that $(|a-c|, |b - d|)$ is either $(1, k)$ or $(k, 1)$. The $k$-knight starts at cell $(1, 1)$, and performs several moves. A sequence of moves is a sequence of cells $(x_0, y_0)= (1, 1)$, $(x_1, y_1), (x_2, y_2)$, $\ldots, (x_n, y_n)$ such that, for all $i = 1, 2, \ldots, n$, $1 \leq x_i , y_i \leq 100$ and the $k$-knight can move from $(x_{i-1}, y_{i-1})$ to $(x_i, y_i)$. In this case, each cell $(x_i, y_i)$ is said to be reachable. For each $k$, find $L(k)$, the number of reachable cells.
1992 IMO Longlists, 35
Let $ f(x)$ be a polynomial with rational coefficients and $ \alpha$ be a real number such that \[ \alpha^3 \minus{} \alpha \equal{} [f(\alpha)]^3 \minus{} f(\alpha) \equal{} 33^{1992}.\] Prove that for each $ n \geq 1,$ \[ \left [ f^{n}(\alpha) \right]^3 \minus{} f^{n}(\alpha) \equal{} 33^{1992},\] where $ f^{n}(x) \equal{} f(f(\cdots f(x))),$ and $ n$ is a positive integer.
1977 Canada National Olympiad, 4
Let
\[p(x) = a_n x^n + a_{n - 1} x^{n - 1} + \dots + a_1 x + a_0\]
and
\[q(x) = b_m x^m + a_{m - 1} x^{m - 1} + \dots + b_1 x + b_0\]
be two polynomials with integer coefficients. Suppose that all the coefficients of the product $p(x) \cdot q(x)$ are even but not all of them are divisible by 4. Show that one of $p(x)$ and $q(x)$ has all even coefficients and the other has at least one odd coefficient.
2016 Romanian Masters in Mathematic, 2
Given positive integers $m$ and $n \ge m$, determine the largest number of dominoes ($1\times2$ or $2 \times 1$ rectangles) that can be placed on a rectangular board with $m$ rows and $2n$ columns consisting of cells ($1 \times 1$
squares) so that:
(i) each domino covers exactly two adjacent cells of the board;
(ii) no two dominoes overlap;
(iii) no two form a $2 \times 2$ square; and
(iv) the bottom row of the board is completely covered by $n$ dominoes.
2011 Pre-Preparation Course Examination, 1
[b]a)[/b] prove that the function $\zeta(s)=\sum_{n=1}^\infty\frac{1}{n^s}$ that is defined on the area $Re(s)>1$, is an analytic function.
[b]b)[/b] prove that the function $\zeta(s)-\frac{1}{s-1}$ can be spanned to an analytic function over $\mathbb C$.
[b]c)[/b] using the span of part [b]b[/b] show that $\zeta(1-n)=-\frac{B_n}{n}$ that $B_n$ is the $n$th bernoli number that is defined by generating function $\frac{t}{e^t-1}=\sum_{n=0}^{\infty}B_n\frac{t^n}{n!}$.
2024 Malaysian Squad Selection Test, 2
A finite sequence of decimal digits from $\{0,1,\cdots, 9\}$ is said to be [i]common[/i] if for each sufficiently large positive integer $n$, there exists a positive integer $m$ such that the expansion of $n$ in base $m$ ends with this sequence of digits.
For example, $0$ is common because for any large $n$, the expansion of $n$ in base $n$ is $10$, whereas $00$ is not common because for any squarefree $n$, the expansion of $n$ in any base cannot end with $00$.
Determine all common sequences.
[i]Proposed by Wong Jer Ren[/i]
Denmark (Mohr) - geometry, 2010.5
An equilateral triangle $ABC$ is given. With $BC$ as diameter, a semicircle is drawn outside the triangle. On the semicircle, points $D$ and $E$ are chosen such that the arc lengths $BD, DE$ and $EC$ are equal. Prove that the line segments $AD$ and $AE$ divide the side $BC$ into three equal parts.
[img]https://1.bp.blogspot.com/-hQQV-Of96Ls/XzXCZjCledI/AAAAAAAAMV0/SwXa4mtEEm04onYbFGZiTc5NSpkoyvJLwCLcBGAsYHQ/s0/2010%2BMohr%2Bp5.png[/img]
2019 USA TSTST, 9
Let $ABC$ be a triangle with incenter $I$. Points $K$ and $L$ are chosen on segment $BC$ such that the incircles of $\triangle ABK$ and $\triangle ABL$ are tangent at $P$, and the incircles of $\triangle ACK$ and $\triangle ACL$ are tangent at $Q$. Prove that $IP=IQ$.
[i]Ankan Bhattacharya[/i]
1949-56 Chisinau City MO, 36
Calculate the sum: $1+ 2q + 3q^2 +...+nq^{n-1}$
2022 USAJMO, 1
For which positive integers $m$ does there exist an infinite arithmetic sequence of integers $a_1, a_2, . . .$ and an infinite geometric sequence of integers $g_1, g_2, . . .$ satisfying the following properties?
[list]
[*] $a_n - g_n$ is divisible by $m$ for all integers $n \ge 1$;
[*] $a_2 - a_1$ is not divisible by $m$.
[/list]
[i]Holden Mui[/i]
1998 Estonia National Olympiad, 1
Let $d_1$ and $d_2$ be divisors of a positive integer $n$. Suppose that the greatest common divisor of $d_1$ and $n/d_2$ and the greatest common divisor of $d_2$ and $n/d_1$ are equal. Show that $d_1 = d_2$.
1971 Spain Mathematical Olympiad, 5
Prove that whatever the complex number $z$ is, it is true that
$$(1 + z^{2^n})(1-z^{2^n})= 1- z^{2^{n+1}}.$$
Writing the equalities that result from giving $n$ the values $0, 1, 2, . . .$ and multiplying them, show that for $|z| < 1$ holds
$$\frac{1}{1-z}= \lim_{k\to \infty}(1 + z)(1 + z^2)(1 + z^{2^2})...(1 + z^{2^k}).$$
2024 APMO, 3
Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$
2018 Junior Balkan Team Selection Tests - Romania, 3
Let $ABCD$ be a cyclic quadrilateral. The line parallel to $BD$ passing through $A$ meets the line parallel to $AC$ passing through $B$ at $E$. The circumcircle of triangle $ABE$ meets the lines $EC$ and $ED$, again, at $F$ and $G$, respectively. Prove that the lines $AB, CD$ and $FG$ are either parallel or concurrent.
2022 Stanford Mathematics Tournament, 1
Points $A$, $B$, $C$, and $D$ lie on a circle. Let $AC$ and $BD$ intersect at point $E$ inside the circle. If $[ABE]\cdot[CDE]=36$, what is the value of $[ADE]\cdot[BCE]$? (Given a triangle $\triangle ABC$, $[ABC]$ denotes its area.)
2020-21 IOQM India, 5
Find the number of integer solutions to $||x| - 2020| < 5$.
2024 Centroamerican and Caribbean Math Olympiad, 2
There is a row with $2024$ cells. Ana and Beto take turns playing, with Ana going first. On each turn, the player selects an empty cell and places a digit in that space. Once all $2024$ cells are filled, the number obtained from reading left to right is considered, ignoring any leading zeros. Beto wins if the resulting number is a multiple of $99$, otherwise Ana wins. Determine which of the two players has a winning strategy and describe it.