Search results
Create the page "Mock AIME 2 2005-2006/Problem 12" on this wiki! See also the search results found.
- ...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) - 21: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) - 10: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) - 16: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) - 17:41, 21 January 2017
- == Problem 1 == [[Mock AIME 1 Pre 2005 Problems/Problem 1|Solution]]6 KB (1,100 words) - 22:35, 9 January 2016
- ==Problem 1== [[Mock AIME 3 Pre 2005/Problem 1|Solution]]7 KB (1,135 words) - 23:53, 24 March 2019
- ==Problem== ...VC</tt> - the only other combination, two vowels, is impossible due to the problem statement). Then, note that:5 KB (795 words) - 16:03, 17 October 2021
- ==Problem== ...second equation and rearranging variables gives <math>45x=8\cdot 15+bx=15^2\implies x=5</math>. Back-substitution yields <math>AC=21</math> and consequ2 KB (379 words) - 01:27, 6 December 2024
- ==Problem== ...tegers <math>n</math> such that <math>1 \le n \le 1000</math> and <math>n^{12} - 1</math> is divisible by <math>73</math>.714 bytes (105 words) - 23:59, 24 April 2013
- ==Problem== <math>\left(\frac{2}{3}\right)^{2005} \cdot \sum_{k=1}^{2005} \frac{k^2}{2^k} \cdot {2005 \choose k}</math>3 KB (502 words) - 14:53, 19 July 2020
- == Problem == ...th> and <math>f(101) = 0</math>). Evaluate the remainder when <math>f(1)+f(2)+\cdots+f(99)</math> is divided by <math>1000</math>.2 KB (209 words) - 12:43, 10 August 2019
- == Problem == <math>ABCD</math>, a [[rectangle]] with <math>AB = 12</math> and <math>BC = 16</math>, is the base of [[pyramid]] <math>P</math>,3 KB (446 words) - 00:18, 10 February 2020
- == Problem 1 == [[Mock AIME 5 Pre 2005 Problems/Problem 1|Solution]]6 KB (909 words) - 07:27, 12 October 2022
- == Problem == ...+f(\omega)+f(\omega^2)}{3} &= \frac{(1-1)^{2004}+(\omega-1)^{2004}+(\omega^2-1)^{2004}}{3} \2 KB (272 words) - 10:51, 2 July 2015
- == Problem == ...y tangent to a larger circle <math>\omega_2</math> of radius <math>12\sqrt{2}</math> such that the center of <math>\omega_2</math> lies on <math>\omega_752 bytes (117 words) - 21:16, 8 October 2014
- == Problem == <math>Or,\frac{AD.BC}{2}=84</math>2 KB (294 words) - 16:24, 24 August 2022
- ==Problem 1== [[Mock AIME 4 Pre 2005/Problems/Problem 1 | Solution]]7 KB (1,094 words) - 15:39, 24 March 2019
- == Problem 1 == [[Mock AIME 2 Pre 2005 Problems/Problem 1|Solution]]6 KB (1,052 words) - 13:52, 9 June 2020
- == Problem == ...ts</math>, an infinite decimal that has the property that <math>d_i = d_{i+12}</math> for all positive integers <math>i</math>. Given that <math>9901</ma1 KB (171 words) - 17:38, 4 August 2019