Found problems: 4776
In how many ways can you write $12$ as an ordered sum of integers where the smallest of those integers is equal to $2$? For example, $2+10$, $10+2$, and $3+2+2+5$ are three such ways.
Find all functions $ f: \mathbb{Q}^{\plus{}} \mapsto \mathbb{Q}^{\plus{}}$ such that:
\[ f(x) \plus{} f(y) \plus{} 2xy f(xy) \equal{} \frac {f(xy)}{f(x\plus{}y)}.\]
Figures $ 0$, $ 1$, $ 2$, and $ 3$ consist of $ 1$, $ 5$, $ 13$, and $ 25$ nonoverlapping squares, respectively. If the pattern were continued, how many nonoverlapping squares would there be in figure $ 100$?
[asy]
unitsize(8);
draw((0,0)--(1,0)--(1,1)--(0,1)--cycle);
draw((9,0)--(10,0)--(10,3)--(9,3)--cycle);
draw((8,1)--(11,1)--(11,2)--(8,2)--cycle);
draw((19,0)--(20,0)--(20,5)--(19,5)--cycle);
draw((18,1)--(21,1)--(21,4)--(18,4)--cycle);
draw((17,2)--(22,2)--(22,3)--(17,3)--cycle);
draw((32,0)--(33,0)--(33,7)--(32,7)--cycle);
draw((29,3)--(36,3)--(36,4)--(29,4)--cycle);
draw((31,1)--(34,1)--(34,6)--(31,6)--cycle);
draw((30,2)--(35,2)--(35,5)--(30,5)--cycle);
label("Figure",(0.5,-1),S);
label("$0$",(0.5,-2.5),S);
label("Figure",(9.5,-1),S);
label("$1$",(9.5,-2.5),S);
label("Figure",(19.5,-1),S);
label("$2$",(19.5,-2.5),S);
label("Figure",(32.5,-1),S);
label("$3$",(32.5,-2.5),S);[/asy]$ \textbf{(A)}\ 10401 \qquad \textbf{(B)}\ 19801 \qquad \textbf{(C)}\ 20201 \qquad \textbf{(D)}\ 39801 \qquad \textbf{(E)}\ 40801$
Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$.
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Let $f:\mathbb{R}\to\mathbb{R}$ be a continuous function such that for all $x\in\mathbb{R}$ and for all $t\geqslant 0$, $$f(x)=f(e^tx)$$ Show that $f$ is a constant function.
Find all functions from $\mathbb{N}\cup\{0\}\to\mathbb{N}\cup\{0\}$ such that $f(m^2+mf(n))=mf(m+n)$, for all $m,n\in \mathbb{N}\cup\{0\}$.
A deck of $ 32$ cards has $ 2$ different jokers each of which is numbered $ 0$. There are $ 10$ red cards numbered $ 1$ through $ 10$ and similarly for blue and green cards. One chooses a number of cards from the deck. If a card in hand is numbered $ k$, then the value of the card is $ 2^k$, and the value of the hand is sum of the values of the cards in hand. Determine the number of hands having the value $ 2004$.
Let $\mathbb{N}$ be the set of positive integers, and let $f: \mathbb{N} \to \mathbb{N}$ be a function satisfying
[list]
[*] $f(1) = 1$,
[*] for $n \in \mathbb{N}$, $f(2n) = 2f(n)$ and $f(2n+1) = 2f(n) - 1$.
[/list]
Determine the sum of all positive integer solutions to $f(x) = 19$ that do not exceed 2019.
Let $P$ denote the set of all ordered pairs $ \left(p,q\right)$ of nonnegative integers. Find all functions $f: P \rightarrow \mathbb{R}$ satisfying
\[ f(p,q) \equal{} \begin{cases} 0 & \text{if} \; pq \equal{} 0, \\
1 \plus{} \frac{1}{2} f(p+1,q-1) \plus{} \frac{1}{2} f(p-1,q+1) & \text{otherwise} \end{cases}
\]
Compare IMO shortlist problem 2001, algebra A1 for the three-variable case.
Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(x^3\plus{}y^3)\equal{}xf(x^2)\plus{}yf(y^2)\] for all real numbers $ x$ and $ y$.
[i]Hery Susanto, Malang[/i]
Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded.
[i]Proposed by Palmer Mebane, United States[/i]
Niki and Kyle play a triangle game. Niki first draws $\triangle ABC$ with area $1$, and Kyle picks a point $X$ inside $\triangle ABC$. Niki then draws segments $\overline{DG}$, $\overline{EH}$, and $\overline{FI}$, all through $X$, such that $D$ and $E$ are on $\overline{BC}$, $F$ and $G$ are on $\overline{AC}$, and $H$ and $I$ are on $\overline{AB}$. The ten points must all be distinct. Finally, let $S$ be the sum of the areas of triangles $DEX$, $FGX$, and $HIX$. Kyle earns $S$ points, and Niki earns $1-S$ points. If both players play optimally to maximize the amount of points they get, who will win and by how much?
Find all $ n > 1$ such that the inequality \[ \sum_{i\equal{}1}^nx_i^2\ge x_n\sum_{i\equal{}1}^{n\minus{}1}x_i\] holds for all real numbers $ x_1$, $ x_2$, $ \ldots$, $ x_n$.
Consider the functions $ f(x) = ax^{2} + bx + c $ , $ g(x) = cx^{2} + bx + a $, where a, b, c are real numbers. Given that $ |f(-1)| \leq 1 $, $ |f(0)| \leq 1 $, $ |f(1)| \leq 1 $, prove that $ |f(x)| \leq \frac{5}{4} $ and $ |g(x)| \leq 2 $ for $ -1 \leq x \leq 1 $.
Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ (where $\mathbb{Z}$ is the set of all integers) such that \[ 2000f(f(x)) - 3999f(x) + 1999x = 0\textrm{ for all }x \in \mathbb{Z}. \]
For every positive integer $n$ with prime factorization $n = \prod_{i = 1}^{k} p_i^{\alpha_i}$, define
\[\mho(n) = \sum_{i: \; p_i > 10^{100}} \alpha_i.\]
That is, $\mho(n)$ is the number of prime factors of $n$ greater than $10^{100}$, counted with multiplicity.
Find all strictly increasing functions $f: \mathbb{Z} \to \mathbb{Z}$ such that
\[\mho(f(a) - f(b)) \le \mho(a - b) \quad \text{for all integers } a \text{ and } b \text{ with } a > b.\]
[i]Proposed by Rodrigo Sanches Angelo, Brazil[/i]
$a)$ Let $m$ and $n$ be positive integers. If $m>1$ prove that $ n \mid \phi(m^n-1)$ where $\phi$ is Euler function
$b)$ Prove that number of elements in sequence $1,2,...,n$ $(n \in \mathbb{N})$, which greatest common divisor with $n$ is $d$, is $\phi\left(\frac{n}{d}\right)$
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]
The functions $f_0,f_1 : (1,\infty) \to (1,\infty)$ are given by $ f_0(x) = 2x$ and$ f_1(x) =\frac{x}{x-1}$. Show that for any real numbers $a, b$ with $1 \le a < b$ there exist a positive integer $k$ and indices $i_1,i_2,...,i_k \in \{0,1\}$ such that $a <f_{i_k}(f_{i_{k-1}}(...(f_{i_j}(2))...))< b$.
Consider a function $ f(x)\equal{}xe^{\minus{}x^3}$ defined on any real numbers.
(1) Examine the variation and convexity of $ f(x)$ to draw the garph of $ f(x)$.
(2) For a positive number $ C$, let $ D_1$ be the region bounded by $ y\equal{}f(x)$, the $ x$-axis and $ x\equal{}C$. Denote $ V_1(C)$ the volume obtained by rotation of $ D_1$ about the $ x$-axis. Find $ \lim_{C\rightarrow \infty} V_1(C)$.
(3) Let $ M$ be the maximum value of $ y\equal{}f(x)$ for $ x\geq 0$. Denote $ D_2$ the region bounded by $ y\equal{}f(x)$, the $ y$-axis and $ y\equal{}M$.
Find the volume $ V_2$ obtained by rotation of $ D_2$ about the $ y$-axis.
a) For each $n \ge 2$, find the maximum constant $c_{n}$ such that
$\frac 1{a_{1}+1}+\frac 1{a_{2}+1}+\ldots+\frac 1{a_{n}+1}\ge c_{n}$
for all positive reals $a_{1},a_{2},\ldots,a_{n}$ such that $a_{1}a_{2}\cdots a_{n}= 1$.
b) For each $n \ge 2$, find the maximum constant $d_{n}$ such that
$\frac 1{2a_{1}+1}+\frac 1{2a_{2}+1}+\ldots+\frac 1{2a_{n}+1}\ge d_{n}$
for all positive reals $a_{1},a_{2},\ldots,a_{n}$ such that $a_{1}a_{2}\cdots a_{n}= 1$.
Let $\eta(m)$ be the product of all positive integers that divide $m$, including $1$ and $m$. If $\eta(\eta(\eta(10))) = 10^n$, compute $n$.
[i]Proposed by Kevin Sun[/i]
We denote by $\mathbb{R}^\plus{}$ the set of all positive real numbers.
Find all functions $f: \mathbb R^ \plus{} \rightarrow\mathbb R^ \plus{}$ which have the property:
\[f(x)f(y)\equal{}2f(x\plus{}yf(x))\]
for all positive real numbers $x$ and $y$.
[i]Proposed by Nikolai Nikolov, Bulgaria[/i]
Find all pairs $(m,n)$ of natural numbers with $m<n$ such that $m^2+1$ is a multiple of $n$ and $n^2+1$ is a multiple of $m$.
Let $a\geq 0$ be constant. Find the number of Intersection points of the graph of the function $y=x^3-3a^2x$ and the figure expressed by the equation $|x|+|y|=2$.