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 ...down=<u>Problem 1/4</u>: 7<br><u>Problem 2/5</u>: 8<br><u>Problem 3/6</u>: 9}}
    6 KB (874 words) - 22:02, 10 November 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) - 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== ...VC</tt> - the only other combination, two vowels, is impossible due to the problem statement). Then, note that:
    5 KB (795 words) - 15:03, 17 October 2021
  • == Problem == ...d units digits. Thus the sum of the hundreds places is <math>(1+2+3+\cdots+9)(72) \times 100 = 45 \cdot 72 \cdot 100 = 324000</math>.
    1 KB (194 words) - 12:44, 5 September 2012
  • == Problem == ...top of the frustum is a rectangle <math>A'B'C'D'</math> with <math>A'B' = 6</math> and <math>B'C' = 8</math>.
    3 KB (446 words) - 23:18, 9 February 2020
  • == Problem 1 == If <math>g(9) + g(26) + g(126) + g(401) = \frac {m}{n}</math> where <math>m</math> and <
    6 KB (909 words) - 06: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) - 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
  • ==Problems== ...(n+1)}\qquad\textbf{(E)}\ \frac{3}{n(n+1)} </math> ([[1959 AHSME Problems/Problem 37|Source]])
    3 KB (558 words) - 15:37, 21 July 2024