Search results

Page title matches

Page text matches

  • ...A number of '''Mock AMC''' competitions have been hosted on the [[Art of Problem Solving]] message boards. They are generally made by one community member ...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 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
  • 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
  • == Problem 1 == [[Mock AIME 1 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (1,100 words) - 21:35, 9 January 2016
  • ==Problem 1== ...rcles are mutually externally tangent. Two of the circles have radii <math>3</math> and <math>7</math>. If the area of the triangle formed by connecting
    7 KB (1,135 words) - 22:53, 24 March 2019
  • ==Problem== <cmath>\zeta_1^2+\zeta_2^2+\zeta_3^2=3</cmath>
    2 KB (221 words) - 01:49, 19 March 2015
  • ==Problem== Here are some thoughts on the problem:
    3 KB (520 words) - 11:55, 11 January 2019
  • ==Problem== {{Mock AIME box|year=Pre 2005|n=3|num-b=9|num-a=11}}
    2 KB (306 words) - 09:36, 4 April 2012
  • ==Problem== ...equence then repeats itself. We hence find that there are a total of <math>11*15 - 1</math> or <math>\boxed{164}</math> numbers that satisfy the inequali
    714 bytes (105 words) - 22:59, 24 April 2013
  • == Problem == ...divisors of <math>n</math> less than <math>50</math> (e.g. <math>f(12) = 2+3 = 5</math> and <math>f(101) = 0</math>). Evaluate the remainder when <math>
    2 KB (209 words) - 11:43, 10 August 2019
  • == Problem 1 == [[Mock AIME 5 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (909 words) - 06:27, 12 October 2022
  • == Problem == ...\begin{aligned} 101^4 + 256 &= (100 + 1)^4 + 256 \ &= (100^4 + 4\cdot 100^3 + 6 \cdot 100^2 + 4 \cdot 100 + 1) + 256 \ &= 104060401 + 256 = 104060657
    517 bytes (55 words) - 19:01, 23 March 2017
  • ...<math>3</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 1== [[Mock AIME 4 Pre 2005/Problems/Problem 1 | Solution]]
    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
  • == Problem == ...+ 1)(10^3 - 1) = 101 \cdot 9901 \cdot 37 \cdot 11 \cdot 13 \cdot 7 \cdot 3^3 \cdot 37,</cmath> the number <math>10^{12} -1</math> has <math>4 \cdot 2^6
    1 KB (171 words) - 16:38, 4 August 2019
  • == Problem == ...left(1+2x^{3^2}\right)\cdots \left(1+kx^{3^k}\right) \cdots \left(1+1997x^{3^{1997}}\right) = 1+a_1 x^{k_1} + a_2 x^{k_2} + \cdots + a_m x^{k_m}</cmath>
    2 KB (232 words) - 23:22, 31 December 2020