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

Let $S$ be a set of positive integers $n_1, n_2, \cdots, n_6$ and let $n(f)$ denote the number $n_1n_{f(1)} +n_2n_{f(2)} +\cdots+n_6n_{f(6)}$, where $f$ is a permutation of $\{1, 2, . . . , 6\}$. Let \[\Omega=\{n(f) | f \text{ is a permutation of } \{1, 2, . . . , 6\} \} \] Give an example of positive integers $n_1, \cdots, n_6$ such that $\Omega$ contains as many elements as possible and determine the number of elements of $\Omega$.
$(a)$ Prove that for $a, b, c, d \in\mathbb{R}, m \in [1,+\infty)$ with $am + b =-cm + d = m$, \[(i)\sqrt{a^2 + b^2}+\sqrt{c^2 + d^2}+\sqrt{(a-c)^2 + (b-d)^2}\ge \frac{4m^2}{1+m^2},\text{ and}\] \[(ii) 2 \le \frac{4m^2}{1+m^2} < 4.\] $(b)$ Express $a, b, c, d$ as functions of $m$ so that there is equality in $(i).$
Let $a,b\in \mathbb{C}$. Prove that $\left| az+b\bar{z} \right|\le 1$, for every $z\in \mathbb{C}$, with $\left| z \right|=1$, if and only if $\left| a \right|+\left| b \right|\le 1$.
Let $ a,b,c$ be the three sides of a triangle. Determine all possible values of $ \frac {a^2 \plus{} b^2 \plus{} c^2}{ab \plus{} bc \plus{} ca}$
Find all triples $(a,b,c)$ of real numbers for which there exists a function $f:\mathbb{Z}^{+}\rightarrow\mathbb{Z}^{+}$ satisfying $af(n)+bf(n+1)+cf(n+2)<0$ for every $n\in\mathbb{Z}^{+}$ ($\mathbb{Z}^{+}$ denotes the set of positive integers). Proposed by [i]András Imolay[/i], Budapest
The function $ f(x,y,z)\equal{}\frac{x^2\plus{}y^2\plus{}z^2}{x\plus{}y\plus{}z}$ is defined for every $ x,y,z \in R$ whose sum is not 0. Find a point $ (x_0,y_0,z_0)$ such that $ 0 < x_0^2\plus{}y_0^2\plus{}z_0^2 < \frac{1}{1999}$ and $ 1.999 < f(x_0,y_0,z_0) < 2$.
Let f be a ternary operation on a set of at least four elements for which (1) $f ( x , x , y ) \equiv f ( x , y , x ) \equiv f( x , y , y ) \equiv x$ (2) $f ( x , y , z ) = f ( y , z , x ) = f ( y , x , z ) \in \{ x , y , z \}$ for pairwise distinct x,y,z. Prove that f is a nontrivial composition of g such that g is not a composition of f. (The n-variable operation g is trivial if $g(x_1, ..., x_n) \equiv x_i$ for some i ($1 \leq i \leq n$) )
Find all strictly increasing functions $f:\mathbb{N}\rightarrow\mathbb{N}$ that satisfy \[f(n+f(n))=2f(n)\quad\text{for all}\ n\in\mathbb{N} \]
Find all functions $R-->R$ such that: $f(x^2) - f(y^2) + 2x + 1 = f(x + y)f(x - y)$
$f(x)$ is an even function with period of $2$. If $f(x)=x^{\frac{1}{1000}}$ when $x\in[0,1]$, then the order of $f\left(\frac{98}{19}\right),f\left(\frac{101}{17}\right),f\left(\frac{104}{15}\right)$ is________(from small to large).
Find all functions $f: \mathbb Q \to \mathbb Q$ such that $ f(x^{2}\plus{}y\plus{}f(xy)) \equal{} 3\plus{}(x\plus{}f(y)\minus{}2)f(x)$ for all $x,y \in \mathbb Q$.
Consider pairs $(f,g)$ of functions from the set of nonnegative integers to itself such that [list] [*]$f(0) \geq f(1) \geq f(2) \geq \dots \geq f(300) \geq 0$ [*]$f(0)+f(1)+f(2)+\dots+f(300) \leq 300$ [*]for any 20 nonnegative integers $n_1, n_2, \dots, n_{20}$, not necessarily distinct, we have $$g(n_1+n_2+\dots+n_{20}) \leq f(n_1)+f(n_2)+\dots+f(n_{20}).$$ [/list] Determine the maximum possible value of $g(0)+g(1)+\dots+g(6000)$ over all such pairs of functions. [i]Sean Li[/i]
The number of maps $f$ from $1,2,3$ into the set $1,2,3,4,5$ such that $f(i)\le f(j)$ whenever $i\le j$ is $\textbf{(A)}~60$ $\textbf{(B)}~50$ $\textbf{(C)}~35$ $\textbf{(D)}~30$
Let $X$ be the set of all positive real numbers. Find all functions $f : X \longrightarrow X$ such that \[f (x + y) \ge f (x) + yf (f (x))\] for all $x$ and $y$ in $X$.
Consider the matrix $ A,B\in \mathcal l{M}_3(\mathbb{C})$ with $ A=-^tA$ and $ B=^tB$. Prove that if the polinomial function defined by \[ f(x)=\det(A+xB)\] has a multiple root, then $ \det(A+B)=\det B$.
For a positive integer $n$, we define the function $f_n(x)=\sum_{k=1}^n |x-k|$ for all real numbers $x$. For any two-digit number $n$ (in decimal representation), determine the set of solutions $\mathbb{L}_n$ of the inequality $f_n(x)<41$. [i](41st Austrian Mathematical Olympiad, National Competition, part 1, Problem 2)[/i]
Find all functions $f: \mathbb{Z}^+\rightarrow \mathbb{Z}^+$ such that for all positive integers $m,n$ with $m\ge n$, $$f(m\varphi(n^3)) = f(m)\cdot \varphi(n^3).$$ Here $\varphi(n)$ denotes the number of positive integers coprime to $n$ and not exceeding $n$.
$a,b,c,x,y,z$ are positive real numbers and $bz+cy=a$, $az+cx=b$, $ay+bx=c$. Find the least value of following function $f(x,y,z)=\frac{x^2}{1+x}+\frac{y^2}{1+y}+\frac{z^2}{1+z}$
$n$ is a natural number. $d$ is the least natural number that for each $a$ that $gcd(a,n)=1$ we know $a^{d}\equiv1\pmod{n}$. Prove that there exist a natural number that $\mbox{ord}_{n}b=d$
Let $K$ be a finite field and $f:K\to K^*$. Prove that there is a reducible polynomial $P\in K[X]$ s.t. $P(x)=f(x),\forall x\in K$. [i]Marian Andronache[/i]
Find all functions $f: \mathbb{Q} \mapsto \mathbb{C}$ satisfying (i) For any $x_1, x_2, \ldots, x_{1988} \in \mathbb{Q}$, $f(x_{1} + x_{2} + \ldots + x_{1988}) = f(x_1)f(x_2) \ldots f(x_{1988})$. (ii) $\overline{f(1988)}f(x) = f(1988)\overline{f(x)}$ for all $x \in \mathbb{Q}$.
Find the smallest nonnegative integer $n$ for which $\binom{2006}{n}$ is divisible by $7^3$.
Find all non-decreasing functions from real numbers to itself such that for all real numbers $x,y$ $f(f(x^2)+y+f(y))=x^2+2f(y)$ holds.
What is the value of $2-(-2)^{-2}$? $ \textbf{(A) } -2 \qquad\textbf{(B) } \dfrac{1}{16} \qquad\textbf{(C) } \dfrac{7}{4} \qquad\textbf{(D) } \dfrac{9}{4} \qquad\textbf{(E) } 6 $
Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\] [i]Proposed by Denmark[/i]