Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2023 CMO Problems/Problem 4"

(Created page with "Let non-negative real numbers <math>a_1, a_2, \ldots, a_{2023}</math> satisfy <cmath> a_1+a_2+\cdots+a_{2023}=100 </cmath> Define <math>N</math> as the number of elements in...")
 
Line 41: Line 41:
 
Equality is attained when <math>a_i=0</math> for all <math>i \notin B</math> and <math>a_i=1</math> for all <math>i \in B</math>. This is perfect.
 
Equality is attained when <math>a_i=0</math> for all <math>i \notin B</math> and <math>a_i=1</math> for all <math>i \in B</math>. This is perfect.
 
(Note the equality condition of the subsequent inequality. It is achieved when <math>a_i=0</math> for all <math>i \notin B</math> and <math>a_i=1</math> for all <math>i \in B</math>, satisfying the subsequent inequality conditions.)
 
(Note the equality condition of the subsequent inequality. It is achieved when <math>a_i=0</math> for all <math>i \notin B</math> and <math>a_i=1</math> for all <math>i \in B</math>, satisfying the subsequent inequality conditions.)
 +
 
~zata2|szm
 
~zata2|szm
  

Revision as of 04:16, 25 May 2024

Let non-negative real numbers $a_1, a_2, \ldots, a_{2023}$ satisfy \[a_1+a_2+\cdots+a_{2023}=100\]

Define $N$ as the number of elements in the set \[\left\{(i, j) \mid 1 \leq i \leq j \leq 2023, a_i a_j \geq 1\right\}\]

Prove that $N \leq 5050$ and provide necessary and sufficient conditions for the equality to hold.

Solution 1

Let $S=\{1,2, \ldots, 2023\}, B=\left\{i \in S \mid a_i \geq 13\right\}$, and $C=S \backslash B$. It is easy to see that $|B| \leq 100$. Since $\sum_{i=1}^{2023} a_i>1000$, there is a solution! \[|A| =\sum_{1 \leq i<j \leq 2023} 1\] \[=\sum_{1 \leq i<j \leq 2023} a_i a_j+\sum_{i \in B} 1\] \[=\sum_{1 \leq i<j \leq 2023}^{2023} a_i a_j+|B|\] \[=\left(\sum_{i=1}^{2023} a_i\right)^2-\sum_{i=1}^{2023} a_i^2+|B|\] \[=5000-\sum_{i=1}^{2023} a_i^2+|B|\] \[\sum a_i^2+2 a_i a_j\geq \sum a_i^2 \geq \sum_{i \in B} 1\]

Therefore, \[|A|=5000-|B|+1 \geq 5000+|B|-1\]

Given that $|B| \leq 100$, we have $|A| \leq 5050$.

Equality is attained when $a_i=0$ for all $i \notin B$ and $a_i=1$ for all $i \in B$. This is perfect. (Note the equality condition of the subsequent inequality. It is achieved when $a_i=0$ for all $i \notin B$ and $a_i=1$ for all $i \in B$, satisfying the subsequent inequality conditions.)

~zata2|szm


See Also

2023 CMO(CHINA) (Problems • Resources)
Preceded by
Problem 3 		Followed by
Problem 5
1 • 2 • 3 • 4 • 5 • 6
All CMO(CHINA) Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2023_CMO_Problems/Problem_4&oldid=219680"