MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

Maximum Disjoint Pairs Distinct Sums

2175ExpertCombinatoricsNumber Theory

AIME II · 2009 · Problem 12

From the set of integers $\{1,2,3,\dots,2009\}$, choose $k$ pairs $\{a_i,b_i\}$ with $a_i<b_i$ so that no two pairs have a common element. Suppose that all the sums $a_i+b_i$ are distinct and less than or equal to $2009$. Find the maximum possible value of $k$.
0 students attempted0% solvedRating 2175

Related practice paths

AIME PracticeInteger-answer practice for deeper multi-step problems.How to Qualify for AIMEScore goals, contest choice, and prep habits for AIME hopefuls.AIME Practice StrategyHow to improve accuracy on high-difficulty problems.

Ready to check your answer?

Create an account to submit answers, save history, and track your rating.

Progressive Hints5

Unlock hints one at a time — each reveals a little more without spoiling the solution.

Step-by-Step Solutions1

Multiple solution approaches with detailed walkthroughs, unlocked after you solve the problem.

AI-Powered Grading

Instant feedback on your answer — handles fractions, decimals, and equivalent forms.

Curated problem bank

Supported tracks for AMC, AIME, MATHCOUNTS, and olympiad-style training, plus global problem sources like UKMT, Euclid, and Kangaroo.