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

Page title matches

• 2005 AIME I Problems/Problem 15
  == Problem == </asy></center><!-- Asymptote replacement for Image:2005_I_AIME-15.png by azjps -->
  5 KB (906 words) - 23:15, 6 January 2024
• 2005 AIME II Problems/Problem 15
  == Problem == D((0,30)--(0,-10),Arrows(4));D((15,0)--(-25,0),Arrows(4));D((0,0)--MP("y=ax",(14,14 * (69/100)^.5),E),EndArrow
  12 KB (2,001 words) - 20:26, 23 July 2024
• Mock AIME 3 Pre 2005 Problems/Problem 15
  ==Problem== {{Mock AIME box|year=Pre 2005|n=3|num-b=14|after=Last Question}}
  2 KB (312 words) - 10:38, 4 April 2012
• Mock AIME 1 Pre 2005 Problems/Problem 15
  == Problem == {{Mock AIME box|year=Pre 2005|n=1|num-b=14|num-a=15|source=14769}}
  2 KB (340 words) - 01:44, 3 March 2020
• Mock AIME 5 2005-2006 Problems/Problem 15
  == Problem == ...labeled <math>a_0</math>, <math>a_1</math>, <math>\ldots</math>, <math>a_{2005}</math> around the circle in order. Two beads <math>a_i</math> and <math>a_
  955 bytes (157 words) - 21:20, 8 October 2014
• Mock AIME 5 Pre 2005 Problems/Problem 15
  280 bytes (34 words) - 00:11, 15 February 2024

Page text matches

• Principle of Inclusion-Exclusion
  ...d only once. In particular, memorizing a formula for PIE is a bad idea for problem solving. ==== Problem ====
  9 KB (1,703 words) - 01:20, 7 December 2024
• Brahmagupta's Formula
  == Problems == ...e integers. Determine <math>p + q</math>. ([[Mock AIME 3 Pre 2005 Problems/Problem 7|Source]])
  3 KB (543 words) - 19:35, 29 October 2024
• Constructive counting
  This is a problem where constructive counting is not the simplest way to proceed. This next e ...proceed with the construction. If we were to go like before and break the problem down by each box, we'd get a fairly messy solution.
  13 KB (2,018 words) - 15:31, 10 January 2025
• Ellipse
  ==Problems== ...prime integers, find <math> p+q. </math> ([[2005 AIME II Problems/Problem 15|Source]])
  5 KB (892 words) - 21:52, 1 May 2021
• Power of a Point Theorem
  == Problems == ...rline{MC}</math> that lies outside of the circle. ([[2020 AMC 12B Problems/Problem 10|Source]])
  5 KB (948 words) - 17:04, 21 February 2025
• 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
• 2006 AIME I Problems
  {{AIME Problems|year=2006|n=I}} == Problem 1 ==
  7 KB (1,173 words) - 03:31, 4 January 2023
• 2005 AIME II Problems/Problem 4
  == Problem == ...[[positive integer]]s that are divisors of at least one of <math> 10^{10},15^7,18^{11}. </math>
  3 KB (377 words) - 18:36, 1 January 2024
• 2005 AIME II Problems
  {{AIME Problems|year=2005|n=II}} == Problem 1 ==
  7 KB (1,119 words) - 21:12, 28 February 2020
• 2005 AIME II Problems/Problem 7
  == Problem == <cmath>(y^{14}+y^{12}+y^{10}+y^8+y^6+y^4+y^2+1)(y+1) = (y^{15}+y^{14}+y^{13}+y^{12}+y^{11}+y^{10}+y^9+y^8+y^7+y^6+y^5+y^4+y^3+y^2+y+1)=\f
  2 KB (279 words) - 12:33, 27 October 2019
• 2005 AIME II Problems/Problem 10
  == Problem == import three; currentprojection = perspective(4,-15,4); defaultpen(linewidth(0.7));
  3 KB (436 words) - 20:35, 13 August 2024
• 2005 AIME I Problems
  {{AIME Problems|year=2005|n=I}} == Problem 1 ==
  6 KB (983 words) - 05:06, 20 February 2019
• 2005 AIME I Problems/Problem 3
  == Problem == ...9, 23, 29, 31, 37, 41, 43</math> and <math>47</math>) so there are <math> {15 \choose 2} =105</math> ways to choose a pair of primes from the list and th
  2 KB (249 words) - 09:37, 23 January 2024
• 2005 AIME I Problems/Problem 4
  == Problem == ...th>. When <math>n = 28</math>, this product is <math>980</math>, and since AIME answers are nonnegative integers less than <math>1000</math>, we don't have
  8 KB (1,249 words) - 21:25, 20 November 2024
• 2005 AIME I Problems/Problem 10
  == Problem == pair A=(15,32), B=(12,19), C=(23,20), M=B/2+C/2, P=(17,22);
  5 KB (852 words) - 21:23, 4 October 2023
• 2005 AIME I Problems/Problem 12
  == Problem == ...let <math> b </math> denote the number of positive integers <math> n \leq 2005 </math> with <math> S(n) </math> [[even integer | even]]. Find <math> |a-b|
  4 KB (647 words) - 02:29, 4 May 2021

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