Dataset Viewer
Auto-converted to Parquet Duplicate
id
string
solution
string
answer
string
metadata
dict
problem
string
candidates
list
relevance_scores
list
relevance_scores_full
null
ours_27905
Let the distance between \( A \) and \( B \) be \( s \, \text{km} \) and the original speed of the train be \( v \, \text{km/hr} \). During the 6 hours before the halt, the first train covered \( 6v \, \text{km} \). The remaining distance of \( (s - 6v) \, \text{km} \) was covered at a speed of \( 1.2v \, \text{km/hr} ...
600 \, \text{km}
{ "competition": "misc", "dataset": "Ours", "posts": null, "source": "Problems in Elementary Mathematics - group_21.md" }
A train left a station \( A \) for \( B \) at 13:00. At 19:00 the train was brought to a halt by a snow drift. Two hours later the railway line was cleared, and to make up for the lost time, the train proceeded at a speed exceeding the original speed by \( 20\% \) and arrived at \( B \) only one hour later. The next da...
[ 20369, 10242, 3168, 8191, 39414, 58022, 66258, 11297, 38269, 64811, 5726, 63558, 3742, 14257, 14353, 5640, 11995, 8178, 55945, 20634, 23868, 10927, 977, 508, 67531, 3519, 51636, 65368, 52476, 49257, 3803, 43413, 65357, 20675, 68152, 14338, 4753...
null
null
numina_10042778
3. The trains are moving in the same direction, so they can move in the direction of $A B$ or $B A$. Let's consider each of these cases. The trains are moving in the direction of $A B$. 1) $40 \times 8=320$ km - the first train traveled; 2) $48 \times 8=384$ km - the second train traveled; 3) $384-320=64$ km - by thi...
956
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
3. Two trains leave from two cities at the same time. The first one travels at 40 km/h, while the second one travels at 48 km/h. How far apart will these trains be from each other after 8 hours, if they are moving in the same direction and the distance between the cities is 892 km?
[ 55076, 70655, 14246, 57376, 12829, 20344, 14200, 70405, 23425, 14324, 10661, 69560, 69954, 4504, 59674, 56503, 26148, 51568, 20837, 62148, 5652, 61111, 2578, 22085, 54232, 37099, 19993, 11434, 26556, 58243, 3807, 34268, 11344, 46038, 38828, 3226,...
null
null
aops_1184997
[quote=arqady] Hence, it remains to prove that $(a+b+c)^4\geq8\sum_{cyc}(a^3b+a^3c)$, which is obvious.[/quote] Let $x=a^2+b^2+c^2, \ y=ab+bc+ca$. $(a+b+c)^4=(x+2y)^2\ge 8xy=8\sum_{cyc}(a^3b+a^3c+a^2bc)\ge 8\sum_{cyc}(a^3b+a^3c)$
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "Given $a,b,c\\geq 0$, prove that $$\\sum_{cyc}^{}\\sqrt[3]{\\frac{a}{b+c}}\\geq 2$$", "content_html": "Given <span style=\"white-space:nowrap;\"><img src=\"//latex.artofproblemsolving.com/3/0/f/30fa6...
Given \(a,b,c\ge 0\), prove that \[ \sum_{\text{cyc}}\sqrt[3]{\frac{a}{b+c}}\ge 2. \]
[ 32387, 51250, 51559, 61986, 53364, 23144, 70682, 7273, 31288, 27385, 37925, 3940, 34367, 34365, 38462, 49359, 19648, 13267, 22269, 41621, 28487, 54426, 63576, 42686, 32266, 54130, 39451, 45715, 13367, 31203, 48354, 32961, 26783, 22407, 40295, 354...
null
null
numina_10734145
Proof: Let \( A=\frac{1}{1+a^{4}}, B=\frac{1}{1+b^{4}}, C=\frac{1}{1+c^{4}}, D=\frac{1}{1+d^{4}} \), then \( a^{4}=\frac{1-A}{A}, b^{4}=\frac{1-B}{B}, c^{4}=\frac{1-C}{C}, d^{4}=\frac{1-D}{D} \). Using the Arithmetic Mean-Geometric Mean Inequality, we get \[ \begin{aligned} & (B+C+D)(C+D+A)(D+A+B)(A+B+C) \\ \geqslant ...
proof
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "inequalities" }
Example 7 Let $a, b, c, d>0$. When $\frac{1}{1+a^{4}}+\frac{1}{1+b^{4}}+\frac{1}{1+c^{4}}+\frac{1}{1+d^{4}}=1$, prove: $a b c d \geqslant 3$. Translate the above text into English, please keep the original text's line breaks and format, and output the translation result directly.
[ 11468, 29265, 44102, 35403, 68532, 17838, 39403, 8811, 36500, 26757, 21812, 53221, 7392, 62426, 69267, 50356, 21466, 21627, 19049, 49208, 70146, 27655, 62951, 37896, 46675, 7434, 58073, 12541, 13707, 30131, 2946, 57019, 6952, 20402, 68202, 70752,...
null
null
numina_10117640
Because $0<x_{k} \leqslant x_{n}<1 \quad(k=1,2, \cdots, n)$ So $0<\frac{1-x_{n}}{1-x_{k}} \leqslant 1 \quad \cdot(k-n$ when taking “=” sign $)$ So $\left(1-x_{n}\right)^{2} \frac{x_{k}^{k}}{\left(1-x_{k}^{k} 1\right)^{2}}=\frac{\left(1-x_{n}\right)^{2}}{\left(1-x_{k}\right)^{2}} \cdot \frac{x_{k}^{k}}{\left(1+x_{k}...
proof
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
II. (50 points) Let $0<x_{1}<x_{2}<\cdots<x_{n}<1$, prove that: $$ \left(1-x_{n}\right)^{2}\left[\frac{x_{1}}{\left(1-x_{1}^{2}\right)^{2}}+\frac{x_{2}^{2}}{\left(1-x_{2}^{3}\right)^{2}}+\cdots+\frac{x_{n}^{n}}{\left(1-x_{n}^{n+1}\right)^{2}}\right]<1 $$
[ 57570, 67667, 49608, 36302, 51800, 20514, 51778, 10495, 9806, 32404, 46360, 14834, 68032, 29793, 48451, 54426, 44436, 59946, 42851, 36658, 46865, 15079, 32327, 36360, 33073, 69603, 4865, 52431, 22280, 69869, 59636, 32191, 67327, 49560, 40376, 618...
null
null
numina_10049625
### 4.30 Method I. We have $\sin 10 \alpha \sin 8 \alpha + \sin 8 \alpha \sin 6 \alpha - \sin 4 \alpha \sin 2 \alpha = \sin 8 \alpha \times$ $\times (\sin 10 \alpha + \sin 6 \alpha) - 2 \sin^2 2 \alpha \cos 2 \alpha = \sin 8 \alpha \cdot 2 \sin 8 \alpha \cdot$ $\cdot \cos 2 \alpha - 2 \sin^2 2 \alpha \cos 2 \alpha = 2...
2\cos2\alpha\sin6\alpha\sin10\alpha
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
$4.30 \sin 10 \alpha \sin 8 \alpha + \sin 8 \alpha \sin 6 \alpha - \sin 4 \alpha \sin 2 \alpha$.
[ 19394, 53269, 44806, 45156, 30857, 40764, 26685, 53126, 28305, 65349, 24115, 36365, 29750, 70776, 34307, 45872, 8732, 13195, 9403, 52370, 37426, 35407, 19553, 3253, 67357, 39651, 37360, 65668, 67462, 54818, 45554, 33933, 41921, 20418, 19883, 3854...
null
null
ours_17896
The given inequality can be transformed into: \[ x^{3}(x+1) + y^{3}(y+1) + z^{3}(z+1) \geq \frac{3}{4}(x+1)(y+1)(z+1) \] By the AM-GM inequality, it suffices to prove a stronger inequality: \[ x^{4} + x^{3} + y^{4} + y^{3} + z^{4} + z^{3} \geq \frac{1}{4} \left[(x+1)^{3} + (y+1)^{3} + (z+1)^{3}\right] \] Define \( ...
null
{ "competition": "imo", "dataset": "Ours", "posts": null, "source": "IMO1998SL.md" }
Let \( x, y, \) and \( z \) be positive real numbers such that \( x y z = 1 \). Prove that \[ \frac{x^{3}}{(1+y)(1+z)}+\frac{y^{3}}{(1+z)(1+x)}+\frac{z^{3}}{(1+x)(1+y)} \geq \frac{3}{4} \]
[ 59104, 32313, 27287, 51595, 54834, 34277, 60403, 29950, 16929, 70940, 21906, 39043, 16962, 57734, 25366, 59946, 40175, 55661, 29938, 58232, 42851, 28768, 49608, 31962, 39204, 56865, 58398, 29182, 53350, 44956, 32434, 54669, 48485, 54559, 47577, 5...
null
null
aops_576294
[quote="oldbeginner"]If $a, b, c>0$ prove that \[\frac{(a+b)(2b-c)}{a^2-ab+b^2}+\frac{(b+c)(2c-a)}{b^2-bc+c^2}+\frac{(c+a)(2a-b)}{c^2-ca+a^2}\le 6\][/quote] After expanding we need to prove that $\sum_{cyc}(a^5b+a^5c+3a^4b^2+a^4c^2-8a^4bc-4a^3b^3+2a^3b^2c+8a^3c^2b-4a^2b^2c^2)\geq0$, which follows from two obvious ineq...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "If $a, b, c>0$ prove that\n\\[\\frac{(a+b)(2b-c)}{a^2-ab+b^2}+\\frac{(b+c)(2c-a)}{b^2-bc+c^2}+\\frac{(c+a)(2a-b)}{c^2-ca+a^2}\\le 6\\]", "content_html": "If <img src=\"//latex.artofproblemsolving.com...
If \(a,b,c>0\), prove that \[ \frac{(a+b)(2b-c)}{a^2-ab+b^2}+\frac{(b+c)(2c-a)}{b^2-bc+c^2}+\frac{(c+a)(2a-b)}{c^2-ca+a^2}\le 6. \]
[ 50716, 61997, 15020, 60244, 32238, 25286, 44221, 63240, 34815, 49736, 51070, 48477, 32426, 58762, 58173, 53495, 64530, 42564, 32160, 47206, 50637, 33332, 60862, 45533, 54632, 59818, 63590, 53432, 54493, 37677, 35437, 52376, 34608, 53091, 41240, 3...
null
null
numina_10731840
Assume without loss of generality that $x \geqslant y \geqslant z$, it is easy to see that $$\begin{array}{l} \frac{x^{k+1}}{x^{k+1}+y^{k}+z^{k}} \geqslant \frac{y^{k+1}}{y^{k+1}+z^{k}+x^{k}} \geqslant \frac{z^{k+1}}{z^{k+1}+x^{k}+y^{k}} \\ z^{k+1}+x^{k}+y^{k} \geqslant y^{k+1}+z^{k}+x^{k} \geqslant x^{k+1}+y^{k}+z^{k}...
\frac{1}{7}
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "inequalities" }
Example 6.49 (2007 Serbia Mathematical Olympiad) $x, y, z>0, x+y+z=1$, prove that $$\frac{x^{k+2}}{x^{k+1}+y^{k}+z^{k}}+\frac{y^{k+2}}{y^{k+1}+z^{k}+x^{k}}+\frac{z^{k+2}}{z^{k+1}+x^{k}+y^{k}} \geqslant \frac{1}{7}$$
[ 21435, 29450, 60854, 1277, 22269, 18921, 21441, 25300, 67700, 65983, 39091, 71029, 45448, 33481, 32853, 64871, 59592, 34571, 37776, 5424, 49440, 45465, 52126, 7399, 48351, 59826, 62583, 34831, 67634, 7333, 8416, 56916, 41942, 45129, 36008, 32004,...
null
null
aops_2813730
Let me try. $x_1+ x_2+ x_3=9 ... \Large{ \textcircled{1}} $ $ x_1 x_2 x_3=15 ... \Large{ \textcircled{2}} $ $ x_1- x_2= x_2- x_3 ... \Large{ \textcircled{3}} $ Insert $ \Large{ \textcircled{3}}$ into $ \Large{ ...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "【National College Entrance Exam, old China】A$\\Sigma$-1\nSolve:\n$x^3-9x^2+23x-15=0$\nand, $ x_1- x_2=x_2-x_3$", "content_html": "【National College Entrance Exam, old China】<span style=\"white-spac...
【National College Entrance Exam, old China】A$\Sigma$-1 Solve: $x^3-9x^2+23x-15=0$ and, $ x_1- x_2=x_2-x_3$
[ 445, 34314, 61844, 53827, 17718, 20307, 44146, 40776, 6763, 22364, 63793, 19767, 23352, 67807, 2586, 46723, 57460, 37662, 3426, 41160, 11075, 37199, 52809, 57753, 19776, 66922, 68447, 32932, 59155, 68643, 34349, 23322, 23376, 41385, 68824, 69913,...
null
null
numina_10051913
## Solution. $\sin ^{6} \alpha+\cos ^{6} \alpha=\sin ^{4} \alpha-\sin ^{2} \alpha \cdot \cos ^{2} \alpha+\cos ^{4} \alpha=1-3 \sin ^{2} \alpha \cdot \cos ^{2} \alpha=$ $=1-\frac{3}{4} \sin ^{2} 2 \alpha=\frac{1+3 \cos ^{2} 2 \alpha}{4} \Rightarrow A=\frac{4}{1+3 \cos ^{2} 2 \alpha}$. From this, it is clear that $A$ t...
4
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
### 3.485 Find the maximum value of the expression $$ A=\frac{1}{\sin ^{6} \alpha+\cos ^{6} \alpha} \text { for } 0 \leq \alpha \leq \frac{\pi}{2} $$
[ 2003, 66187, 66030, 63878, 43296, 53266, 62435, 32370, 66556, 14060, 67867, 58351, 32101, 47346, 46778, 36150, 40123, 39088, 60797, 30163, 30324, 33265, 39597, 69157, 64892, 49859, 32384, 45949, 43114, 18314, 47729, 21283, 65298, 30270, 7632, 536...
null
null
numina_10050744
Solution. Rewrite this system in the form $\left\{\begin{array}{l}(x-y)(x-y)(x+y)=45, \\ x+y=5\end{array} \Leftrightarrow\left\{\begin{array}{l}(x-y)^{2}(x+y)=45, \\ x+y=5 .\end{array} \Rightarrow\right.\right.$ $\Rightarrow(x-y)^{2}=9$, from which $x-y=-3$ or $x-y=3$. We obtain a combination of two systems: 1) $\l...
(4,1),(1,4)
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
6.086. $\left\{\begin{array}{l}(x-y)\left(x^{2}-y^{2}\right)=45, \\ x+y=5\end{array}\right.$ Solve the system of equations: \[ \left\{\begin{array}{l} (x-y)\left(x^{2}-y^{2}\right)=45, \\ x+y=5 \end{array}\right. \]
[ 16724, 46964, 69247, 65465, 23212, 22720, 59362, 19459, 67145, 20716, 19784, 68136, 64228, 5119, 61798, 68273, 51342, 51427, 54758, 18758, 18752, 67355, 62442, 9461, 16037, 36527, 23466, 58807, 20400, 9350, 18174, 46766, 44638, 12681, 18944, 1389...
null
null
ours_4129
Let \( a+b+c=ab+bc+ca=k \). Since \((a+b+c)^{2} \geq 3(ab+bc+ca)\), we have \( k^{2} \geq 3k \). Since \( k>0 \), it follows that \( k \geq 3 \). We have \( bc \geq ca \geq ab \), so from the above relation, we deduce that \( bc \geq 1 \). By AM-GM, \( b+c \geq 2\sqrt{bc} \) and consequently \( b+c \geq 2 \). The equa...
null
{ "competition": "bmo", "dataset": "Ours", "posts": null, "source": "2019_bmo_shortlist-2.md" }
Let \( a, b, c \) be real numbers such that \( 0 \leq a \leq b \leq c \). Prove that if \[ a+b+c=ab+bc+ca>0, \] then \(\sqrt{bc}(a+1) \geq 2\). When does the equality hold?
[ 6307, 68530, 19636, 6365, 67373, 21597, 19366, 19393, 69245, 32444, 35117, 34358, 26568, 16824, 16365, 59898, 9835, 61038, 17664, 7717, 57967, 9846, 70980, 34767, 55070, 2060, 66076, 58047, 15588, 32224, 29361, 38685, 54855, 31473, 62015, 55068, ...
null
null
numina_10094681
Analyzing the given two expressions, which are symmetric with respect to $x, y, z$, we can assume $x \leqslant y \leqslant z$. Solution: Without loss of generality, let $x \leqslant y \leqslant z$, then $$ \begin{aligned} & x^{3}+y^{3}+z^{3}-x^{2}(y+z)-y^{2}(z+x)-z^{2}(x+y)+3 x y z \\ = & x^{3}-x^{2}(y+z)+x y z+y^{3}+z...
proof
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
Example 7 Let $x, y, z \in \mathbf{R}^{\prime}$, compare $x^{3}+y^{3}+z^{3}+3 x y z$ with $x^{2}(y+z)+y^{2}(z+x)+z^{2}(x+y)$.
[ 39149, 17183, 34655, 47737, 32243, 34815, 60987, 67746, 65755, 57466, 34008, 13088, 26244, 47158, 16821, 66415, 60958, 39335, 69518, 60844, 66824, 60946, 33840, 55990, 36289, 44979, 59018, 58392, 30397, 49582, 57701, 56646, 46063, 53556, 31115, 4...
null
null
numina_10180045
## Solution: Applying the inequality of means, we have: $a^{2}+b c \geq 2 \sqrt{a^{2} b c} \quad \frac{1}{a^{2}+b c} \leq \frac{1}{2 \sqrt{a^{2} b c}} \quad \frac{a}{a^{2}+b c} \leq \frac{1}{2 \sqrt{b c}}$ $b^{2}+a c \geq 2 \sqrt{b^{2} a c} \quad \frac{1}{b^{2}+a c} \leq \frac{1}{2 \sqrt{b^{2} a c}} \quad \frac{b}{b...
proof
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
## Problem 1 Let $\mathrm{a}, \mathrm{b}, \mathrm{c}$ be strictly positive real numbers. Show that: $\frac{\mathrm{a}}{\mathrm{a}^{2}+\mathrm{bc}}+\frac{\mathrm{b}}{\mathrm{b}^{2}+\mathrm{ac}}+\frac{\mathrm{c}}{\mathrm{c}^{2}+\mathrm{ab}} \leq \frac{1}{2}\left(\frac{1}{\mathrm{a}}+\frac{1}{\mathrm{~b}}+\frac{1}{\math...
[ 35023, 33922, 10887, 67779, 40403, 56924, 26568, 31373, 64626, 60575, 62675, 54818, 56287, 53058, 22886, 40006, 19968, 58749, 19552, 56103, 39170, 5130, 6804, 45735, 27656, 21636, 37780, 26681, 7205, 44008, 30685, 26174, 31512, 19613, 21039, 5038...
null
null
aops_436106
[hide="Solution"] If a quadratic has real roots, then its discriminant must be nonnegative. [hide="Reasoning"] The quadratic formula is $x=\dfrac{-b\pm\sqrt{b^2-4ac}}{2a}$. Its discriminant, $b^2-4ac$, is located inside the square root. What happens if the discriminant is negative?[/hide] The discriminant of $x^2+bx+...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "If $x^2+bx+16$ has real roots, find all possible values of $b$. Express your answer in interval notation.", "content_html": "If <img src=\"//latex.artofproblemsolving.com/9/7/5/9754a367606a271cab941d...
If \(x^2 + bx + 16\) has real roots, find all possible values of \(b\). Express your answer in interval notation.
[ 43568, 3243, 22562, 23897, 61411, 5060, 68571, 13805, 9830, 28014, 10398, 52862, 400, 13393, 20898, 45489, 9214, 19618, 18083, 45391, 51517, 69131, 58663, 23478, 21180, 22678, 46468, 4461, 36630, 19796, 44104, 24677, 14511, 21230, 65700, 13852, ...
null
null
numina_10048390
## Solution. Domain of definition: $x^{2}-4 \geq 0 \Leftrightarrow x \in(-\infty ;-2] \cup[2 ; \infty)$. Let's write the equation in the form $2^{x+\sqrt{x^{2}-4}}-\frac{5}{2} \cdot 2^{\frac{x+\sqrt{x^{2}-4}}{2}}-6=0$. Solving it as a quadratic equation in terms of $2^{\frac{x+\sqrt{x^{2}-4}}{2}}$, we get $2^{\frac{x...
\frac{5}{2}
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
7.215. $2^{x+\sqrt{x^{2}-4}}-5 \cdot(\sqrt{2})^{x-2+\sqrt{x^{2}-4}}-6=0$.
[ 68420, 16672, 4961, 18121, 3254, 3483, 20767, 65436, 24291, 6818, 3145, 22108, 1688, 19026, 48801, 6614, 19522, 23532, 16763, 35832, 23565, 5147, 16197, 5098, 5064, 69213, 58793, 16248, 1362, 21098, 5154, 61601, 3488, 5115, 7771, 19924, 8060, ...
null
null
aops_80134
[quote="Werwulff"][quote="nthd"]Prove that$\forall x,y,z \ge 0$ $\sum(\sqrt{x^2+yz}-\sqrt{y^2+zx})^2\le\sum(x-y)^2$ :) :)[/quote] It is trivial and thus boring to show that this inequality is equivalent to \[ \sum 2xy\leq\sum\sqrt{(x^2+yz)(y^2+zx)} \] which can easily be proved using cauc...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "Prove that$\\forall x,y,z \\ge 0$\r\n $\\sum(\\sqrt{x^2+yz}-\\sqrt{y^2+zx})^2\\le\\sum(x-y)^2$\r\n :) :)", "content_html": "Prove tha<span style=\"white-space:nowrap;\">t<...
Prove that for all nonnegative real numbers \(x,y,z\), \[ \sum_{\text{cyc}}\bigl(\sqrt{x^2+yz}-\sqrt{y^2+zx}\bigr)^2 \le \sum_{\text{cyc}}(x-y)^2. \]
[ 36043, 34866, 53709, 50723, 42382, 58660, 31784, 25963, 25956, 61580, 24334, 53052, 45315, 26585, 10463, 53313, 32199, 43630, 10565, 36361, 36930, 57932, 2780, 46232, 60314, 32272, 44406, 10495, 48401, 16747, 31963, 61121, 51778, 6900, 45430, 696...
null
null
numina_10234387
1. **Denote the sums for convenience:** \[ \sum_{j=1}^{m} a_{ij} = x_i \quad \text{and} \quad \sum_{i=1}^{n} a_{ij} = y_j \] Then, the function \( f \) can be rewritten as: \[ f = \frac{n \sum_{i=1}^{n} x_i^2 + m \sum_{j=1}^{m} y_j^2}{\left( \sum_{i=1}^{n} \sum_{j=1}^{m} a_{ij} \right)^2 + mn \sum_{i=...
\frac{m+n}{mn+n}
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "aops_forum" }
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}\su...
[ 31999, 53152, 66721, 3352, 47703, 15685, 61606, 41595, 30491, 16218, 45929, 68069, 41103, 39300, 43981, 29192, 33464, 42239, 61046, 56976, 39808, 31781, 7843, 38991, 43063, 35429, 45527, 62825, 26342, 28499, 26533, 8486, 24665, 51289, 43837, 6749...
null
null
aops_575416
[quote="hungkg"]Let $a,b,c$ be nonnegative real numbers such as $ab+bc+ca=1$. Prove that \[\frac{1}{{\sqrt {{a^2} + {b^2}} }} + \frac{1}{{\sqrt {{b^2} + {c^2}} }} + \frac{1}{{\sqrt {{c^2} + {a^2}} }} \ge 2 + \frac{1}{{\sqrt 2 }}.\][/quote] [b]This is my proof for problem[/b] Without of generality, we can assume that $...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "Let $a,b,c$ be nonnegative real numbers such as $ab+bc+ca=1$. Prove that \n\\[\\frac{1}{{\\sqrt {{a^2} + {b^2}} }} + \\frac{1}{{\\sqrt {{b^2} + {c^2}} }} + \\frac{1}{{\\sqrt {{c^2} + {a^2}} }} \\ge 2 + \\f...
Let \(a,b,c\) be nonnegative real numbers such that \(ab+bc+ca=1\). Prove that \[ \frac{1}{\sqrt{a^2+b^2}}+\frac{1}{\sqrt{b^2+c^2}}+\frac{1}{\sqrt{c^2+a^2}}\ge 2+\frac{1}{\sqrt2}. \]
[ 6960, 20402, 22987, 14579, 57510, 47871, 47594, 3332, 39118, 61704, 53067, 3659, 70654, 29597, 69759, 59921, 8196, 19049, 69210, 68313, 43859, 5665, 29943, 56473, 57177, 68616, 50142, 13521, 17804, 16166, 12701, 57252, 996, 50602, 40650, 17663, ...
null
null
aops_277949
[quote="quykhtn-qa1"]Let $ a,b,c$ be positive numbers such that: $ a \plus{} b \plus{} c \equal{} 1$.Prove that: $ \frac {a}{b^2 \plus{} b} \plus{} \frac {b}{c^2 \plus{} c} \plus{} \frac {c}{a^2 \plus{} a} \ge \frac {36(a^2 \plus{} b^2 \plus{} c^2)}{ab \plus{} bc \plus{} ca \plus{} 5}$[/quote] hello,i can prove your p...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "Let $ a,b,c$ be positive numbers such that: $ a\\plus{}b\\plus{}c\\equal{}1$.Prove that:\r\n$ \\frac{a}{b^2\\plus{}b}\\plus{}\\frac{b}{c^2\\plus{}c}\\plus{}\\frac{c}{a^2\\plus{}a} \\ge \\frac{36(a^2\\plus{...
Let \(a,b,c\) be positive numbers such that \(a+b+c=1\). Prove that \[ \frac{a}{b^2+b}+\frac{b}{c^2+c}+\frac{c}{a^2+a}\ge \frac{36(a^2+b^2+c^2)}{ab+bc+ca+5}. \]
[ 57926, 40470, 46122, 16325, 32116, 34093, 22605, 59972, 68666, 26506, 9172, 31656, 52865, 47255, 20743, 48828, 36841, 22264, 21203, 64016, 52424, 7774, 9551, 24733, 40693, 61148, 65340, 66877, 3889, 7501, 37051, 26298, 41567, 65488, 21158, 27650,...
null
null
numina_10103728
[Proof] Let $d=u_{k}-u_{k-1}$ be the common difference of the arithmetic sequence, then $$ \begin{aligned} t_{n} & =\frac{\sqrt{u_{2}}-\sqrt{u_{1}}}{u_{2}-u_{1}}+\frac{\sqrt{u_{3}}-\sqrt{u_{2}}}{u_{3}-u_{2}}+\cdots+\frac{\sqrt{u_{n}}-\sqrt{u_{n-1}}}{u_{n}-u_{n-1}} \\ & =\frac{\sqrt{u_{n}}-\sqrt{u_{1}}}{d} . \\ & =\frac...
proof
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
$3 \cdot 49$ Positive numbers $u_{1}, u_{2}, \cdots, u_{n}$ form an arithmetic sequence, prove: $$ \begin{aligned} t_{n} & =\frac{1}{\sqrt{u_{1}}+\sqrt{u_{2}}}+\frac{1}{\sqrt{u_{2}}+\sqrt{u_{3}}}+\cdots+\frac{1}{\sqrt{u_{n-1}}+\sqrt{u_{n}}} \\ & =\frac{n-1}{\sqrt{u_{1}}+\sqrt{u_{n}}} . \end{aligned} $$
[ 27325, 30338, 41045, 51031, 23657, 34958, 61788, 45469, 32056, 13129, 32845, 66904, 31247, 47852, 30081, 30187, 13115, 55785, 57307, 9538, 47706, 21767, 10010, 49734, 24042, 27931, 37633, 37740, 58600, 48476, 7495, 6807, 63313, 37505, 50733, 1743...
null
null
aops_3202306
[quote=williamxiao][hide=sol?]Subtract equation 1 from equation 2 to get $(y+x)(y-x) + (y-x)z = 1, (x+y+z)(y-x) = 1$ Same with 3 and 2, $(y+z)(y-z) + (y-z)x = 1$, $(y+z+x)(y-z) = 1$ So $(x+y+z)(y-x) = (x+y+z)(y-z)$. That means $(y-x) = (y-z)$, so $x = z$. We then have $(2x+y)(y-x) = 1$. Next, we have by substituting x...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "Find $x^{2}+y^{2}+z^{2}$ given\n$$\\begin{cases}\nx^{2}-yz=1 & \\\\\ny^{2}-xz=2 & \\\\\nz^{2}-xy=1\n\\end{cases}$$\n\n\n", "content_html": "Find <img src=\"//latex.artofproblemsolving.com/e/e/f/eefec...
Find \(x^{2}+y^{2}+z^{2}\) given \[ \begin{cases} x^{2}-yz=1,\\[4pt] y^{2}-xz=2,\\[4pt] z^{2}-xy=1. \end{cases} \]
[ 1997, 46766, 44609, 62849, 18761, 33661, 17092, 11615, 23589, 68721, 38265, 71060, 14136, 33294, 67521, 4437, 22240, 21146, 3888, 37090, 18880, 33165, 49195, 46970, 23149, 2338, 3018, 23355, 22986, 42524, 16801, 47769, 5048, 220, 53681, 49055, ...
null
null
aops_1202710
[quote=daisyxixi] Let a, b and c be positive real such that $ab+bc+ca=2$. Prove $abc(a+b+c+9abc)\le 4$. [/quote] Or $abc(a+b+c)\le \frac{(ab+bc+ca)^2}{3} \ \ \Rightarrow \ \ abc(a+b+c)\le \frac{4}{3}$ $3\sqrt[3]{a^2b^2c^2}\le ab+bc+ca \ \ \Rightarrow \ \ 9a^2b^2c^2\le \frac{8}{3}$ $abc(a+b+c+9abc)= abc(a+b+c)+9a...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "Hi all,\n\nHere is another inequality that I failed to prove...\n\nI want to ask if it is true that we have to try the problem by expressing the left side of the inequality as only the variable $abc$?\n\nP...
Let \(a,b,c>0\) satisfy \(ab+bc+ca=2\). Prove \[ abc\bigl(a+b+c+9abc\bigr)\le 4. \]
[ 61700, 10645, 58003, 15291, 55725, 70899, 5131, 31018, 5840, 5879, 30316, 66862, 55421, 4855, 41501, 43366, 58809, 44355, 18172, 63742, 32079, 36787, 25921, 6959, 53454, 24936, 32155, 11490, 44972, 59273, 60199, 65604, 11733, 53808, 33964, 64709,...
null
null
ours_18647
Solution: We use the identities \(\sin^2 x + \cos^2 x = 1\) and \(\cot^2 x + 1 = \csc^2 x\) to simplify the equation. Substituting these identities, the equation becomes: \[ 1 + \csc^2 x = \csc^2 x + \sec^2 x \] This simplifies to: \[ 1 = \sec^2 x \] Thus, \(\cos^2 x = \frac{1}{2}\), which implies \(\cos x = \pm \f...
\frac{\pi}{4}, \frac{3\pi}{4}
{ "competition": "jhmt", "dataset": "Ours", "posts": null, "source": "AlgebraKey2006.md" }
Find all \(x\) in \([0, \pi]\) inclusive so that \[ \sin^2 x + \csc^2 x + \cos^2 x = \cot^2 x + \sec^2 x \]
[ 30693, 60024, 43571, 54190, 27902, 31704, 7010, 52808, 54227, 70658, 10985, 19372, 22200, 26310, 44908, 55667, 56687, 52367, 56500, 54687, 61237, 9457, 30516, 43278, 57967, 67357, 46691, 32151, 57733, 27909, 19754, 19738, 31724, 53220, 41877, 534...
null
null
numina_10089611
## Solution. Note that $x$ must be different from zero for all expressions to make sense. 1 point By moving all addends to the same side, we have $$ \frac{x-m}{x^{2}}-2 \cdot \frac{x-m}{x}+x-m \geqslant 0 $$ 1 point Further simplification yields $$ (x-m)\left(\frac{1}{x^{2}}-\frac{2}{x}+1\right) \geqslant 0 $$ o...
x\in\begin{cases}{1}\cup[,+\infty)&
{ "competition": "Numina-1.5", "dataset": "NuminaMath-1.5", "posts": null, "source": "olympiads" }
## Task A-1.1. Depending on the real parameter $m$, determine for which real numbers $x$ the following inequality holds: $$ \frac{x-m}{x^{2}}+x \geqslant 2\left(1-\frac{m}{x}\right)+m $$
[ 46513, 11894, 54109, 24031, 13189, 59284, 6736, 54888, 60358, 49625, 40910, 22315, 8028, 69172, 27286, 3983, 1878, 43253, 22264, 58045, 69238, 9571, 29937, 32279, 56183, 55215, 24504, 13516, 50066, 50706, 70018, 66877, 31871, 46405, 41378, 35559,...
null
null
aops_281664
[quote="ifai"]Suppose that $ \{a_n\}$ and $ \{b_n\}$ are two arithmetic sequences such that $ \frac {S_n}{T_n} \equal{} \frac {3n \plus{} 2}{4n \minus{} 5},$ where $ S_n \equal{} a_1 \plus{} \cdots \plus{} a_n$ and $ T_n \equal{} b_1 \plus{} \cdots \plus{} b_n$. Find $ \frac {a_{2009}}{b_{2009}}$.[/quote] $ S_{401...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "Suppose that $ \\{a_n\\}$ and $ \\{b_n\\}$ are two arithmetic sequences such that\r\n\r\n$ \\frac{S_n}{T_n}\\equal{}\\frac{3n\\plus{}2}{4n\\minus{}5},$\r\n\r\nwhere $ S_n\\equal{}a_1\\plus{}\\cdots\\plus{}...
Suppose that \( \{a_n\}\) and \( \{b_n\}\) are two arithmetic sequences such that \[ \frac{S_n}{T_n}=\frac{3n+2}{4n-5}, \] where \(S_n=a_1+\cdots+a_n\) and \(T_n=b_1+\cdots+b_n\). Find \(\dfrac{a_{2009}}{b_{2009}}\).
[ 1562, 29600, 20515, 35684, 37753, 40808, 64430, 55904, 64327, 13194, 32014, 7073, 20537, 64589, 43287, 66838, 22610, 47414, 38228, 45047, 37137, 58337, 33682, 11599, 47518, 33938, 11689, 52681, 63066, 30332, 30393, 23733, 17044, 7505, 30696, 5746...
null
null
aops_174069
[quote="ElChapin"]For positive $ x_i$ such that $ \sum_{i \equal{} 1}^{n}{\sqrt {x_i}} \equal{} 1$ Prove that the following holds: $ \sum_{i \equal{} 1}^{n}{x_i^2}\ge(\sum_{i \equal{} 1}^{n}{x_1})^3$ :)[/quote] I think:(Using Holder) $ (\sum_{i \equal{} 1}^{n}{x_i^2})(\sum_{i \equal{} 1}^{n}{\sqrt{x...
null
{ "competition": null, "dataset": "AOPS", "posts": [ { "attachments": [], "content_bbcode": "For positive $ x_i$ such that $ \\sum_{i \\equal{} 1}^{n}{\\sqrt {x_i}} \\equal{} 1$\r\n\r\n\r\nProve that the following holds:\r\n\r\n $ \\sum_{i \\equal{} 1}^{n}{x_i^2}\\ge(\\sum_{i \\equal{} ...
For positive real numbers \(x_i\) such that \(\sum_{i=1}^n \sqrt{x_i}=1\), prove that \[ \sum_{i=1}^n x_i^2 \ge \biggl(\sum_{i=1}^n x_i\biggr)^3. \]
[ 17481, 21887, 52499, 53785, 43798, 60429, 58774, 25017, 67758, 30200, 38050, 59398, 41437, 8381, 64012, 32463, 70296, 21442, 10227, 32054, 36968, 58584, 57707, 44478, 66722, 15685, 43720, 50237, 46801, 38181, 70954, 39349, 2464, 32918, 52392, 362...
null
null
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
32