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

Let $A$ be a non-empty set of positive integers. Suppose that there are positive integers $b_1,\ldots b_n$ and $c_1,\ldots,c_n$ such that - for each $i$ the set $b_iA+c_i=\left\{b_ia+c_i\colon a\in A\right\}$ is a subset of $A$, and - the sets $b_iA+c_i$ and $b_jA+c_j$ are disjoint whenever $i\ne j$ Prove that \[{1\over b_1}+\,\ldots\,+{1\over b_n}\leq1.\]
Let $a,b,c>0$ and $a+b+c=6$ . Prove that $$ \frac{1}{a^2b+16}+\frac{1}{b^2c+16}+\frac{1}{c^2a+16} \ge \frac{1}{8}.$$
a, b, c are positive real numbers and a+b+c=k. Find the minimum value of $ b^2/(ka+bc)^1/2+c^2/(kb+ac)^1/2+a^2/(kc+ab)^1/2 $
Let $A_1A_2 \ldots A_n$ be a convex polygon. Point $P$ inside this polygon is chosen so that its projections $P_1, \ldots , P_n$ onto lines $A_1A_2, \ldots , A_nA_1$ respectively lie on the sides of the polygon. Prove that for arbitrary points $X_1, \ldots , X_n$ on sides $A_1A_2, \ldots , A_nA_1$ respectively, \[\max \left\{ \frac{X_1X_2}{P_1P_2}, \ldots, \frac{X_nX_1}{P_nP_1} \right\} \geq 1.\] [i]Proposed by Nairi Sedrakyan, Armenia[/i]
Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]
Let $n$ be a positive integer. Prove that $n\sqrt{19}\{n\sqrt{19}\} > 1$, where $\{x\}$ denotes the fractional part of $x$.
Let $a,b,c$ be positive reals. Find the minimum value of $$\dfrac{13a+13b+2c}{2a+2b}+\dfrac{24a-b+13c}{2b+2c}+\dfrac{(-a+24b+13c)}{2c+2a}$$. (1)What is the minimum value? (2)If the minimum value occurs when $(a,b,c)=(a_0,b_0,c_0)$,then find $\frac{b_0}{a_0}+\frac{c_0}{b_0}$.
Let $ a$, $ b$ and $ c$ be the lengths of the sides of a triangle. Prove that \[ a^{2}b(a \minus{} b) \plus{} b^{2}c(b \minus{} c) \plus{} c^{2}a(c \minus{} a)\ge 0. \] Determine when equality occurs.
Find the largest real number $k$, such that for any positive real numbers $a,b$, $$(a+b)(ab+1)(b+1)\geq kab^2$$
If $a$, $b$ and $c$ are sides of triangle which perimeter equals $1$, prove that: $a^2+b^2+c^2+4abc<\frac{1}{2}$
Show that $1 \le n^{1/n} \le 2$ for all positive integers $n$. Find the smallest $k$ such that $1 \le n ^{1/n} \le k$ for all positive integers $n$.
Let ${a_n}$ be a non-increasing sequence of positive numbers. Prove that if for $n \ge 2001$, $na_{n} \le 1$, then for any positive integer $m \ge 2001$ and $x \in \mathbb{R}$, the following inequality holds: $\left | \sum_{k=2001}^{m} a_{k} \sin kx \right | \le 1 + \pi$
Suppose that $ n \geq 2$ and $ x_1, x_2, \ldots, x_n$ are real numbers between 0 and 1 (inclusive). Prove that for some index $ i$ between $ 1$ and $ n \minus{} 1$ the inequality \[ x_i (1 \minus{} x_{i\plus{}1}) \geq \frac{1}{4} x_1 (1 \minus{} x_{n})\]
Let $n\geq 2$ be an integer. For each $k$-tuple of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+\cdots +a_k=n$, consider the sums $S_i=1+2+\ldots +a_i$ for $1\leq i\leq k$. Determine, in terms of $n$, the maximum possible value of the product $S_1S_2\cdots S_k$. [i]Proposed by Misael Pelayo[/i]
Let be an increasing, infinite sequence of natural numbers $ \left( a_n \right)_{n\ge 1} . $ [b]a)[/b] Prove that if $ a_n=n, $ for any natural numbers $ n, $ then $$ -2+2\sqrt{1+n} <\frac{1}{\sqrt{a_1}} +\frac{1}{\sqrt{a_2}} +\cdots +\frac{1}{\sqrt{a_n}} <2\sqrt n , $$ for any natural numbers $ n. $ [b]b)[/b] Disprove the converse of [b]a).[/b] [i]Vasile Radu[/i]
If $x,y,z$ are positive numbers, prove that $$\frac x{\sqrt{y+z}}+\frac y{\sqrt{z+x}}+\frac z{\sqrt{x+y}}\ge\sqrt{\frac32(x+y+z)}.$$
For $a,b,c$ positive real numbers satisfying $a^2+b^2+c^2 \geq 3$,show that: $\sqrt[3]{\frac{a^3+b^3+c^3}{3}}+\frac{a+b+c}{9} \geq \frac{4}{3}$.
Let $a,b,A,B$ be given reals. We consider the function defined by \[ f(x) = 1 - a \cdot \cos(x) - b \cdot \sin(x) - A \cdot \cos(2x) - B \cdot \sin(2x). \] Prove that if for any real number $x$ we have $f(x) \geq 0$ then $a^2 + b^2 \leq 2$ and $A^2 + B^2 \leq 1.$
Given $a;b;c$ satisfying $a^{2}+b^{2}+c^{2}=2$ . Prove that: a) $\left | a+b+c-abc \right |\leqslant 2$ . b) $\left | a^{3}+b^{3}+c^{3}-3abc \right |\leqslant 2\sqrt{2}$
For all positive real numbers $a, b,c.$ Prove the folllowing inequality$$\frac{a}{c+5b}+\frac{b}{a+5c}+\frac{c}{b+5a}\geq\frac{1}{2}.$$
Let $a,b,A,B$ be given reals. We consider the function defined by \[ f(x) = 1 - a \cdot \cos(x) - b \cdot \sin(x) - A \cdot \cos(2x) - B \cdot \sin(2x). \] Prove that if for any real number $x$ we have $f(x) \geq 0$ then $a^2 + b^2 \leq 2$ and $A^2 + B^2 \leq 1.$
Let $a,b,c\geq 0$ and $a+b+c=1.$ Prove that$$\frac{a}{2a+1}+\frac{b}{3b+1}+\frac{c}{6c+1}\leq \frac{1}{2}.$$ [size=50](Marian Dinca)[/size]
Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way. 1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression \[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right| \] attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily. 2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$. Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$. [i]Author: Omid Hatami, Iran[/i]
Let $ \mathbb{R} ^{+} $ denote the set of all positive real numbers. Find all functions $ \mathbb{R} ^{+} \to \mathbb{R} ^{+} $ such that \[ f(x+f(y)) = yf(xy+1)\] holds for all $ x, y \in \mathbb{R} ^{+} $.
Let $a < b < c < d < e$ be positive integers. Prove that $$\frac{1}{[a, b]} + \frac{1}{[b, c]} + \frac{1}{[c, d]} + \frac{2}{[d, e]} \le 1$$ where $[x, y]$ is the least common multiple of $x$ and $y$ (e.g., $[6, 10] = 30$). When does equality hold?