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

Determine all strictly increasing functions $f: \mathbb{N}\to\mathbb{N}$ satisfying $nf(f(n))=f(n)^2$ for all positive integers $n$. [i]Carl Lian and Brian Hamrick.[/i]
Prove that the solid angle based on a given closed contour is a function of the vertex of the angle that is harmonic outside the contour.
Let $a \in \mathbb{R}$ be a parameter. (1) Prove that the curves of $y = x^2 + (a + 2)x - 2a + 1$ pass through a fixed point; also, the vertices of these parabolas all lie on the curve of a certain parabola. (2) If the function $x^2 + (a + 2)x - 2a + 1 = 0$ has two distinct real roots, find the value range of the larger root.
Find all continuous functions $f: \mathbb{R}\to\mathbb{R}$ such that for all real $x$ we have \[f(x)=f\left(x^{2}+\frac{x}{3}+\frac{1}{9}\right). \]
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)}.\]
Let $G=G(V,E)$ be a simple graph with vertex set $V$ and edge set $E$. Suppose $|V|=n$. A map $f:\,V\rightarrow\mathbb{Z}$ is called good, if $f$ satisfies the followings: (1) $\sum_{v\in V} f(v)=|E|$; (2) color arbitarily some vertices into red, one can always find a red vertex $v$ such that $f(v)$ is no more than the number of uncolored vertices adjacent to $v$. Let $m(G)$ be the number of good maps. Prove that if every vertex in $G$ is adjacent to at least one another vertex, then $n\leq m(G)\leq n!$.
Determine the radius of a sphere $S$ that passes through the centroids of each face of a given tetrahedron $T$ inscribed in a unit sphere with center $O$. Also, determine the distance from $O$ to the center of $S$ as a function of the edges of $T.$
Determine all functions $ f$ defined on the set of rational numbers that take rational values for which \[ f(2f(x) \plus{} f(y)) \equal{} 2x \plus{} y, \] for each $ x$ and $ y$.
Let $S = \{1,2,3,4,5\}$. Find the number of functions $f : S \to S$ such that $f ^{50}(x)= x$ for all $x \in S$.
Let $ f$ be a strictly increasing, continuous function mapping $ I=[0,1]$ onto itself. Prove that the following inequality holds for all pairs $ x,y \in I$: \[ 1-\cos (xy) \leq \int_0^xf(t) \sin (tf(t))dt + \int_0^y f^{-1}(t) \sin (tf^{-1}(t)) dt .\] [i]Zs. Pales[/i]
Let P be an interior point of a regular n-gon $ A_1 A_2 ...A_n$, the lines $ A_i P$ meet the regular n-gon at another point $ B_i$, where $ i\equal{}1,2,...,n$. Prove that sums of all $ PA_i\geq$ sum of all $ PB_i$.
Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ that satisfy $$(f(a)-f(b))(f(b)-f(c))(f(c)-f(a)) = f(ab^2+bc^2+ca^2) - f(a^2b+b^2c+c^2a)$$for all real numbers $a$, $b$, $c$. [i]Proposed by Ankan Bhattacharya, USA[/i]
Let $ f:[0,\infty )\longrightarrow\mathbb{R} $ a bounded and periodic function with the property that $$ |f(x)-f(y)|\le |\sin x-\sin y|,\quad\forall x,y\in[0,\infty ) . $$ Show that the function $ [0,\infty ) \ni x\mapsto x+f(x) $ is monotone.
Let $ U\subset\mathbb R^n$ be an open set, and let $ L: U\times\mathbb R^n\to\mathbb R$ be a continuous, in its second variable first order positive homogeneous, positive over $ U\times (\mathbb R^n\setminus\{0\})$ and of $ C^2$-class Langrange function, such that for all $ p\in U$ the Gauss-curvature of the hyper surface \[ \{ v\in\mathbb R^n \mid L(p,v) \equal{} 1 \}\] is nowhere zero. Determine the extremals of $ L$ if it satisfies the following system \[ \sum_{k \equal{} 1}^n y^k\partial_k\partial_{n \plus{} i}L \equal{} \sum_{k \equal{} 1}^n y^k\partial_i\partial_{n \plus{} k} L \qquad (i\in\{1,\dots,n\})\] of partial differetial equations, where $ y^k(u,v) : \equal{} v^k$ for $ (u,v)\in U\times\mathbb R^k$, $ v \equal{} (v^1,\dots,v^k)$.
Let $ \{\phi_n(x) \}$ be a sequence of functions belonging to $ L^2(0,1)$ and having norm less that $ 1$ such that for any subsequence $ \{\phi_{n_k}(x) \}$ the measure of the set \[ \{x \in (0,1) : \;|\frac{1}{\sqrt{N}} \sum _{k=1}^N \phi_{n_k}(x)| \geq y\ \}\] tends to $ 0$ as $ y$ and $ N$ tend to infinity. Prove that $ \phi_n$ tends to $ 0$ weakly in the function space $ L^2(0,1).$ [i]F. Moricz[/i]
Let $ f \ne 0$ be a polynomial with real coefficients. Define the sequence $ f_{0}, f_{1}, f_{2}, \ldots$ of polynomials by $ f_{0}= f$ and $ f_{n+1}= f_{n}+f_{n}'$ for every $ n \ge 0$. Prove that there exists a number $ N$ such that for every $ n \ge N$, all roots of $ f_{n}$ are real.
Prove that for all $X > 1$, there exists a triangle whose sides have lengths $P_1(X) = X^4+X^3+2X^2+X+1, P_2(X) = 2X^3+X^2+2X+1$, and $P_3(X) = X^4-1$. Prove that all these triangles have the same greatest angle and calculate it.
Solve the equation $|x^2 -1|+ |x^2 - 4| = mx$ as a function of the parameter $m$. Which pairs $(x,m)$ of integers satisfy this equation?
Let $n$ and $r$ two positive integers. It is wanted to make $r$ subsets $A_1,\ A_2,\dots,A_r$ from the set $\{0,1,\cdots,n-1\}$ such that all those subsets contain exactly $k$ elements and such that, for all integer $x$ with $0\leq{x}\leq{n-1}$ there exist $x_1\in{}A_1,\ x_2\in{}A_2 \dots,x_r\in{}A_r$ (an element of each set) with $x=x_1+x_2+\cdots+x_r$. Find the minimum value of $k$ in terms of $n$ and $r$.
Let \[f(x)=\dfrac{1}{1-\dfrac{1}{1-x}}\,.\] Compute $f^{2016}(2016)$, where $f$ is composed upon itself $2016$ times.
What is the maximum number of points of intersection of the graphs of two different fourth degree polynomial functions $ y \equal{} p(x)$ and $ y \equal{} q(x)$, each with leading coefficient $ 1$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 8$
Let $f : N \to N$ be a strictly increasing function such that $f(f(n))= 3n$, for all $n \in N$. Find $f(2010)$. Note: $N = \{0,1,2,...\}$
Let $\mathbb{N}=\{1,2,\ldots\}$. Find all functions $f: \mathbb{N}\to\mathbb{N}$ such that for all $m,n\in \mathbb{N}$ the number $f^2(m)+f(n)$ is a divisor of $(m^2+n)^2$.
Find all pairs $(x, y)$ of real numbers such that \[y^2 - [x]^2 = 19.99 \text{ and } x^2 + [y]^2 = 1999\] where $f(x)=[x]$ is the floor function.
Compute the number of real numbers $t$ such that \[t = 50 \sin(t - \lfloor t \rfloor).\] Here $\lfloor \cdot\rfloor$ denotes the greatest integer function. [i]Proposed by David Altizio[/i]