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== ...= s_{n+2} + s_{n+1} + s_n</math>. It follows that <math>s_4 = 7 + 3 + 1 = 11, s_5 = 21, s_6 = 39, s_7 = \boxed{071}</math>.
    2 KB (221 words) - 01:49, 19 March 2015
  • == Problem 1 == [[Mock AIME 5 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (909 words) - 06:27, 12 October 2022
  • == Problem == ...060657, \end{aligned}</math> and so the sum of the digits is <math>1+4+6+6+5+7 = \boxed{29}.</math>
    517 bytes (55 words) - 19:01, 23 March 2017
  • It is used to solve problems of the form: how many ways can one distribute <math>k</math> indistinguisha ...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 == ...h> such that <math>\angle{AB'C'} \cong \angle{B'EA}</math>. If <math>AB' = 5</math> and <math>BE = 23</math>, then the area of <math>ABCD</math> can be
    2 KB (376 words) - 21:41, 26 December 2016
  • ==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