Found problems: 15925
2023 AMC 10, 5
Maddy and Lara see a list of numbers written on a blackboard. Maddy adds $3$ to each number in the list and finds that the sum of her new numbers is $45$. Lara multiplies each number in the list by $3$ and finds that the sum of her new numbers is also $45$. How many numbers are written on the blackboard?
$\textbf{(A) }10\qquad\textbf{(B) }5\qquad\textbf{(C) }6\qquad\textbf{(D) }8\qquad\textbf{(E) }9$
2005 Putnam, B5
Let $P(x_1,\dots,x_n)$ denote a polynomial with real coefficients in the variables $x_1,\dots,x_n,$ and suppose that
(a) $\left(\frac{\partial^2}{\partial x_1^2}+\cdots+\frac{\partial^2}{\partial x_n^2} \right)P(x_1,\dots,x_n)=0$ (identically)
and that
(b) $x_1^2+\cdots+x_n^2$ divides $P(x_1,\dots,x_n).$
Show that $P=0$ identically.
2001 Vietnam National Olympiad, 2
Find all real-valued continuous functions defined on the interval $(-1, 1)$ such that $(1-x^{2}) f(\frac{2x}{1+x^{2}}) = (1+x^{2})^{2}f(x)$ for all $x$.
2018 USA TSTST, 6
Let $S = \left\{ 1, \dots, 100 \right\}$, and for every positive integer $n$ define \[ T_n = \left\{ (a_1, \dots, a_n) \in S^n \mid a_1 + \dots + a_n \equiv 0 \pmod{100} \right\}. \] Determine which $n$ have the following property: if we color any $75$ elements of $S$ red, then at least half of the $n$-tuples in $T_n$ have an even number of coordinates with red elements.
[i]Ray Li[/i]
1998 Baltic Way, 8
Let $P_k(x)=1+x+x^2+\ldots +x^{k-1}$. Show that
\[ \sum_{k=1}^n \binom{n}{k} P_k(x)=2^{n-1} P_n \left( \frac{x+1}{2} \right) \]
for every real number $x$ and every positive integer $n$.
2011 Bogdan Stan, 1
Consider the multiplicative group $ \left\{ \left.A_k:=\left(\begin{matrix} 2^k& 2^k\\2^k& 2^k\end{matrix}\right)\right| k\in\mathbb{Z} \right\} . $
[b]a)[/b] Prove that $A_xA_y=A_{x+y+1} , $ for all integers $ x,y. $
[b]b)[/b] Show that, for all integers $ t, $ the multiplicative group $ \left\{ A_{jt-1}|j\in\mathbb{Z} \right\} $ is a subgroup of $ G. $
[b]c)[/b] Determine the linear integer polynomials $ P $ for which it exists an isomorphism $ \left(
G,\cdot \right)\stackrel{\eta}{\cong}\left( \mathbb{Z} ,+ \right) $ such that $ \eta\left( A_k \right) =P(k). $
2014 IFYM, Sozopol, 4
Find all polynomials $P,Q\in \mathbb{R}[x]$, such that $P(2)=2$ , $Q(x)$ has no negative roots, and
$(x-2)P(x^2-1)Q(x+1)=P(x)Q(x^2 )+Q(x+1)$.
2006 France Team Selection Test, 2
Let $a,b,c$ be three positive real numbers such that $abc=1$. Show that:
\[ \displaystyle \frac{a}{(a+1)(b+1)}+\frac{b}{(b+1)(c+1)}+ \frac{c}{(c+1)(a+1)} \geq \frac{3}{4}. \]
When is there equality?
2017 CMIMC Algebra, 7
Let $a$, $b$, and $c$ be complex numbers satisfying the system of equations \begin{align*}\dfrac{a}{b+c}+\dfrac{b}{c+a}+\dfrac{c}{a+b}&=9,\\\dfrac{a^2}{b+c}+\dfrac{b^2}{c+a}+\dfrac{c^2}{a+b}&=32,\\\dfrac{a^3}{b+c}+\dfrac{b^3}{c+a}+\dfrac{c^3}{a+b}&=122.\end{align*} Find $abc$.
2011 China Girls Math Olympiad, 5
A real number $\alpha \geq 0$ is given. Find the smallest $\lambda = \lambda (\alpha ) > 0$, such that for any complex numbers ${z_1},{z_2}$ and $0 \leq x \leq 1$, if $\left| {{z_1}} \right| \leq \alpha \left| {{z_1} - {z_2}} \right|$, then $\left| {{z_1} - x{z_2}} \right| \leq \lambda \left| {{z_1} - {z_2}} \right|$.
2008 239 Open Mathematical Olympiad, 6
Given a polynomial $P(x,y)$ with real coefficients, suppose that some real function $f:\mathbb R \to \mathbb R$ satisfies
$$P(x,y) = f(x+y)-f(x)-f(y)$$for all $x,y\in\mathbb R$. Show that some polynomial $q$ satisfies
$$P(x,y) = q(x+y)-q(x)-q(y)$$
2021 Final Mathematical Cup, 3
For a positive integer $n$ we define $f (n) = \max X_1^{X_2^{...^{X_k}}}$ where the maximum is taken over all possible decompositions of natural numbers $n = X_1X_2...X_k$. Determine $f(n)$.
2002 Austrian-Polish Competition, 7
Find all real functions $f$ definited on positive integers and satisying:
(a) $f(x+22)=f(x)$,
(b) $f\left(x^{2}y\right)=\left(f(x)\right)^{2}f(y)$
for all positive integers $x$ and $y$.
2024 ELMO Shortlist, A3
Find all functions $f : \mathbb{R}\to\mathbb{R}$ such that for all real numbers $x$ and $y$,
$$f(x+f(y))+xy=f(x)f(y)+f(x)+y.$$
[i]Andrew Carratu[/i]
2004 Regional Competition For Advanced Students, 4
The sequence $ < x_n >$ is defined through:
$ x_{n \plus{} 1} \equal{} \left(\frac {n}{2004} \plus{} \frac {1}{n}\right)x_n^2 \minus{} \frac {n^3}{2004} \plus{} 1$ for $ n > 0$
Let $ x_1$ be a non-negative integer smaller than $ 204$ so that all members of the sequence are non-negative integers.
Show that there exist infinitely many prime numbers in this sequence.
2014 District Olympiad, 4
Find all functions $f:\mathbb{N}^{\ast}\rightarrow\mathbb{N}^{\ast}$ with
the properties:
[list=a]
[*]$ f(m+n) -1 \mid f(m)+f(n),\quad \forall m,n\in\mathbb{N}^{\ast} $
[*]$ n^{2}-f(n)\text{ is a square } \;\forall n\in\mathbb{N}^{\ast} $[/list]
2013 Danube Mathematical Competition, 1
Determine the natural numbers $n\ge 2$ for which exist $x_1,x_2,...,x_n \in R^*$, such that $$x_1+x_2+...+x_n=\frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}=0$$
1990 French Mathematical Olympiad, Problem 1
Let the sequence $u_n$ be defined by $u_0=0$ and $u_{2n}=u_n$, $u_{2n+1}=1-u_n$ for each $n\in\mathbb N_0$.
(a) Calculate $u_{1990}$.
(b) Find the number of indices $n\le1990$ for which $u_n=0$.
(c) Let $p$ be a natural number and $N=(2^p-1)^2$. Find $u_N$.
1993 All-Russian Olympiad, 3
Quadratic trinomial $f(x)$ is allowed to be replaced by one of the trinomials $x^2f(1+\frac{1}{x})$ or $(x-1)^2f(\frac{1}{x-1})$. With the use of these operations, is it possible to go from $x^2+4x+3$ to $x^2+10x+9$?
2023 Indonesia TST, A
Find all function $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfied
\[f(x+y) + f(x)f(y) = f(xy) + 1 \]
$\forall x, y \in \mathbb{R}$
2012 France Team Selection Test, 1
Let $k>1$ be an integer. A function $f:\mathbb{N^*}\to\mathbb{N^*}$ is called $k$-[i]tastrophic[/i] when for every integer $n>0$, we have $f_k(n)=n^k$ where $f_k$ is the $k$-th iteration of $f$:
\[f_k(n)=\underbrace{f\circ f\circ\cdots \circ f}_{k\text{ times}}(n)\]
For which $k$ does there exist a $k$-tastrophic function?
2022 Kyiv City MO Round 1, Problem 3
You are given $n$ not necessarily distinct real numbers $a_1, a_2, \ldots, a_n$. Let's consider all $2^n-1$ ways to select some nonempty subset of these numbers, and for each such subset calculate the sum of the selected numbers. What largest possible number of them could have been equal to $1$?
For example, if $a = [-1, 2, 2]$, then we got $3$ once, $4$ once, $2$ twice, $-1$ once, $1$ twice, so the total number of ones here is $2$.
[i](Proposed by Anton Trygub)[/i]
2005 Georgia Team Selection Test, 9
Let $ a_{0},a_{1},\ldots,a_{n}$ be integers, one of which is nonzero, and all of the numbers are not less than $ \minus{} 1$. Prove that if \[ a_{0} \plus{} 2a_{1} \plus{} 2^{2}a_{2} \plus{} \cdots \plus{} 2^{n}a_{n} \equal{} 0,\] then $ a_{0} \plus{} a_{1} \plus{} \cdots \plus{} a_{n} > 0$.
2009 Kosovo National Mathematical Olympiad, 1
Find the graph of the function $y=x+|1-x^3|$.
1968 Dutch Mathematical Olympiad, 2
It holds: $N,a > 0$. Prove that $\frac12 \left(\frac{N}{a}+a \right) \ge \sqrt{N}$, and if $N \ge 1$ and $a = [\sqrt{N}]$.
Prove that if $a \ne \sqrt{N}: \frac12 \left(\frac{N}{a}+a \right)$ is a better approximation for $\sqrt{N}$ than $a$.