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

2010 USAMO Problems/Problem 3

Revision as of 23:17, 4 May 2010 by Aopsvd (talk | contribs) (Created page with '==Problem== The <math>2010</math> positive numbers <math>a_1, a_2, \ldots , a_{2010}</math> satisfy the inequality <math>a_ia_j \le i+j</math> for all distinct indices <math>i, j…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

The $2010$ positive numbers $a_1, a_2, \ldots , a_{2010}$ satisfy the inequality $a_ia_j \le i+j$ for all distinct indices $i, j$. Determine, with proof, the largest possible value of the product $a_1a_2\cdots a_{2010}$.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2010_USAMO_Problems/Problem_3&oldid=34443"