Art of Problem Solving

1971 IMO Problems/Problem 1: Difference between revisions

Created page with "Prove that the following assertion is true for <math>n=3</math> and <math>n=5</math>, and that it is false for every other natural number <math>n>2:</math> If <math>a_1, a_2,..."
 
mNo edit summary
Line 1: Line 1:
==Problem==
Prove that the following assertion is true for <math>n=3</math> and <math>n=5</math>, and that it is false for every other natural number <math>n>2:</math>
Prove that the following assertion is true for <math>n=3</math> and <math>n=5</math>, and that it is false for every other natural number <math>n>2:</math>


If <math>a_1, a_2,\cdots, a_n</math> are arbitrary real numbers, then <math>(a_1-a_2)(a_1-a_3)\cdots (a_1-a_n)+(a_2-a_1)(a_2-a_3)\cdots (a_2-a_n)+\cdots+(a_n-a_1)(a_n-a_2)\cdots (a_n-a_{n-1})\ge 0.</math>
If <math>a_1, a_2,\cdots, a_n</math> are arbitrary real numbers, then <math>(a_1-a_2)(a_1-a_3)\cdots (a_1-a_n)+(a_2-a_1)(a_2-a_3)\cdots (a_2-a_n)+\cdots+(a_n-a_1)(a_n-a_2)\cdots (a_n-a_{n-1})\ge 0.</math>
----
 
==Solution==
{{solution}}
 
==See Also==
 
{{IMO box|year=1963|num-b=First Question|num-a=2}}

Revision as of 14:01, 17 February 2018

Problem

Prove that the following assertion is true for $n=3$ and $n=5$, and that it is false for every other natural number $n>2:$

If $a_1, a_2,\cdots, a_n$ are arbitrary real numbers, then $(a_1-a_2)(a_1-a_3)\cdots (a_1-a_n)+(a_2-a_1)(a_2-a_3)\cdots (a_2-a_n)+\cdots+(a_n-a_1)(a_n-a_2)\cdots (a_n-a_{n-1})\ge 0.$

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

1963 IMO (Problems) • Resources
Preceded by
Problem First Question
1 2 3 4 5 6 Followed by
Problem 2
All IMO Problems and Solutions