# Inequality from Challenge and Thrill of Pre-college Mathematics [closed]

Let $a_1,a_2,\dots,a_n$ and $b_1,b_2,\dots,b_n$ be two sets of reals such that $b_j>0$ for $1\leq j\leq n$. Let m and M be respectively the minimum and maximum of n fractions $$\frac{a_1}{b_1},\frac{a_2}{b_2},\dots,\frac{a_n}{b_n}$$. Prove that $$m\leq\frac{a_1+a_2+\dots+a_n}{b_1+b_2+\dots+b_n}\leq M$$.

## closed as off-topic by user21820, Thomas Shelby, Gibbs, YiFan, Xander HendersonFeb 11 at 17:36

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – user21820, Thomas Shelby, Gibbs, YiFan, Xander Henderson
If this question can be reworded to fit the rules in the help center, please edit the question.

• I see an edit war. – Myridium Apr 16 '17 at 4:38

For each $1 \le i \le n$, $mb_i \le a_i \le Mb_i$ since $b_i > 0$. Therefore, $$m(b_1+\dots+b_n) \le a_1+\dots+a_n \le M(b_1+\dots+b_n).$$ Now divide by $\sum b_i$.
• $a_i$ can be negative!! – Dayal Kumar Apr 16 '17 at 4:38