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}</ ...h>m = 18564 - 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
  • ...ABC</math> have <math>BC=\sqrt{7}</math>, <math>CA=1</math>, and <math>AB=3</math>. If <math>\angle A=\frac{\pi}{n}</math> where <math>n</math> is an i ...o <math>3^{2000}\equiv 1 \pmod{1000}</math> and so <math>3^{2007} \equiv 3^7 \equiv 2187 \equiv 187 \pmod{1000}</math>
    963 bytes (135 words) - 14:53, 3 April 2012
  • ...> and <math>a = (a + b) - b = 12</math>, so our three vertices are <math>(-7, 49), (-2, 4)</math> and <math>(12, 144)</math>. *[[Mock AIME 1 2006-2007 Problems/Problem 3 | Previous Problem]]
    1 KB (244 words) - 14:21, 5 November 2012
  • ==Problem== ...h by <math>-a^3</math> and let <math>\frac b a = q</math> to get <math>25q^3 +101q^2 - 1125q - 25 = 0</math>. Since we're searching for a rational root
    3 KB (460 words) - 14:52, 3 April 2012
  • ==Problem== ..., <math>AB</math>, <math>BC</math>, and <math>CA</math> have lengths <math>3</math>, <math>4</math>, and <math>5</math>, respectively. Let the incircle,
    1 KB (236 words) - 22:58, 24 April 2013
  • ==Problem== ...] of strings with only 0's or 1's with length <math>n</math> such that any 3 adjacent place numbers sum to at least 1. For example, <math>00100</math> w
    2 KB (424 words) - 14:51, 3 April 2012
  • ==Problem== ...7</math>, <math>d_{5}=13</math>, and <math>d_{6}=-16</math>, find <math>d_{7}</math>.
    3 KB (568 words) - 14:50, 3 April 2012
  • ==Problem 1== [[Mock AIME 1 2006-2007 Problems/Problem 1|Solution]]
    8 KB (1,355 words) - 13:54, 21 August 2020
  • == Problem == .../math> and <math>x_{n+3} = x_{n+2}(x_{n+1}+x_n)</math> for <math>n = 1, 2, 3, 4</math>. Find the last three [[digit]]s of <math>x_7</math>.
    3 KB (470 words) - 23:33, 9 August 2019
  • ==Problem== Find the remainder when <math>3^{3^{3^3}}</math> is divided by 1000.
    1 KB (127 words) - 23:15, 4 January 2010
  • ==Problem== ...e the [[remainder]] when <center><p><math>{2007 \choose 0} + {2007 \choose 3} + \cdots + {2007 \choose 2007}</math></p></center> is divided by 1000.
    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
  • == 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
  • In the context of problem-solving, the characteristic polynomial is often used to find closed forms f ...can be solved for each constant. Refer to the [[#Introductory|introductory problems]] below to see an example of how to do this. In particular, for the Fibonac
    19 KB (3,412 words) - 13:57, 21 September 2022
  • ...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

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)