Search results
Create the page "2005 AIME I Problem 7" on this wiki! See also the search results found.
Page title matches
- == Problem == label("$C$",(16.87,7),E);4 KB (567 words) - 20:20, 3 March 2020
Page text matches
- This is a problem where constructive counting is not the simplest way to proceed. This next e '''Solution''': We can model this situation as a row of 7 boxes, like this: <cmath>\square \square \square \square \square \square \s13 KB (2,018 words) - 15:31, 10 January 2025
- MC(90,"\mbox{semiminor axis}",7,D((0,0)--(0,3),green+linewidth(1)),E); MC("\mbox{semimajor axis}",7,D((0,0)--(5,0),red+linewidth(1)),S);5 KB (892 words) - 21:52, 1 May 2021
- ...etic sequence with common difference <math>-8</math>; however, <math>7, 0, 7, 14</math> and <math>4, 12, 36, 108, \ldots</math> are not arithmetic seque * [[2005_AMC_10A_Problems/Problem_17 | 2005 AMC 10A Problem 17]]4 KB (736 words) - 02:00, 7 March 2024
- ...re in the form <math>(P_{ia},Q_{ia})</math> for [[positive]] integer <math>i</math>. ...s for any given Diophantine equations. This is known as [[Hilbert's tenth problem]]. The answer, however, is no.9 KB (1,434 words) - 01:15, 4 July 2024
- ...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
- ...S'</math> and <math>S''</math> are equal if they include the same objects, i.e., if for every object <math>x</math>, we have <math>x\in S'</math> if and ...describe sets should be used with extreme caution. One way to avoid this problem is as follows: given a property <math>P</math>, choose a known set <math>T<11 KB (2,019 words) - 17:20, 7 July 2024
- {{AIME Problems|year=2005|n=II}} == Problem 1 ==7 KB (1,119 words) - 21:12, 28 February 2020
- == Problem == ...or equal to <math>1000</math> is <math> (\sin t + i \cos t)^n = \sin nt + i \cos nt </math> true for all real <math> t </math>?6 KB (1,154 words) - 03:30, 11 January 2024
- == Problem == ...A=(0,9), B=(9,9), C=(9,0), D=(0,0), E=(2.5-0.5*sqrt(7),9), F=(6.5-0.5*sqrt(7),9), G=(4.5,9), O=(4.5,4.5); draw(A--B--C--D--A);draw(E--O--F);draw(G--O);13 KB (2,080 words) - 13:14, 23 July 2024
- {{AIME Problems|year=2005|n=I}} == Problem 1 ==6 KB (983 words) - 05:06, 20 February 2019
- == Problem == ...values of <math> k </math> does <math> S_k </math> contain the term <math>2005</math>?2 KB (303 words) - 01:31, 5 December 2022
- == Problem == ...bers less than <math>50</math>. There are fifteen of these (<math>2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43</math> and <math>47</math>) so ther2 KB (249 words) - 09:37, 23 January 2024
- == Problem == ...irector realizes that if they are arranged in a rectangular formation with 7 more rows than columns,8 KB (1,249 words) - 21:25, 20 November 2024
- == Problem == ...> P </math> be the product of the nonreal roots of <math> x^4-4x^3+6x^2-4x=2005. </math> Find <math> \lfloor P\rfloor. </math>4 KB (686 words) - 12:52, 13 June 2024
- == Problem == label("$C$",(16.87,7),E);4 KB (567 words) - 20:20, 3 March 2020
