Search results

  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2007 Indonesia MO Problems]]
    793 bytes (93 words) - 12:49, 14 July 2018
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2008 Indonesia MO Problems]]
    791 bytes (91 words) - 12:51, 14 July 2018
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2009 Indonesia MO Problems]]
    793 bytes (94 words) - 12:52, 14 July 2018
  • ===Problem 1=== Find all positive integers <math> n\in\{1,2,3,\ldots,2009\}</math> such that
    3 KB (565 words) - 23:33, 26 August 2018
  • ==Problem== ...x^{2008} - 2x^{2007} + 3x^{2006} - 4x^{2005} + 5x^{2004} - \cdots - 2006x^3 + 2007x^2 - 2008x + 2009</cmath>
    1 KB (176 words) - 12:40, 31 August 2018
  • ===Problem 1=== [[2007 Indonesia MO Problems/Problem 1|Solution]]
    4 KB (619 words) - 17:18, 12 February 2020
  • ===Problem 1=== [[2008 Indonesia MO Problems/Problem 1|Solution]]
    3 KB (478 words) - 14:09, 23 June 2021
  • ==Problem== In this problem, it turns into <math>f(x)+f(y)\geq \frac{2}{(1+\sqrt\frac{x+y}{2})^2}</math
    3 KB (473 words) - 00:09, 4 December 2021
  • ==Problem== ===Solution 3 (credit to dskull16)===
    3 KB (556 words) - 19:47, 3 February 2024
  • Proudest of: [[2019 AIME II Problems/Problem 15]] Solution 5 [[2023 USAJMO Problems/Problem 6]] Solution 1
    10 KB (1,118 words) - 05:33, 13 January 2024