We have your learning goals covered with Spring and Summer courses available. Enroll today!

G
Topic
First Poster
Last Poster
k a March Highlights and 2025 AoPS Online Class Information
jlacosta   0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.

Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!

Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.

Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Sunday, Mar 2 - Jun 22
Friday, Mar 28 - Jul 18
Sunday, Apr 13 - Aug 10
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Tuesday, Mar 25 - Jul 8
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21


Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, Mar 23 - Jul 20
Monday, Apr 7 - Jul 28
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Sunday, Mar 16 - Jun 8
Wednesday, Apr 16 - Jul 2
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Monday, Mar 17 - Jun 9
Thursday, Apr 17 - Jul 3
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Sunday, Mar 2 - Jun 22
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Tuesday, Mar 4 - Aug 12
Sunday, Mar 23 - Sep 21
Wednesday, Apr 23 - Oct 1
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Mar 16 - Sep 14
Tuesday, Mar 25 - Sep 2
Monday, Apr 21 - Oct 13
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

Intermediate Counting & Probability
Sunday, Mar 23 - Aug 3
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Sunday, Mar 16 - Aug 24
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Wednesday, Mar 5 - May 21
Tuesday, Jun 10 - Aug 26

Calculus
Sunday, Mar 30 - Oct 5
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Sunday, Mar 23 - Jun 15
Wednesday, Apr 16 - Jul 2
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Friday, Apr 11 - Jun 27
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Tuesday, Mar 4 - May 20
Monday, Mar 31 - Jun 23
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Monday, Mar 24 - Jun 16
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Sunday, Mar 30 - Jun 22
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Tuesday, Mar 25 - Sep 2
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Mar 2, 2025
0 replies
About old Inequality
perfect_square   0
4 minutes ago
Source: Arqady
This is: $a,b,c>0$ which satisfy $abc=1$
Prove that: $ \frac{a+b+c}{3} \ge \sqrt[10]{\frac{a^3+b^3+c^3}{3}}$
By $  uvw $ method, I can assum $b=c=x,a=\frac{1}{x^2}$
But I can't prove:
$ \frac{2x+\frac{1}{x^2}}{3} \ge \sqrt[10]{ \frac{2x^3+ \frac{1}{x^6}}{3}} $
Is there an another way?
0 replies
perfect_square
4 minutes ago
0 replies
inquality
karasuno   1
N 26 minutes ago by sqing
The real numbers $x,y,z \ge \frac{1}{2}$ are given such that $x^{2}+y^{2}+z^{2}=1$. Prove the inequality $$(\frac{1}{x}+\frac{1}{y}-\frac{1}{z})(\frac{1}{x}-\frac{1}{y}+\frac{1}{z})\ge 2 .$$
1 reply
1 viewing
karasuno
an hour ago
sqing
26 minutes ago
Number Theory
karasuno   0
an hour ago
Solve the equation $$n!+10^{2014}=m^{4}$$in natural numbers m and n.
0 replies
karasuno
an hour ago
0 replies
Minimum number of values in the union of sets
bnumbertheory   5
N an hour ago by Rohit-2006
Source: Simon Marais Mathematics Competition 2023 Paper A Problem 3
For each positive integer $n$, let $f(n)$ denote the smallest possible value of $$|A_1 \cup A_2 \cup \dots \cup A_n|$$where $A_1, A_2, A_3 \dots A_n$ are sets such that $A_i \not\subseteq A_j$ and $|A_i| \neq |A_j|$ whenever $i \neq j$. Determine $f(n)$ for each positive integer $n$.
5 replies
bnumbertheory
Oct 14, 2023
Rohit-2006
an hour ago
No more topics!
A Geometric Inequality?
April   4
N Nov 21, 2016 by TelvCohl
Source: China TST 2007, Problem 5
Let $ x_1, \ldots, x_n$ be $ n>1$ real numbers satisfying $ A=\left |\sum^n_{i=1}x_i\right |\not =0$ and $ B=\max_{1\leq i<j\leq n}|x_j-x_i|\not =0$. Prove that for any $ n$ vectors $ \vec{\alpha_i}$ in the plane, there exists a permutation $ (k_1, \ldots, k_n)$ of the numbers $ (1, \ldots, n)$ such that \[ \left |\sum_{i=1}^nx_{k_i}\vec{\alpha_i}\right | \geq \dfrac{AB}{2A+B}\max_{1\leq i\leq n}|\alpha_i|.\]
4 replies
April
Dec 29, 2008
TelvCohl
Nov 21, 2016
A Geometric Inequality?
G H J
G H BBookmark kLocked kLocked NReply
Source: China TST 2007, Problem 5
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
April
1270 posts
#1 • 2 Y
Y by Adventure10, Mango247
Let $ x_1, \ldots, x_n$ be $ n>1$ real numbers satisfying $ A=\left |\sum^n_{i=1}x_i\right |\not =0$ and $ B=\max_{1\leq i<j\leq n}|x_j-x_i|\not =0$. Prove that for any $ n$ vectors $ \vec{\alpha_i}$ in the plane, there exists a permutation $ (k_1, \ldots, k_n)$ of the numbers $ (1, \ldots, n)$ such that \[ \left |\sum_{i=1}^nx_{k_i}\vec{\alpha_i}\right | \geq \dfrac{AB}{2A+B}\max_{1\leq i\leq n}|\alpha_i|.\]
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathocean97
606 posts
#2 • 2 Y
Y by Adventure10, Mango247
We do a weighting trick. Let $\pi$ denote a permutation $(\pi(1), \pi(2), \dots, \pi(n))$, and let $\sum_{\pi}$ sum over all permutations of $\{1, \dots, n\}.$ Assume that $|\vec{\alpha_1}| \ge 1.$ Then it suffices to show the problem with the RHS replaced with $\frac{AB}{2A+B}.$ Consider the following equation. \[ \left(\sum_\pi |w_\pi| \right) \max_{\pi} \left| \sum_{i = 1}^n x_{\pi(i)} \vec{\alpha_i} \right| \ge \sum_{\pi} |w_{\pi}| \left| \sum_{i = 1}^n x_{\pi(i)} \vec{\alpha_i} \right| \ge \left| \sum_\pi w_\pi \sum_{i = 1}^n x_{\pi(i)} \vec{\alpha_i} \right| = \left| \sum_{i = 1}^n \vec{\alpha_i} \sum_\pi w_\pi x_{\pi(i)} \right| \]for some real weights $w_\pi$ for all permutations $\pi.$

