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 ...9|breakdown=<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 == ...igits, then tens digits, then units digits. Every one of <math>\{1,2,3,4,5,6,7,8,9\}</math> may appear as the hundreds digit, and there are <math>9 \cdo
    1 KB (194 words) - 12:44, 5 September 2012
  • == Problem == ...t to finding <math>\frac{7^{400 \cdot 5 + 5} - 1}{6} \equiv \frac{7^5 - 1}{6} \equiv \boxed{801} \pmod{1000}</math>.
    685 bytes (81 words) - 09:51, 11 June 2013
  • == Problem == ...th> <tt>C</tt>s amongst the middle five numbers, and so there are <math>6-(5-k) = k+1</math> <tt>C</tt>s amongst the first four numbers.
    1 KB (221 words) - 16:27, 23 February 2013
  • == 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 == [[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
  • .../math> bins. The 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 == ...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 == Triangle <math>ABC</math> has an inradius of <math>5</math> and a circumradius of <math>16</math>. If <math>2\cos{B} = \cos{A} +
    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
  • ==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