Search results
Create the page "Mock AIME 3 2005-2006/Problem 12" on this wiki! See also the search results found.
Page title matches
- ==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) - 22:59, 24 April 2013
- #REDIRECT [[Mock AIME 3 Pre 2005 Problems/Problem 12]]54 bytes (6 words) - 09:25, 4 April 2012
Page text matches
- ...ed States at the [[International Mathematics Olympiad]] (IMO). While most AIME participants are high school students, some bright middle school students a ...erica Mathematics Olympiad]] (USAMO) for qualification from taking the AMC 12 or United States of America Junior Mathematics Olympiad (USAJMO) for qualif8 KB (1,062 words) - 18:04, 17 January 2025
- ...administered by the [[American Mathematics Competitions]] (AMC). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC and of the recent expansion ...7-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
- ...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 connecting7 KB (1,135 words) - 22: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) - 15:03, 17 October 2021
- ==Problem== {{Mock AIME box|year=Pre 2005|n=3|num-b=10|num-a=12}}2 KB (379 words) - 00: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) - 22:59, 24 April 2013
- ==Problem== <math>\left(\frac{2}{3}\right)^{2005} \cdot \sum_{k=1}^{2005} \frac{k^2}{2^k} \cdot {2005 \choose3 KB (502 words) - 13:53, 19 July 2020
- == 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 == <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) - 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 == Let <math>\omega^3=1</math> with <math>\omega\neq 1</math>. We have2 KB (272 words) - 09:51, 2 July 2015
- == Problem == ...nternally 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>752 bytes (117 words) - 20:16, 8 October 2014
- ==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 == ...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) - 16:38, 4 August 2019