Now choose the weights $w_{\pi}$ such that \[ \sum_\pi w_\pi x_{\pi(i)} = \begin{cases} 1 \textnormal{ if } i = 1 \\ 0 \textnormal{ otherwise} \\ \end{cases}. \]Substituting this in, we have that \[ \max_{\pi} \left| \sum_{i = 1}^n x_{\pi(i)} \vec{\alpha_i} \right| \ge \left(\sum_\pi |w_\pi| \right)^{-1}, \]so our goal is now to minimize $\sum_\pi |w_\pi|$ given the previous system of equations.

My next claim is a duality claim. Let $c_1, \dots, c_n$ be real numbers. Then we know that \[ \sum_{i = 1}^n c_i \sum_\pi w_\pi x_{\pi(i)} = c_1 \implies \sum_\pi |w_\pi| \ge \frac{|c_1|}{\max_\pi \left| \sum_{i = 1}^n c_i x_{\pi(i)}\right|} . \]Essentially, by the duality of linear programming, one can show that equality holds, i.e. \[ \min \sum_\pi |w_\pi| = \max_{\substack{c_1, \dots, c_n \in \mathbb{R} \\ \sum |c_i| > 0}} \frac{|c_1|}{\max_{\pi} \left|\sum_{i = 1}^n c_i x_{\pi(i)}\right|} . \]So we have reduced it to an optimization problem on the right hand side of the equation. The denominator can be one of two things, by using the rearrangement inequality. Assume without loss of generality that $x_1 \le \dots \le x_n$, and $\sum x_i > 0.$ Also assume that $c_1 \le \dots \le c_n$, and instead we show that \[ \max_{\substack{c_1, \dots, c_n \in \mathbb{R} \\ \sum |c_i| > 0}} \frac{ \max_i |c_i|}{\max_{\pi} \left|\sum_{i = 1}^n c_i x_{\pi(i)}\right|} \le \frac{2A+B}{AB}. \]This statement has to be true, because it is the same as the original problem, except with the vectors $\alpha_i$ replaced by real numbers $c_i$! So we have strictly simplified the problem. Now, looking at the denominator, it equals \[ \max\left(\sum c_i x_i, -\sum c_i x_{n+1-i}\right), \]because $x_1 \le \dots \le x_n$ and $c_1 \le \dots \le c_n.$

