Create the page "AIME Problems/Problem 11" on this wiki! See also the search results found.

Page title matches

• 2006 AIME I Problems/Problem 11
  == Problem == ...ing.com/wiki/index.php?title=2015_AIME_II_Problems/Problem_10 2015 AIME II Problem 10]
  3 KB (436 words) - 05:40, 4 November 2022
• 2005 AIME II Problems/Problem 11
  == Problem == ...</math>, <math>a_{m-1}a_{m-2} = 3</math>; from the recursion given in the problem <math>a_{m-p+1} = a_{m-p-1} - 3/a_{m-p}</math>, so <math>a_{m-p+1} = 3p/a_{
  3 KB (499 words) - 18:52, 21 November 2022
• 2005 AIME I Problems/Problem 11
  == Problem == [[Image:2005 AIME I Problem 11.png]]
  4 KB (707 words) - 11:11, 16 September 2021
• 2004 AIME I Problems/Problem 11
  == Problem == {{AIME box|year=2004|n=I|num-b=10|num-a=12}}
  5 KB (839 words) - 22:12, 16 December 2015
• 2004 AIME II Problems/Problem 11
  == Problem == {{AIME box|year=2004|n=II|num-b=10|num-a=12}}
  2 KB (268 words) - 22:20, 23 March 2023
• 1983 AIME Problems/Problem 11
  == Problem == {{AIME box|year=1983|num-b=10|num-a=12}}
  6 KB (971 words) - 15:35, 27 May 2024
• 1984 AIME Problems/Problem 11
  == Problem == ...cent pair of Birch trees as one separate tree. This then gives <math>\frac{11!}{3! \cdot 3! \cdot 4!}</math> configurations.
  7 KB (1,115 words) - 00:52, 7 September 2023
• 1985 AIME Problems/Problem 11
  == Problem == ...= Y</math>). Finding the optimal location for <math>X</math> is a classic problem: for any path from <math>F_1</math> to <math>X</math> and then back to <mat
  6 KB (1,001 words) - 16:14, 14 March 2025
• 1986 AIME Problems/Problem 11
  == Problem == Let <math>\vec{v} \in V</math> be the polynomial given in the problem, and it is easy to see that <math>[ \vec{v} ]_B = \langle 1, -1, 1, -1, ...
  6 KB (872 words) - 16:51, 9 June 2023
• 1987 AIME Problems/Problem 11
  == Problem == Find the largest possible value of <math>k</math> for which <math>3^{11}</math> is expressible as the sum of <math>k</math> consecutive [[positive
  3 KB (418 words) - 01:59, 10 March 2025
• 1988 AIME Problems/Problem 11
  == Problem == {{AIME box|year=1988|num-b=10|num-a=12}}
  2 KB (422 words) - 00:22, 6 September 2020
• 1989 AIME Problems/Problem 11
  == Problem == {{AIME box|year=1989|num-b=10|num-a=12}}
  5 KB (851 words) - 18:01, 28 December 2022
• 1990 AIME Problems/Problem 11
  == Problem == {{AIME box|year=1990|num-b=10|num-a=12}}
  3 KB (519 words) - 09:28, 28 June 2022
• 1991 AIME Problems/Problem 11
  == Problem == In the present problem, <math>n_{}^{}=12</math> and <math>R_{}^{}=1</math>. It follows that <math>
  4 KB (740 words) - 17:46, 24 May 2024
• 1992 AIME Problems/Problem 11
  == Problem == {{AIME box|year=1992|num-b=10|num-a=12}}
  2 KB (404 words) - 19:24, 4 July 2013
• 1993 AIME Problems/Problem 11
  == Problem == In order to begin this problem, we need to calculate the probability that Alfred will win on the first rou
  7 KB (1,058 words) - 20:57, 22 December 2020
• 1994 AIME Problems/Problem 11
  == Problem == {{AIME box|year=1994|num-b=10|num-a=12}}
  4 KB (645 words) - 00:45, 16 November 2024
• 1995 AIME Problems/Problem 11
  == Problem == {{AIME box|year=1995|num-b=10|num-a=12}}
  2 KB (292 words) - 19:30, 4 July 2013
• 1996 AIME Problems/Problem 11
  == Problem == ...-x^6-x^3-x^2+2=x^5-x^3-x^2+1</math>, and simplifying, we see that <math>x^{11}-x^6-x^5+1=0</math>, so by SFFT, <math>(x^6-1)(x^5-1)=0</math>. Then, the r
  6 KB (1,064 words) - 23:24, 28 September 2024
• 1997 AIME Problems/Problem 11
  == Problem == {{AIME box|year=1997|num-b=10|num-a=12}}
  13 KB (1,890 words) - 22:33, 27 November 2024

Page text matches

• Pythagorean Theorem
  ...e many tools in a good geometer's arsenal. A very large number of geometry problems can be solved by building right triangles and applying the Pythagorean Theo <cmath>11-60-61</cmath>
  6 KB (978 words) - 12:02, 6 March 2025
• AMC 12
  ...ke the more challenging [[American Invitational Mathematics Examination]] (AIME). ...administered by the [[American Mathematics Competitions]] (AMC). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC.
  5 KB (646 words) - 04:52, 3 February 2025
• Joining an ARML team
  * Performance on problems at practice sessions. * Performance on AMC and AIME, including current and previous years.
  22 KB (3,532 words) - 11:25, 27 September 2024
• Factorial
  * <math>11! = 39916800</math> ==Problems==
  10 KB (809 words) - 16:40, 17 March 2024
• 2006 AIME II
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AIME II Problems]]
  1 KB (133 words) - 12:32, 22 March 2011
