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

Let $a, b$ be positive real numbers with $a>b$. Compute the minimum possible value of the expression \[\frac{a^2b - ab^2 + 8}{ab - b^2}.\]
Two lines intersect inside a unit square, splitting it into four regions. Find the maximum product of the areas of the four regions. [i]Proposed by Nathan Ramesh
Let $x, y, z \in R^+$. Prove that $$\frac{x}{x +\sqrt{(x + y)(x + z)}}+\frac{y}{y +\sqrt{(y + z)(y + x)}}+\frac{z}{z +\sqrt{(x + z)(z + y)}} \le 1$$
Let $ I $ be the incentre of $ ABC $ and $ D,E,F $ be the feet of the perpendiculars from $ I $ to $ BC,CA,AB, $ respectively. Show that $$ \frac{AB}{DE} +\frac{BC}{EF} +\frac{CA}{FD}\ge 6. $$
Find all triplets $ (x,y,z) $ of real numbers such that \[ 2x^3 + 1 = 3zx \]\[ 2y^3 + 1 = 3xy \]\[ 2z^3 + 1 = 3yz \]
Let $0 \le a_1 \le a_2 \le \dots \le a_n \le 1$ be $n$ real numbers with $n \ge 2$. Assume $a_1 + a_2 + \dots + a_n \ge n-1$. Prove that \[ a_2a_3\dots a_n \ge \left( 1 - \frac 1n \right)^{n-1} \]
Given $a,b,c \in\mathbb{R}^+$, and that $a^2+b^2+c^2=3$. Prove that \[ \frac{1}{a^3+2}+\frac{1}{b^3+2}+\frac{1}{c^3+2}\ge 1 \]
Let $a,b,c$ be distinct positive real numbers such that $\frac{1}{1+a}+\frac{1}{1+b}+\frac{1}{1+c}\leq 1$. Prove that $$2\left(\sqrt{\frac{a+b}{ac}}+\sqrt{\frac{b+c}{ba}}+\sqrt{\frac{c+a}{cb}}\right)<\frac{a^3}{(a-b)(a-c)}+\frac{b^3}{(b-c)(b-a)}+\frac{c^3}{(c-a)(c-b)}.$$
Let $D$, $E$, $F$ be points on the sides $BC$, $CA$, $AB$ respectively of a triangle $ABC$ (distinct from the vertices). If the quadrilateral $AFDE$ is cyclic, prove that \[ \frac{ 4 \mathcal A[DEF] }{\mathcal A[ABC] } \leq \left( \frac{EF}{AD} \right)^2 . \] [i]Greece[/i]
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
Let $a$, $b$ and $c$ be real numbers larger than $1$. Prove the inequality $$\frac{ab}{c-1}+\frac{bc}{a - 1}+\frac{ca}{b -1} \ge 12.$$ When does equality hold? [i](Karl Czakler)[/i]
Let $a,b,c\ge0$. Show that $(a^2+2bc)^{2012}+(b^2+2ca)^{2012}+(c^2+2ab)^{2012}\le (a^2+b^2+c^2)^{2012}+2(ab+bc+ca)^{2012}$. [i]Calvin Deng.[/i]
Four positive integers $x,y,z$ and $t$ satisfy the relations \[ xy - zt = x + y = z + t. \] Is it possible that both $xy$ and $zt$ are perfect squares?
A net for hexagonal pyramid is constructed by placing a triangle with side lengths $x$, $x$, and $y$ on each side of a regular hexagon with side length $y$. What is the maximum volume of the pyramid formed by the net if $x+y=20$?
Find the minimum value of $xy$, given that $x^2+y^2+z^2=7$, $xz+xy+yz=4$, and $x, y, z$ are real numbers
Given a positive integer $n$, determine the maximum number of lattice points in the plane a square of side length $n +\frac{1}{2n+1}$ may cover.
Find the greatest positive real number $ k$ such that the inequality below holds for any positive real numbers $ a,b,c$: \[ \frac ab \plus{} \frac bc \plus{} \frac ca \minus{} 3 \geq k \left( \frac a{b \plus{} c} \plus{} \frac b{c \plus{} a} \plus{} \frac c{a \plus{} b} \minus{} \frac 32 \right). \]
Find all non-zero real numbers $ x, y, z$ which satisfy the system of equations: \[ (x^2 \plus{} xy \plus{} y^2)(y^2 \plus{} yz \plus{} z^2)(z^2 \plus{} zx \plus{} x^2) \equal{} xyz\] \[ (x^4 \plus{} x^2y^2 \plus{} y^4)(y^4 \plus{} y^2z^2 \plus{} z^4)(z^4 \plus{} z^2x^2 \plus{} x^4) \equal{} x^3y^3z^3\]
Let $a_0,a_1,\cdots ,a_n$ be numbers from the interval $(0,\pi/2)$ such that \[ \tan (a_0-\frac{\pi}{4})+ \tan (a_1-\frac{\pi}{4})+\cdots +\tan (a_n-\frac{\pi}{4})\geq n-1. \] Prove that \[ \tan a_0\tan a_1 \cdots \tan a_n\geq n^{n+1}. \]
A game involves jumping to the right on the real number line. If $ a$ and $ b$ are real numbers and $ b>a,$ the cost of jumping from $ a$ to $ b$ is $ b^3\minus{}ab^2.$ For what real numbers $ c$ can one travel from $ 0$ to $ 1$ in a finite number of jumps with total cost exactly $ c?$
What is the minimum value of $ f(x) \equal{} |x \minus{} 1| \plus{} |2x \minus{} 1| \plus{} |3x \minus{} 1| \plus{} \cdots \plus{} |119x \minus{} 1|$? $ \textbf{(A)}\ 49 \qquad \textbf{(B)}\ 50 \qquad \textbf{(C)}\ 51 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 53$
For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]Proposed by Gerhard Woeginger, Netherlands[/i]
Let $a_1, a_2, \ldots, a_n$ be positive real numbers. Prove the inequality \[\binom n2 \sum_{i<j} \frac{1}{a_ia_j} \geq 4 \left( \sum_{i<j} \frac{1}{a_i+a_j} \right)^2\]
For positive integer $n\geq 3$ and real numbers $a_1,...,a_n,b_1,...,b_n$, prove the following. $$\sum_{i=1}^n a_i(b_i-b_{i+3})\leq\frac{3n}{8}\sum_{i=1}^n((a_i-a_{i+1})^2+(b_i-b_{i+1})^2)$$ ($a_{n+1}=a_1$, and for $i=1,2,3$ $b_{n+i}=b_i$.)
The equation $(x+a) (x+b) = 9$ has a root $a+b$. Prove that $ab\le 1$.