Search results
Create the page "2005 AIME I Problem 15" on this wiki! See also the search results found.
Page title matches
- == Problem == pair A=(0,0),B=(26,0),C=IP(circle(A,10),circle(B,20)),D=(B+C)/2,I=incenter(A,B,C);5 KB (906 words) - 23:15, 6 January 2024
Page text matches
- ...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
- 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
- ...prime integers, find <math> p+q. </math> ([[2005 AIME II Problems/Problem 15|Source]]) ...ly prime positive integers. Find <math>m+n</math>. ([[2001 AIME I Problems/Problem 5|Source]])5 KB (892 words) - 21:52, 1 May 2021
- ...rline{MC}</math> that lies outside of the circle. ([[2020 AMC 12B Problems/Problem 10|Source]]) ...square of a prime, find <math>m+n.</math> ([[2005 AIME I Problems/Problem 15|Source]])5 KB (948 words) - 17:04, 21 February 2025
- ...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
- ...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
- ...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
- ...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
- ...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 ...amous theorems and formulas and see if there's any way you can make a good problem out of them.51 KB (6,175 words) - 21:41, 27 November 2024
- {{AIME Problems|year=2006|n=I}} == Problem 1 ==7 KB (1,173 words) - 03:31, 4 January 2023
- {{AIME Problems|year=2005|n=II}} == Problem 1 ==7 KB (1,119 words) - 21:12, 28 February 2020
- {{AIME Problems|year=2005|n=I}} == Problem 1 ==6 KB (983 words) - 05:06, 20 February 2019
- == 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 th2 KB (249 words) - 09:37, 23 January 2024
- == 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 have8 KB (1,249 words) - 21:25, 20 November 2024
- == 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
- == 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
- == Problem == ...e principle]] all of at least one of the two letters must be all together (i.e., stay in a row).5 KB (897 words) - 00:21, 29 July 2022
- == Problem == ...</math>, the area is <math>K=\frac{1936}{10}</math>, and the answer to the problem is <math>\boxed{936}</math>.3 KB (561 words) - 14:11, 18 February 2018
- == 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),EndArrow12 KB (2,001 words) - 20:26, 23 July 2024
- {{AIME Problems|year=2004|n=II}} == Problem 1 ==9 KB (1,410 words) - 05:05, 20 February 2019