• Fermat's Little Theorem
  In contest problems, Fermat's Little Theorem is often used in conjunction with the [[Chinese Re == Problems ==
  15 KB (2,618 words) - 12:03, 19 February 2025
• Parabola
  draw(graph(f,1-sqrt(11),1+sqrt(11)),green+linewidth(1)); ==Problems==
  3 KB (551 words) - 16:22, 13 September 2023
• Ptolemy's theorem
  ...uality]]. Ptolemy's theorem frequently shows up as an intermediate step in problems involving inscribed figures. == Problems ==
  6 KB (922 words) - 17:34, 13 January 2025
• Casework
  ..., then adding together the totals of each part. Casework is a very general problem-solving approach, and as such has wide applicability. ...emonstrate casework in action. Unlike the selections in this article, most problems cannot be completely solved through casework. However, it is crucial as an
  5 KB (709 words) - 17:40, 24 September 2024
• Euclidean algorithm
  <math>3 = -11 \cdot 42 + 5 \cdot 93. \qquad (5)</math> <br> <math>3 = (14k + 5) \cdot 93 + (-31k - 11) \cdot 42</math>
  6 KB (923 words) - 17:39, 30 September 2024
• Complementary counting
  ...ng may lead to a quick solution is the phrase "not" or "at least" within a problem statement. ''[[2006 AMC 10A Problems/Problem 21 | 2006 AMC 10A Problem 21]]: How many four-digit positive integers have at least one digit that is
  8 KB (1,192 words) - 17:20, 16 June 2023
• Prime factorization
  * Note that <math>11</math> is not a factor of <math>151</math>, so we can move on. In fact, be ==Problems==
  3 KB (496 words) - 22:14, 5 January 2024
• Ellipse
  ==Problems== ...latively prime integers, find <math> p+q. </math> ([[2005 AIME II Problems/Problem 15|Source]])
  5 KB (892 words) - 21:52, 1 May 2021
• Complex number
  == Problems == *[[2007 AMC 12A Problems/Problem 18]]
  5 KB (860 words) - 15:36, 10 December 2023
• 2004 AIME I
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AIME I Problems]]
  1 KB (135 words) - 18:15, 19 April 2021
• 2004 AIME II
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AIME II Problems]]
  1 KB (135 words) - 12:24, 22 March 2011
• 2005 AIME I
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2005 AIME I Problems]]
  1 KB (154 words) - 12:30, 22 March 2011
• 2006 AIME I
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AIME I Problems]]
  1 KB (135 words) - 12:31, 22 March 2011
• 2005 AIME II
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2005 AIME II Problems]]
  1 KB (135 words) - 12:30, 22 March 2011
• Mock AMC
  ...ake. Sometimes, the administrator may ask other people to sign up to write problems for the contest. * Look at past [[AMC]]/[[AHSME]] tests to get a feel for what kind of problems you should write and what difficulty level they should be.
  51 KB (6,175 words) - 21:41, 27 November 2024

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