olymmath

CMO 1998 Problem 2

  • Day 1

Given a positive integer n>1n>1 , determine with proof if there exist 2n2n pairwise different positive integers a1,…,an,b1,…bna_1,\ldots ,a_n,b_1,\ldots b_n such that a1+…+an=b1+…+bna_1+\ldots +a_n=b_1+\ldots +b_n and n−1>∑i=1nai−biai+bi>n−1−11998.n-1>\sum_{i=1}^{n}\frac{a_i-b_i}{a_i+b_i}>n-1-\frac{1}{1998}.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator cn-mo/1998/p2 · Tag 6XBC9ZWC0Z · Edit this page on GitHub · Keys: j next, k previous