Lemma 1: If $c_n > 0$ and $c_1 \le 0$, we are done.

This is because \[ \sum c_i x_i-\sum c_i x_{n+1-i} = \sum_{i = 1}^{n/2} (c_{n+1-i} - c_i)(x_{n+1-i}-x_i) \ge (c_n - c_1)B \ge \max_i |c_i| B. \]Therefore, \[ \max\left(\sum c_i x_i, -\sum c_i x_{n+1-i} \right) \ge \frac{B}{2} \max_i |c_i| \ge \frac{AB}{2A+B} \max_i |c_i|, \]as desired.

Lemma 2: If $0 < c_1 \le \dots \le c_n$, we are also done.

It suffices to consider the case where are $c_i$ are positive by symmetry. Also assume WLOG that $c_n = 1$, so $\max_i |c_i| = 1.$ We want to show that \[ \max\left(\sum c_i x_i, -\sum c_i x_{n+1-i} \right) \ge \frac{AB}{2A+B}. \]Consider a real $0 \le d \le 1.$ Consider the sum \[ d\sum c_i x_i - (1-d) \sum c_i x_{n+1-i} = \sum c_i (dx_i - (1-d)x_{n+1-i}). \]I will show that the last expression will be at least $\frac{AB}{2A+B},$ which will finish. Note that the sequence $\{dx_1 - (1-d)x_n, dx_2 - (1-d)x_{n-1}, \dots, dx_n - (1-d)x_1\}$ is an increasing sequence. Since we have no restrictions on $c_1, \dots, c_{n-1}$ other than they are between in the range $[0, 1]$, we can smooth them to all be the same value, since we want to minimize the previous quantity. After we smooth to $c_1 =  \dots = c_{n-1}$, we can then smooth all of them to equal $0$ or $1$, as the expression is linear in those variables. Therefore, \[ \sum c_i (dx_i - (1-d)x_{n+1-i}) \ge \min((2d-1)\sum x_i, dx_n - (1-d)x_1) = \min((2d-1)A, (x_1+x_n)d - x_1). \]ow we make our choice of $d$. A good choice is $2d-1 = \frac{B}{2A+B} \implies d = \frac{A+B}{2A+B}.$ Then clearly $0 \le d \le 1.$ To show that $\min((2d-1)A, (x_1+x_n)d - x_1) \ge \frac{AB}{2A+B}$, it suffices to show that \[ (x_1+x_n)\frac{A+B}{2A+B} - x_1 \ge \frac{AB}{2A+B} \]\[ \frac{A+B}{2A+B}x_n - \frac{A}{2A+B}x_1 \ge \frac{AB}{2A+B} \]\[ (A+B)x_n - Ax_1 \ge AB = A(x_n-x_1) \Leftrightarrow Bx_n \ge 0, \]which is true as we assumed that $\sum x_i > 0 \implies x_n > 0$. So we're done.

Remark: There must be an easier way... I think the beginning manipulation was all fairly roundabout, so I am hoping that there is a more direct solution.
This post has been edited 2 times. Last edited by mathocean97, Jul 9, 2016, 4:18 AM
Reason: Added a remark.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ThE-dArK-lOrD
4071 posts
#3 • 1 Y
Y by Adventure10
mathocean97 wrote:
Essentially, by the duality of linear programming, one can show that equality holds, i.e. \[ \min \sum_\pi |w_\pi| = \max_{c_1, \dots, c_n \in \mathbb{R}} \frac{|c_1|}{\max_{\pi} \left|\sum_{i = 1}^n c_i x_{\pi(i)}\right|} . \]So we have reduced it to an optimization problem on the right hand side of the equation. The denominator can be one of two things, by using the rearrangement inequality. (Finish to come)

