Search results
Create the page "Mock AIME 5 2006-2007 Problems/Problem 11" on this wiki! See also the search results found.
Page title matches
- == Problem == ...xist an <math>A</math> such that <math>|A| = 620</math> and <math>\mu(A) = 11</math>? (<math>|X|</math> denotes the cardinality of the set <math>X</math>786 bytes (131 words) - 20:19, 8 October 2014
Page text matches
- ...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
- ...th> place 10 into one box and 2 into a second. <math>7 \cdot \frac{6\cdot 5}{2} = 105</math> place 10 into one box and 1 into each of two others. Thus *[[Mock AIME 1 2006-2007 Problems/Problem 1 | Previous Problem]]1 KB (188 words) - 14:53, 3 April 2012
- ==Problem== ...h>, and let <math>S</math> denote the [[infinite]] sum <math>S = a_{10}+a_{11}+a_{12}+...</math>. If the sum of all possible [[distinct]] values of <math5 KB (744 words) - 18:46, 20 October 2020
- ==Problem== ...and <math>CA</math> have lengths <math>3</math>, <math>4</math>, and <math>5</math>, respectively. Let the incircle, circle <math>I</math>, of <math>\tr1 KB (236 words) - 22:58, 24 April 2013
- ==Problem 1== [[Mock AIME 1 2006-2007 Problems/Problem 1|Solution]]8 KB (1,355 words) - 13:54, 21 August 2020
- ==Problem== ...es for <math>x</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 == ...sors 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>f(1)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 <center><cmath>P_A(t) = \begin{vmatrix}t-a_{11} & -a_{12} & \cdots & -a_{1n} \ -a_{21} & t-a_{22} & \cdots & -a_{2n} \ \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
- ...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
- == Problem == {{Mock AIME box|year=2005-2006|n=5|source=76847|num-b=9|num-a=11}}328 bytes (45 words) - 13:15, 11 April 2018
- == Problem == ...xist an <math>A</math> such that <math>|A| = 620</math> and <math>\mu(A) = 11</math>? (<math>|X|</math> denotes the cardinality of the set <math>X</math>786 bytes (131 words) - 20:19, 8 October 2014
- == Problem == By pythagoras theorem on <math>\triangle ABD</math> , We get <math>BD=5=CE</math>2 KB (294 words) - 15:24, 24 August 2022