Search results

  • 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) - 09: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) - 15:33, 14 October 2022
  • == Problem 1 == [[Mock AIME 1 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (1,100 words) - 21:35, 9 January 2016
  • == Problem == Let <math>N</math> denote the number of permutations of the <math>15</math>-character string <math>AAAABBBBBCCCCCC</math> such that
    1 KB (221 words) - 16:27, 23 February 2013
  • == Problem 1 == [[Mock AIME 5 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (909 words) - 06:27, 12 October 2022
  • ...e number of ways to do such is <math>{4+3-1 \choose 3-1} = {6 \choose 2} = 15</math>. ...ach urn, then there would be <math>{n \choose k}</math> possibilities; the problem is that you can repeat urns, so this does not work.<math>n</math> and then
    5 KB (795 words) - 16:39, 31 December 2024
  • == Problem == ...}</math>. Since <math>\sin B = \frac{b}{2R}</math>, we have that <math>b = 6\sqrt{23}</math>. By the Law of Cosines, we have that:
    2 KB (340 words) - 00:44, 3 March 2020
  • ==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) - 14:39, 24 March 2019
  • == Problem 1 == [[Mock AIME 2 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (1,052 words) - 12:52, 9 June 2020