Search results

  • ...administered by the [[American Mathematics Competitions]] (AMC). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC and of the recent expansion ...ficulty=7-9|breakdown=<u>Problem 1/4</u>: 7<br><u>Problem 2/5</u>: 8<br><u>Problem 3/6</u>: 9}}
    6 KB (869 words) - 12:52, 20 February 2024
  • The '''Mock AIME 2 Pre 2005''' was written by [[Art of Problem Solving]] community member Mildorf. * [[Mock AIME 2 Pre 2005 Problems|Entire Exam]]
    2 KB (181 words) - 10:58, 18 March 2015
  • The '''Mock AIME 7 Pre 2005''' was written by [[Art of Problem Solving]] community member Mildorf. * [[Mock AIME 7 Pre 2005 Problems|Entire Exam]]
    1 KB (146 words) - 16:33, 14 October 2022
  • == Problem 1 == [[Mock AIME 1 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (1,100 words) - 22:35, 9 January 2016
  • ==Problem 1== [[Mock AIME 3 Pre 2005/Problem 1|Solution]]
    7 KB (1,135 words) - 23:53, 24 March 2019
  • ==Problem== ...VC</tt> - the only other combination, two vowels, is impossible due to the problem statement). Then, note that:
    5 KB (795 words) - 16:03, 17 October 2021
  • == Problem 1 == [[Mock AIME 5 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (909 words) - 07:27, 12 October 2022
  • ==Problem 1== For how many integers <math>n>1</math> is it possible to express <math>2005</math> as the sum of <math>n</math> distinct positive integers?
    7 KB (1,094 words) - 15:39, 24 March 2019
  • == Problem 1 == [[Mock AIME 2 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (1,052 words) - 13:52, 9 June 2020
  • == Problem == ...ts</math>, an infinite decimal that has the property that <math>d_i = d_{i+12}</math> for all positive integers <math>i</math>. Given that <math>9901</ma
    1 KB (171 words) - 17:38, 4 August 2019