This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 4776

A non-Hookian spring has force $F = -kx^2$ where $k$ is the spring constant and $x$ is the displacement from its unstretched position. For the system shown of a mass $m$ connected to an unstretched spring initially at rest, how far does the spring extend before the system momentarily comes to rest? Assume that all surfaces are frictionless and that the pulley is frictionless as well. [asy] size(250); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw((0,0)--(0,-1)--(2,-1)--(2+sqrt(3),-2)); draw((2.5,-2)--(4.5,-2),dashed); draw(circle((2.2,-0.8),0.2)); draw((2.2,-0.8)--(1.8,-1.2)); draw((0,-0.6)--(0.6,-0.6)--(0.75,-0.4)--(0.9,-0.8)--(1.05,-0.4)--(1.2,-0.8)--(1.35,-0.4)--(1.5,-0.8)--(1.65,-0.4)--(1.8,-0.8)--(1.95,-0.6)--(2.2,-0.6)); draw((2+0.3*sqrt(3),-1.3)--(2+0.3*sqrt(3)+0.6/2,-1.3+sqrt(3)*0.6/2)--(2+0.3*sqrt(3)+0.6/2+0.2*sqrt(3),-1.3+sqrt(3)*0.6/2-0.2)--(2+0.3*sqrt(3)+0.2*sqrt(3),-1.3-0.2)); //super complex Asymptote code gg draw((2+0.3*sqrt(3)+0.3/2,-1.3+sqrt(3)*0.3/2)--(2.35,-0.6677)); draw(anglemark((2,-1),(2+sqrt(3),-2),(2.5,-2))); label("$30^\circ$",(3.5,-2),NW); [/asy] $ \textbf{(A)}\ \left(\frac{3mg}{2k}\right)^{1/2} $ $ \textbf{(B)}\ \left(\frac{mg}{k}\right)^{1/2} $ $ \textbf{(C)}\ \left(\frac{2mg}{k}\right)^{1/2} $ $ \textbf{(D)}\ \left(\frac{\sqrt{3}mg}{k}\right)^{1/3} $ $ \textbf{(E)}\ \left(\frac{3\sqrt{3}mg}{2k}\right)^{1/3} $
Let $k \in \mathbb{Z}^+$ and set $n=2^k+1.$ Prove that $n$ is a prime number if and only if the following holds: there is a permutation $a_{1},\ldots,a_{n-1}$ of the numbers $1,2, \ldots, n-1$ and a sequence of integers $g_{1},\ldots,g_{n-1},$ such that $n$ divides $g^{a_i}_i - a_{i+1}$ for every $i \in \{1,2,\ldots,n-1\},$ where we set $a_n = a_1.$ [i]Proposed by Vasily Astakhov, Russia[/i]
We consider an integer $n \ge 3,$ the set $S=\{1,2,3,\ldots,n\}$ and the set $\mathcal{F}$ of the functions from $S$ to $S.$ We say that $\mathcal{G} \subset \mathcal{F}$ is a generating set for $\mathcal{H} \subset \mathcal{F}$ if any function in $\mathcal{H}$ can be represented as a composition of functions from $\mathcal{G}.$ a) Let the functions $a:S \to S,$ $a(n-1)=n,$ $a(n)=n-1$ and $a(k)=k$ for $k \in S \setminus \{n-1,n\}$ and $b:S \to S,$ $b(n)=1$ and $b(k)=k+1$ for $k \in S \setminus \{n\}.$ Prove that $\{a,b\}$ is a generating set for the set $\mathcal{B}$ of bijective functions of $\mathcal{F}.$ b) Prove that the smallest number of elements that a generating set of $\mathcal{F}$ has is $3.$
Consider a function $f$ on nonnegative integers such that $f(0)=1, f(1)=0$ and $f(n)+f(n-1)=nf(n-1)+(n-1)f(n-2)$ for $n \ge 2$. Show that \[\frac{f(n)}{n!}=\sum_{k=0}^n \frac{(-1)^k}{k!}\]
Given positive integers $n$, $P_1$, $P_2$, …$P_n$ and two sets \[B=\{ (a_1,a_2,…,a_n)|a_i=0 \vee 1,\ \forall i \in \mathbb{N} \}, S=\{ (x_1,x_2,…,x_n)|1 \leq x_i \leq P_i \wedge x_i \in \mathbb{N} ,\ \forall i \in \mathbb{N} \}\] A function $f:S \to \mathbb{Z}$ is called [b]Real[/b], if and only if for any positive integers $(y_1,y_2,…,y_n)$ and positive integer $a$ which satisfied $ 1 \leq y_i \leq P_i-a$ $\forall i \in \mathbb{N}$, we always have: \begin{align*} \sum_{(a_1,a_2,…,a_n) \in B \wedge 2| \sum_{i=1}^na_i}f(y+a \times a_1,y+a \times a_2,……,y+a \times a_n)&>\\ \sum_{(a_1,a_2,…,a_n) \in B \wedge 2 \nmid \sum_{i=1}^na_i}f(y+a \times a_1,y+a \times a_2,……,y+a \times a_n)&. \end{align*} Find the minimum of $\sum_{i_1=1}^{P_1}\sum_{i_2=1}^{P_2}....\sum_{i_n=1}^{P_n}|f(i_1,i_2,...,i_n)|$, where $f$ is a [b]Real[/b] function. [i]Proposed by tob8y[/i]
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}$
[list=a] [*] Let $a<b$ and $f:[a,b]\rightarrow\mathbb{R}$ be a strictly monotonous function such that $\int_a^b f(x) dx=0$. Show that $f(a)\cdot f(b)<0$. [*] Find all convergent sequences $(a_n)_{n\geq 1}$ for which there exists a scrictly monotonous function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that $$\int_{a_{n-1}}^{a_n} f(x)dx = \int_{a_n}^{a_{n+1}} f(x)dx,\text{ for all }n\geq 2.$$
For all $k=1,2,\ldots,2008$,$a_k>0$.Prove that iff $\sum_{k=1}^{2008}a_k>1$,there exists a function $f:N\rightarrow R$ satisfying (1)$0=f(0)<f(1)<f(2)<\ldots$; (2)$f(n)$ has a finite limit when $n$ approaches infinity; (3)$f(n)-f({n-1})=\sum_{k=1}^{2008}a_kf({n+k})-\sum_{k=0}^{2007}a_{k+1}f({n+k})$,for all $n=1,2,3,\ldots$.
Let be a function $ f:(0,\infty )\longrightarrow\mathbb{R} $ satisfying the following two properties: $ \text{(i) } 2\lfloor x \rfloor \le f(x) \le 2 \lfloor x \rfloor +2,\quad\forall x\in (0,\infty ) $ $ \text{(ii) } f\circ f $ is monotone Can $ f $ be non-monotone? Justify.
Suppose that $(f_{n})_{n=1}^{\infty}$ is a sequence of continuous functions on the interval $[0,1]$ such that $$\int_{0}^{1}f_{m}(x)f_{n}(x) dx= \begin{cases} 1& \text{if}\;n=m\\ 0 & \text{if} \;n\ne m \end{cases}$$ and $\sup\{|f_{n}(x)|: x\in [0,1]\, \text{and}\, n=1,2,\dots\}< \infty$. Show that there exists no subsequence $(f_{n_{k}})$ of $(f_{n})$ such that $\lim_{k\to \infty}f_{n_{k}}(x)$ exist for all $x\in [0,1]$.
Let $P$ be a point inside or on the boundary of a square $ABCD$. Find the minimum and maximum values of $f(P ) = \angle ABP + \angle BCP + \angle CDP + \angle DAP$.
Let $a, b, c, d$ three strictly positive real numbers such that \[a^{2}+b^{2}+c^{2}=d^{2}+e^{2},\] \[a^{4}+b^{4}+c^{4}=d^{4}+e^{4}.\] Compare \[a^{3}+b^{3}+c^{3}\] with \[d^{3}+e^{3},\]
For a positive integer $n$, denote $c_n=2017^n$. A function $f: \mathbb{N} \rightarrow \mathbb{R}$ satisfies the following two conditions. 1. For all positive integers $m, n$, $f(m+n) \le 2017 \cdot f(m) \cdot f(n+325)$. 2. For all positive integer $n$, we have $0<f(c_{n+1})<f(c_n)^{2017}$. Prove that there exists a sequence $a_1, a_2, \cdots $ which satisfies the following. For all $n, k$ which satisfies $a_k<n$, we have $f(n)^{c_k} < f(c_k)^n$.
We define the function $Z(A)$ where we write the digits of $A$ in base $10$ form in reverse. (For example: $Z(521)=125$). Call a number $A$ $good$ if the first and last digits of $A$ are different, none of it's digits are $0$ and the equality: $$Z(A^2)=(Z(A))^2$$ happens. Find all such good numbers greater than $10^6$.\\
Find all functions $f: \mathbb{N} \mapsto \mathbb{N}$ so that for any positive integer $n$ and finite sequence of positive integers $a_0, \dots, a_n$, whenever the polynomial $a_0+a_1x+\dots+a_nx^n$ has at least one integer root, so does \[f(a_0)+f(a_1)x+\dots+f(a_n)x^n.\] [i]Proposed by Sutanay Bhattacharya[/i]
For any continuous real-valued function $f$ defined on the interval $[0,1],$ let \[\mu(f)=\int_0^1f(x)\,dx,\text{Var}(f)=\int_0^1(f(x)-\mu(f))^2\,dx, M(f)=\max_{0\le x\le 1}|f(x)|.\] Show that if $f$ and $g$ are continuous real-valued functions defined on the interval $[0,1],$ then \[\text{Var}(fg)\le 2\text{Var}(f)M(g)^2+2\text{Var}(g)M(f)^2.\]
Prove that the only function $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying the following is $f(x)=x$. (i) $\forall x \not= 0$, $f(x) = x^2f(\frac{1}{x})$. (ii) $\forall x, y$, $f(x+y) = f(x)+f(y)$. (iii) $f(1)=1$.
Let $e_1,\ldots, e_n$ be semilines on the plane starting from a common point. Prove that if there is no $u\not\equiv 0$ harmonic function on the whole plane that vanishes on the set $e_1\cup \cdots \cup e_n$, then there exists a pair $i,j$ of indices such that no $u\not\equiv 0$ harmonic function on the whole plane exists that vanishes on $e_i\cup e_j$.
Suppose that there are $16$ variables $\{a_{i,j}\}_{0\leq i,j\leq 3}$, each of which may be $0$ or $1$. For how many settings of the variables $a_{i,j}$ do there exist positive reals $c_{i,j}$ such that the polynomial \[f(x,y)=\sum_{0\leq i,j\leq 3}a_{i,j}c_{i,j}x^iy^j\] $(x,y\in\mathbb{R})$ is bounded below?
Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f(f(f(n)))+f(f(n))+f(n)=3n.\]
Find all functions $f:\mathbb R\to\mathbb R$ satisfying the equality $$ f(f(x)+f(y))=(x+y)f(x+y) $$ for all real $x$ and $y$. [i](B. Serankou)[/i]
Let $F_{n}$ be the $n-$ th Fibonacci number (where $F_{1}= F_{2}= 1$). Consider the functions $f_{n}(x)=\parallel . . . \parallel |x|-F_{n}|-F_{n-1}|-...-F_{2}|-F_{1}|, g_{n}(x)=| . . . \parallel x-1|-1|-...-1|$ ($F_{1}+...+F_{n}$ one’s). Show that $f_{n}(x) = g_{n}(x)$ for every real number $x.$
Determine all functions $f:(0,\infty)\to\mathbb{R}$ satisfying $$\left(x+\frac{1}{x}\right)f(y)=f(xy)+f\left(\frac{y}{x}\right)$$ for all $x,y>0$.
Let $\mathbb{Q}^+$ be the set of all positive rational numbers. Find all functions $f:\mathbb{Q}^+\rightarrow \mathbb{Q}^+$ satisfying $f(1)=1$ and \[ f(x+n)=f(x)+nf(\frac{1}{x}) \forall n\in\mathbb{N},x\in\mathbb{Q}^+\]
Let $a_{i}$ and $b_{i}$, where $i \in \{1,2, \dots, 2005 \}$, be real numbers such that the inequality $(a_{i}x-b_{i})^{2} \ge \sum_{j=1, j \not= i}^{2005} (a_{j}x-b_{j})$ holds for all $x \in \mathbb{R}$ and all $i \in \{1,2, \dots, 2005 \}$. Find the maximum possible number of positive numbers amongst $a_{i}$ and $b_{i}$, $i \in \{1,2, \dots, 2005 \}$.