Can you show me the last step,plz :maybe: :blush:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rterte
209 posts
#4 • 1 Y
Y by Adventure10
Any other solution for this problem?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
TelvCohl
2311 posts
#5 • 9 Y
Y by atmchallenge, Ankoganit, ThE-dArK-lOrD, anantmudgal09, rterte, muffin_cowee, enhanced, Siddharth03, Adventure10
WLOG assume that $ \left | x_n - x_1 \right| = \max_{1\leq i<j\leq n} \left| x_j-x_i \right| = B, $ $ \left| \vec{\alpha_n} - \vec{\alpha_1} \right| = \max_{1\leq i<j\leq n} \left|  \vec{\alpha_j} -  \vec{\alpha_i} \right| $ and let \begin{align*} 
\vec{\beta} = x_1 \vec{\alpha_1} + x_2 \vec{\alpha_2} + \dots + x_{n-1} \vec{\alpha_{n-1}} + x_n \vec{\alpha_n} \\ 
\vec{\gamma} = x_n \vec{\alpha_1} + x_2 \vec{\alpha_2} + \dots + x_{n-1} \vec{\alpha_{n-1}} + x_1 \vec{\alpha_n} &. 
\end{align*}Then $$ \mathbf{M} =  \max_{\substack{\{ k_1, \dots, k_n \} \\ = \{ 1, 2, \dots, n \}} } \left | \sum_{i=1}^{n}x_{k_i}\vec{\alpha_i} \right | \geq  \frac{1}{2} \left( \left| \vec{\beta} \right| + \left| \vec{\gamma} \right| \right) \geq  \frac{1}{2} \left| \vec{\gamma} - \vec{\beta} \right| = \frac{B}{2}  \left| \vec{\alpha_n} - \vec{\alpha_1} \right|. $$
Let $ \left| \vec{\alpha_k} \right| = \max _{1\leq i\leq n}\left|\vec{\alpha_i} \right| $ ($ k \in \mathbb{N}, 1 \leq k \leq n $) and $ \left| \vec{\alpha_n} - \vec{\alpha_1} \right| = t \left| \vec{\alpha_k} \right| $ ($ t \in \mathbb{R}, 0 \leq t \leq 2 $), then we get
$$  \mathbf{M} \geq \frac{Bt}{2} \left| \vec{\alpha_k} \right| \qquad \qquad \qquad (\dagger). $$
On the other hand, let $ \vec{\varsigma_i} = x_i \vec{\alpha_1} + x_{i+1} \vec{\alpha_2} + \dots + x_n \vec{\alpha_{n-i+1}} + x_1 \vec{\alpha_{n-i+2}}+ \dots + x_{i-1} \vec{\alpha_n}, $ then $$\mathbf{M} \geq \frac{1}{n} \sum_{i=1}^{n} \left| \vec{\varsigma_i} \right| \geq \frac{1}{n} \left| \sum_{i=1}^{n} \vec{\varsigma_i} \right| = \frac{A}{n} \left| n\vec{\alpha_k} - \sum_{j \neq k} \left( \vec{\alpha_k} - \vec{\alpha_j} \right)\right|, $$so $$ \mathbf{M} \geq \frac{A}{n} \left( n \left| \vec{\alpha_k} \right| - \sum_{j \neq k} \left| \vec{\alpha_k} - \vec{\alpha_j} \right| \right) \geq \frac{A}{n} \left( n \left| \vec{\alpha_k} \right| - \left( n-1 \right) \left| \vec{\alpha_n} - \vec{\alpha_1} \right| \right) =  \left( A - \frac{\left(n-1\right) At }{n} \right) \left| \vec{\alpha_k} \right| \qquad (\ddagger). $$Combining $ (\dagger) $ and $ (\ddagger) $ we conclude that $$ \mathbf{M} \geq \max \left\{ \frac{Bt}{2}, \left( A - \frac{\left(n-1\right) At }{n} \right) \right\} \left| \vec{\alpha_k} \right| \geq \left( \frac{\frac{Bt}{2} \cdot \frac{\left(n-1\right)A}{n} + \left( A - \frac{\left(n-1\right) At }{n} \right) \cdot \frac{B}{2}}{\frac{\left(n-1\right)A}{n} + \frac{B}{2}} \right) \left| \vec{\alpha_k} \right|. $$i.e. there exists a permutation $ \left( k_1, \dots, k_n \right ) $ of the numbers $ \left(1, \dots, n \right ) $ such that $$ \left |\sum_{i=1}^{n} x_{k_i}\vec{\alpha_i}\right | \geq \frac{AB}{\frac{2\left(n-1 \right)}{n}A+B} \max_{1\leq i\leq n}\left|\vec{\alpha_i}\right|. $$
This post has been edited 1 time. Last edited by TelvCohl, Nov 21, 2016, 4:44 AM
Z K Y
N Quick Reply
G
H
=
a