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: 1671

If $a,b,c,d,e$ are real numbers, prove the inequality $a^2 +b^2 +c^2 +d^2+e^2 \ge a(b+c+d+e)$.
Let $a, b, c$ be positive real numbers satisfying $a^3+b^3+c^3=a^4+b^4+c^4$. Show that \[ \frac{a}{a^2+b^3+c^3}+\frac{b}{a^3+b^2+c^3}+\frac{c}{a^3+b^3+c^2} \geq 1 \]
Let $x,y,z,w $ be real numbers such that $x+2y+3z+4w=1$. Find the minimum of $x^2+y^2+z^2+w^2+(x+y+z+w)^2$.
For a natural number $n$, with $v_2(n)$ we denote the largest integer $k\geq0$ such that $2^k|n$. Let us assume that the function $f\colon\mathbb{N}\to\mathbb{N}$ meets the conditions: $(i)$ $f(x)\leq3x$ for all natural numbers $x\in\mathbb{N}$. $(ii)$ $v_2(f(x)+f(y))=v_2(x+y)$ for all natural numbers $x,y\in\mathbb{N}$. Prove that for every natural number $a$ there exists exactly one natural number $x$ such that $f(x)=3a$.
We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least \[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}. \]
Let $a, b, c$ be reals satisfying $a^2+b^2+c^2=6$. Find the maximal values of the expressions a) $(a-b)^2+(b-c)^2+(c-a)^2$; b) $(a-b)^2 \cdot (b-c)^2 \cdot (c-a)^2$. In both cases, describe all triples for which equality holds.
Let $G$ be a graph, not containing $K_4$ as a subgraph and $|V(G)|=3k$ (I interpret this to be the number of vertices is divisible by 3). What is the maximum number of triangles in $G$?
[color=darkred]Let $ m,n\in \mathbb{N}$, $ n\ge 2$ and numbers $ a_i > 0$, $ i \equal{} \overline{1,n}$, such that $ \sum a_i \equal{} 1$. Prove that $ \small{\dfrac{a_1^{2 \minus{} m} \plus{} a_2 \plus{} ... \plus{} a_{n \minus{} 1}}{1 \minus{} a_1} \plus{} \dfrac{a_2^{2 \minus{} m} \plus{} a_3 \plus{} ... \plus{} a_n}{1 \minus{} a_1} \plus{} ... \plus{} \dfrac{a_n^{2 \minus{} m} \plus{} a_1 \plus{} ... \plus{} a_{n \minus{} 2}}{1 \minus{} a_1}\ge n \plus{} \dfrac{n^m \minus{} n}{n \minus{} 1}}$[/color]
Let $a,b,c>0.$ Prove that $\frac{1}{a+b}+\frac{1}{b+c}+\frac{1}{c+a} \ge \frac{1}{\sqrt{2a^2+2bc}}+\frac{1}{\sqrt{2b^2+2ca}}+\frac{1}{\sqrt{2c^2+2ab}}$
The area of a convex pentagon $ABCDE$ is $S$, and the circumradii of the triangles $ABC$, $BCD$, $CDE$, $DEA$, $EAB$ are $R_1$, $R_2$, $R_3$, $R_4$, $R_5$. Prove the inequality \[ R_1^4+R_2^4+R_3^4+R_4^4+R_5^4\geq {4\over 5\sin^2 108^\circ}S^2. \]
We have $2p-1$ integer numbers, where $p$ is a prime number. Prove that we can choose exactly $p$ numbers (from these $2p-1$ numbers) so that their sum is divisible by $p$.
Let $a, b, c$ positive reals such that $a+b+c=1$. Prove that $$\min\{a(1-b),b(1-c),c(1-a)\}\leq \frac{1}{4}$$ $$\max\{a(1-b),b(1-c),c(1-a)\}\geq \frac{2}{9}$$
[u]Algebra Round[/u] [b]p1.[/b] Given that $x$ and $y$ are nonnegative integers, compute the number of pairs $(x, y)$ such that $5x + y = 20$. [b]p2.[/b] $f(x) = x^2 + bx + c$ is a function with the property that the $x$-coordinate of the vertex is equal to the positive difference of the two roots of $f(x)$. Given that $c = 48$, compute $b$. [b]p3.[/b] Suppose we have a function $f(x)$ such that $f(x)^2 = f(x - 5)f(x + 5)$ for all integers $x$. Given that $f(1) = 1$ and $f(16) = 8$, what is $f(2016)$? [b]p4.[/b] Suppose that we have the following set of equations $$\log_2 x + \log_3 x + \log_4 x = 20$$ $$\log_4 y + \log_9 y + \log_{16} y = 16$$ Compute $\log_x y$. [b]p5.[/b] Let $\{a_n\}$ be the arithmetic sequence defined as $a_n = 2(n - 1) + 6$ for all $n \ge 1$. Compute $$\sum^{\infty}_{i=1} \frac{1}{a_ia_{i+2}}.$$ [b]p6.[/b] Let $a, b, c, d, e, f$ be non-negative real numbers. Suppose that $a + b + c + d + e + f = 1$ and $ad + be + cf \ge \frac{1}{18} $. Find the maximum value of $ab + bc + cd + de + ef + fa$. [b]p7.[/b] Let f be a continuous real-valued function defined on the positive real numbers. Determine all $f$ such that for all positive real $x, y$ we have $f(xy) = xf(y) + yf(x)$ and $f(2016) = 1$. [b]p8.[/b] Find the maximum of the following expression: $$21 cos \theta + 18 sin \theta sin \phi + 14 sin \theta cos \phi $$ [b]p9.[/b] $a, b, c, d$ satisfy the following system of equations $$ab + c + d = 13$$ $$bc + d + a = 27$$ $$cd + a + b = 30$$ $$da + b + c = 17.$$ Compute the value of $a + b + c + d$. [b]p10.[/b] Define a sequence of numbers $a_{n+1} = \frac{(2+\sqrt3)a_n+1}{(2+\sqrt3)-a_{n}}$ for $n > 0$, and suppose that $a_1 = 2$. What is $a_{2016}$? [u]Algebra Tiebreakers[/u] [b]Tie 1.[/b] Mark takes a two digit number $x$ and forms another two digit number by reversing the digits of $x$. He then sums the two values, obtaining a value which is divisible by $13$. Compute the smallest possible value of $x$. [b]Tie 2.[/b] Let $p(x) = x^4 - 10x^3 + cx^2 - 10x + 1$, where $c$ is a real number. Given that $p(x)$ has at least one real root, what is the maximum value of $c$? [b]Tie 3.[/b] $x$ satisfies the equation $(1 + i)x^3 + 8ix^2 + (-8 + 8i)x + 36 = 0$. Compute the largest possible value of $|x|$. PS. You should use hide for answers.
Find all nondecreasing functions $f: \mathbb{R}\rightarrow\mathbb{R}$ such that (i) $f(0) = 0, f(1) = 1;$ (ii) $f(a) + f(b) = f(a)f(b) + f(a + b - ab)$ for all real numbers $a, b$ such that $a < 1 < b$. [i]Proposed by A. Di Pisquale & D. Matthews, Australia[/i]
Let $p$ be a prime, and let $a_1, \dots, a_p$ be integers. Show that there exists an integer $k$ such that the numbers \[a_1 + k, a_2 + 2k, \dots, a_p + pk\] produce at least $\tfrac{1}{2} p$ distinct remainders upon division by $p$. [i]Proposed by Ankan Bhattacharya[/i]
Let $a$, $b$, $c$ be positive reals such that $a+b+c=3$. Show that $$\sqrt{\frac{a}{b+c}} + \sqrt{\frac{b}{c+a}} + \sqrt{\frac{c}{a+b}} \leq \frac{6}{\sqrt(a+b)(b+c)(c+a)}$$
Let $x_1,x_2,\ldots,x_n$ be arbitrary real numbers. Prove the inequality \[ \frac{x_1}{1+x_1^2} + \frac{x_2}{1+x_1^2 + x_2^2} + \cdots + \frac{x_n}{1 + x_1^2 + \cdots + x_n^2} < \sqrt{n}. \]
Let $\mathcal P$ denote the set of planes in three-dimensional space with positive $x$, $y$, and $z$ intercepts summing to one. A point $(x,y,z)$ with $\min \{x,y,z\} > 0$ lies on exactly one plane in $\mathcal P$. What is the maximum possible integer value of $\left(\frac{1}{4} x^2 + 2y^2 + 16z^2\right)^{-1}$? [i]Proposed by Sammy Luo[/i]
Let $0 < a < \frac{\pi}{2}$ and $x_1,x_2,...,x_n$ be real numbers such that $\sin x_1 + \sin x_2 +... + \sin x_n \ge n \cdot sin a $. Prove that $\sin (x_1 - a) + \sin (x_2 - a) + ... + \sin (x_n - a) \ge 0$ .
Let \(x,y,z\) be real numbers, each greater than \(1\). Prove that \(\dfrac{x+1}{y+1}+\dfrac{y+1}{z+1}+\dfrac{z+1}{x+1} \leq \dfrac{x-1}{y-1}+\dfrac{y-1}{z-1}+\dfrac{z-1}{x-1}\).
Let $n\ge2$ be a natural number, and $a_i$ be positive numbers, where $i=1,2,\cdots,n.$ Show that \[\left(a_1^3+1\right)\left(a_2^3+1\right)\cdots\left(a_n^3+1\right) \geq \left(a_1^2a_2+1\right)\left(a_2^2a_3+1\right)\cdots\left(a_n^2a_1+1\right)\]
Let $n\geq 2$ be an integer. Let $a_{ij}, \ i,j=1,2,\ldots,n$ be $n^2$ positive real numbers satisfying the following conditions: [list=1] [*]For all $i=1,\ldots,n$ we have $a_{ii}=1$ and, [*]For all $j=2,\ldots,n$ the numbers $a_{ij}, \ i=1,\ldots, j-1$ form a permutation of $1/a_{ji}, \ i=1,\ldots, j-1.$ [/list] Given that $S_i=a_{i1}+\cdots+a_{in}$, determine the maximum value of the sum $1/S_1+\cdots+1/S_n.$
Prove that for any points $A,B,C,D$ in the plane, the following inequality holds \[\frac{AB}{DA+DB}+\frac{BC}{DB+DC}\geqslant\frac{AC}{DA+DC}.\]
For two given positive integers $ m,n > 1$, let $ a_{ij} (i = 1,2,\cdots,n, \; j = 1,2,\cdots,m)$ be nonnegative real numbers, not all zero, find the maximum and the minimum values of $ f$, where \[ f = \frac {n\sum_{i = 1}^{n}(\sum_{j = 1}^{m}a_{ij})^2 + m\sum_{j = 1}^{m}(\sum_{i= 1}^{n}a_{ij})^2}{(\sum_{i = 1}^{n}\sum_{j = 1}^{m}a_{ij})^2 + mn\sum_{i = 1}^{n}\sum_{j=1}^{m}a_{ij}^2}. \]
A tree with $n\geq 2$ vertices is given. (A tree is a connected graph without cycles.) The vertices of the tree have real numbers $x_1,x_2,\dots,x_n$ associated with them. Each edge is associated with the product of the two numbers corresponding to the vertices it connects. Let $S$ be a sum of number across all edges. Prove that \[\sqrt{n-1}\left(x_1^2+x_2^2+\dots+x_n^2\right)\geq 2S.\] (Author: V. Dolnikov)