Found problems: 2529
The edges of $K_{2017}$ are each labeled with $1,2,$ or $3$ such that any triangle has sum of labels at least $5.$ Determine the minimum possible average of all $\dbinom{2017}{2}$ labels.
(Here $K_{2017}$ is defined as the complete graph on 2017 vertices, with an edge between every pair of vertices.)
[i]Proposed by Michael Ma[/i]
Find the smallest possible value of the expression \[\left\lfloor\frac{a+b+c}{d}\right\rfloor+\left\lfloor\frac{b+c+d}{a}\right\rfloor+\left\lfloor\frac{c+d+a}{b}\right\rfloor+\left\lfloor\frac{d+a+b}{c}\right\rfloor\]
in which $a,~ b,~ c$, and $d$ vary over the set of positive integers.
(Here $\lfloor x\rfloor$ denotes the biggest integer which is smaller than or equal to $x$.)
Find the largest positive real number $p$ (if it exists) such that the inequality
\[x^2_1+ x_2^2+ \cdots + x^2_n\ge p(x_1x_2 + x_2x_3 + \cdots + x_{n-1}x_n)\]
is satisfied for all real numbers $x_i$, and $(a) n = 2; (b) n = 5.$
Find the largest positive real number $p$ (if it exists) such that the inequality holds for all real numbers $x_i$ and all natural numbers $n, n \ge 2.$
Given integer $n\geq 2$ and positive real number $a$, find the smallest real number $M=M(n,a)$, such that for any positive real numbers $x_1,x_2,\cdots,x_n$ with $x_1 x_2\cdots x_n=1$, the following inequality holds:
\[\sum_{i=1}^n \frac {1}{a+S-x_i}\leq M\]
where $S=\sum_{i=1}^n x_i$.
Let $ABC$ be a triangle. Let $\Omega$ be the brocard point. Prove that $\left(\frac{A\Omega}{BC}\right)^2+\left(\frac{B\Omega}{AC}\right)^2+\left(\frac{C\Omega}{AB}\right)^2\ge 1$
Let $ n $ be an integer greater than or equal to $ 2 $. Prove that if the real numbers $ a_1 , a_2 , \cdots , a_n $ satisfy $ a_1 ^2 + a_2 ^2 + \cdots + a_n ^ 2 = n $, then
\[\sum_{1 \le i < j \le n} \frac{1}{n- a_i a_j} \le \frac{n}{2} \]
must hold.
Let $a, b > 0$ be reals such that
\[ a^3=a+1\\ b^6=b+3a \]
Show that $a>b$
Let $n\geq 2$ be an integer. Find the smallest real value $\rho (n)$ such that for any $x_i>0$, $i=1,2,\ldots,n$ with $x_1 x_2 \cdots x_n = 1$, the inequality
\[ \sum_{i=1}^n \frac 1{x_i} \leq \sum_{i=1}^n x_i^r \] is true for all $r\geq \rho (n)$.
The vertices of a quadrilateral lie on the graph of $y = \ln x$, and the $x$-coordinates of these vertices are consecutive positive integers. The area of the quadrilateral is $\ln \frac{91}{90}$. What is the $x$-coordinate of the leftmost vertex?
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 10\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 13$
Let $n\geq 2$ be some fixed positive integer and suppose that $a_1, a_2,\dots,a_n$ are positive real numbers satisfying $a_1+a_2+\cdots+a_n=2^n-1$.
Find the minimum possible value of $$\frac{a_1}{1}+\frac{a_2}{1+a_1}+\frac{a_3}{1+a_1+a_2}+\cdots+\frac{a_n}{1+a_1+a_2+\cdots+a_{n-1}}$$
If $x$ and $y$ are positive real numbers such that $(x + \sqrt{x^2 + 1})(y +\sqrt{y^2 + 1}) = 2018$:
The minimum possible value of $x + y$ is
A. $\frac{2017}{\sqrt{2018}}$ B. $\frac{2018}{\sqrt{2019}}$ C. $\frac{2017}{2\sqrt{2018}}$ D. $\frac{2019}{\sqrt{2018}}$ E. $\sqrt{3}$
If $x$ and $y$ are nonnegative real numbers with $x+y= 2$, show that $x^2y^2(x^2+y^2)\le 2$.
Let $a, b, c$ be positive reals so that $a^2+b^2+c^2=1$. Find the minimum value of $S=1/a^2+1/b^2+1/c^2-2(a^3+b^3+c^3)/abc$
Positive integers $x$ and $y$ satisfy the equation $\sqrt{x}+\sqrt{y}=\sqrt{1183}.$ What is the minimum possible value of $x+y?$
$\textbf{(A) }585 \qquad\textbf{(B) }595\qquad\textbf{(C) }623\qquad\textbf{(D) }700\qquad\textbf{(E) }791$
Determine all triplets of real numbers $(x, y, z)$ that satisfy the equation $4xyz = x^4 + y^4 + z^4 + 1$.
Let a.b.c be positive reals such that their sum is 1. Prove that
$ \frac{a^{2}b^{2}}{c^{3}(a^{2}\minus{}ab\plus{}b^{2})}\plus{}\frac{b^{2}c^{2}}{a^{3}(b^{2}\minus{}bc\plus{}c^{2})}\plus{}\frac{a^{2}c^{2}}{b^{3}(a^{2}\minus{}ac\plus{}c^{2})}\geq \frac{3}{ab\plus{}bc\plus{}ac}$
Find the maximal value of
\[S = \sqrt[3]{\frac{a}{b+7}} + \sqrt[3]{\frac{b}{c+7}} + \sqrt[3]{\frac{c}{d+7}} + \sqrt[3]{\frac{d}{a+7}},\]
where $a$, $b$, $c$, $d$ are nonnegative real numbers which satisfy $a+b+c+d = 100$.
[i]Proposed by Evan Chen, Taiwan[/i]
Each row of a $24 \times 8$ table contains some permutation of the numbers $1, 2, \cdots , 8.$ In each column the numbers are multiplied. What is the minimum possible sum of all the products?
[i](C. Wu)[/i]
The sequence $(x_n)$ is defined as follows:
$$x_1=2,\, x_{n+1}=\sqrt{x_n+8}-\sqrt{x_n+3}$$
for all $n\geq 1$.
a. Prove that $(x_n)$ has a finite limit and find that limit.
b. For every $n\geq 1$, prove that
$$n\leq x_1+x_2+\dots +x_n\leq n+1.$$
Initially five variables are defined: $a_1=1, a_2=0, a_3=0, a_4=0, a_5=0.$ On a turn, Evan can choose an integer $2 \le i \le 5.$ Then, the integer $a_{i-1}$ will be added to $a_i$. For example, if Evan initially chooses $i = 2,$ then now $a_1=1, a_2=0+1=1, a_3=0, a_4=0, a_5=0.$ Find the minimum number of turns Evan needs to make $a_5$ exceed $1,000,000.$
Let $a$, $b$, $c$ and $d$ be real numbers such that $a+b+c+d=8$. Prove the inequality:
$$\frac{a}{\sqrt[3]{8+b-d}}+\frac{b}{\sqrt[3]{8+c-a}}+\frac{c}{\sqrt[3]{8+d-b}}+\frac{d}{\sqrt[3]{8+a-c}} \geq 4$$
Prove that if the product of positive numbers $a,b$ and $c$ equals one, then $\frac{1}{a(a+1)}+\frac{1}{b(b+1)}+\frac{1}{c(c+1)}\ge \frac{3}{2}$
Find positive real numbers $x,y,z$ that are solutions of the system
$x+y+z=xy+yz+zx$ and $xyz=1$ , and have the smallest possible sum.
Find all functions $f:\mathbb{R^+} \to \mathbb{R^+}$ such that for all positive real $x, y$ holds
$$xf(x)+yf(y)=(x+y)f\left(\frac{x^2+y^2}{x+y}\right)$$.
[i]Fedir Yudin[/i]
Find all pairs $(x,y)$ of real numbers that satisfy,
\begin{align*}
x^2+y^2+x+y &= xy(x+y)-\frac{10}{27}\\
|xy| & \leq \frac{25}{9}.
\end{align*}