Search results
Create the page "Mock AIME 7 2006-2007 Problems/Problem 12" on this wiki! See also the search results found.
- ...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}</ ...box and 1 into each of two others. Thus, this gives us <math>m = 18564 - 7 - 42 - 42 - 105 = 18368</math> so <math>\star(m) = 1 + 8 + 3 + 6 + 8 = 026<1 KB (188 words) - 14:53, 3 April 2012
- ...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== ...), B=expi(pi*5/12), C=(0,0), D=expi(0), E=expi(0)+expi(pi/12), P=expi(pi*5/12)+expi(0);1 KB (244 words) - 13:54, 21 August 2020
- ==Problem== We will solve this problem by constructing a [[recursion]] satisfied by <math>\mathcal{S}_n</math>.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 == ...x_1 + 1</math>. The [[divisor | factors]] of 144 are 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72 and 144 itself. As both <math>x_1</math> and <math3 KB (470 words) - 23:33, 9 August 2019
- == Problem == ...e prime 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 when2 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 <center><cmath>P_A(t) = \begin{vmatrix}t-a_{11} & -a_{12} & \cdots & -a_{1n} \ -a_{21} & t-a_{22} & \cdots & -a_{2n} \ \vdots & \v19 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
- ...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