Search results

  • ...ed States at the [[International Mathematics Olympiad]] (IMO). While most AIME participants are high school students, some bright middle school students a High scoring AIME students are invited to take the prestigious [[United States of America Mat
    8 KB (1,062 words) - 18:04, 17 January 2025
  • ...ake. Sometimes, the administrator may ask other people to sign up to write problems for the contest. ...AMC]] competition. There is no guarantee that community members will make Mock AMCs in any given year, but there probably will be one.
    51 KB (6,175 words) - 20:41, 27 November 2024
  • A '''Mock AIME''' is a contest that is intended to mimic the [[AIME]] competition. (In more recent years, recurring competitions will be listed ...xOGY2Y2QwOTc3NWZiYjY0LnBkZg==&rn=TWlsZG9yZiBNb2NrIEFJTUUucGRm Mildorf Mock AIME 1]
    8 KB (901 words) - 19:45, 13 January 2025
  • The '''Mock AIME I 2011''' was created by AoPS users andersonw, [[User:Brut3Forc3|Brut3Forc3]], dys * [[Mock AIME I 2011 Problems | Problems]]
    1 KB (134 words) - 18:49, 28 January 2023
  • Let <math>P(x) = x^{2013}+4x^{2012}+9x^{2011}+16x^{2010}+\cdots + 4052169x + 4056196 = \sum_{j=1}^{2014}j^2x^{2014-j}.</ *[[2013 Mock AIME I Problems]]
    995 bytes (134 words) - 10:51, 4 August 2024
  • ...th>(x,x)</math> where <math>x\in{1,2,3,4,5}</math> must exist.In this case I rather "go backwards". First fixing <math>5</math> pairs <math>(x,x)</math> This exact problem showed up earlier on the 2011 Stanford Math Tournament, Advanced Topics Test.
    11 KB (1,796 words) - 13:39, 5 November 2022
  • [[2013 Mock AIME I Problems/Problem 1|Solution]] [[2013 Mock AIME I Problems/Problem 2|Solution]]
    7 KB (1,159 words) - 08:15, 30 July 2024