Search results

  • ...ake. Sometimes, the administrator may ask other people to sign up to write problems for the contest. ...AMC]] competition. There is no guarantee that community members will make Mock AMCs in any given year, but there probably will be one.
    51 KB (6,175 words) - 20:41, 27 November 2024
  • The '''Mock AIME 1 2005-2006''' was written by [[Art of Problem Solving]] community member paladin8. * [[Mock AIME 1 2005-2006/Answer Key|Answer Key]]
    1 KB (135 words) - 16:41, 21 January 2017
  • The '''Mock AIME 1 2006-2007''' was written by [[Art of Problem Solving]] community member Altheman. * [[Mock AIME 1 2006-2007/Problems|Entire Exam]]
    1 KB (155 words) - 15:06, 3 April 2012
  • The '''Mock AIME 2 2006-2007''' was written by [[Art of Problem Solving]] community member 4everwise. * [[Mock AIME 2 2006-2007 Problems|Entire Exam]]
    1 KB (145 words) - 09:55, 4 April 2012
  • ...al{S}</math>, we have that <math>\star (n)=12</math> and <math>0\le n< 10^{7}</math>. If <math>m</math> is the number of elements in <math>\mathcal{S}</ ...564 - 7 - 42 - 42 - 105 = 18368</math> so <math>\star(m) = 1 + 8 + 3 + 6 + 8 = 026</math>.
    1 KB (188 words) - 14:53, 3 April 2012
  • ==Problem== <center><asy>defaultpen(fontsize(8));
    1 KB (244 words) - 13:54, 21 August 2020
  • ==Problem 1== [[Mock AIME 1 2006-2007 Problems/Problem 1|Solution]]
    8 KB (1,355 words) - 13:54, 21 August 2020
  • == Problem == ...2</math>, so we must have <math>x_1 + x_2</math> equal to one of 2, 3 and 8.
    3 KB (470 words) - 23:33, 9 August 2019
  • ==Problem== ...ion again, we have <math>\lambda(100)=20</math>, so <math>N=3^{27}\equiv 3^7\pmod{100}\equiv 87\pmod{100}</math>. Therefore <math>n=87</math>, and so we
    1 KB (127 words) - 23:15, 4 January 2010
  • ==Problem== .../math>, by [[Euler's Totient Theorem]] <math>2^{20 \cdot 100 + 7} \equiv 2^7 \equiv 3 \pmod{125}</math>. Combining, we have <math>2^{2007} \equiv 128 \p
    4 KB (595 words) - 11:14, 25 November 2023
  • ==Problem== ...math>, we see that <math>f(1)=0, f(2)=0, f(3)=0, f(4)=1, f(5)=1, f(6)=2, f(7)=2,
    992 bytes (156 words) - 19:34, 27 September 2019
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. The Mock AIME 5 2006-2007 was written by Art of Problem Solving community member Altheman.
    1 KB (172 words) - 13:37, 3 July 2012
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. The Mock AIME 6 2006-2007 was written by Art of Problem Solving community member paladin8.
    1 KB (172 words) - 13:39, 3 July 2012
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. The Mock AIME 7 2006-2007 was written by Art of Problem Solving community member Altheman.
    1 KB (160 words) - 13:44, 3 July 2012
  • ==Problem 1== [[Mock AIME 6 2006-2007 Problems/Problem 1|Solution]]
    7 KB (1,173 words) - 20:04, 7 December 2018
  • == Problem == <math>13</math> nondistinguishable residents are moving into <math>7</math> distinct houses in Conformistville, with at least one resident per h
    461 bytes (62 words) - 20:18, 8 October 2014