Search results
Create the page "2007 AIME II-3b.PNG" on this wiki! See also the search results found.
Page title matches
- [[Image:2007 AIME II-9.png]] {{AIME box|year=2007|n=II|num-b=8|num-a=10}}5 KB (818 words) - 10:05, 7 June 2022
- {{AIME box|year=2007|n=II|num-b=9|num-a=11}}8 KB (1,368 words) - 18:02, 20 July 2024
- The '''2007 AIME II''' was held on March 28, 2007. The first link contains the full set of test problems. The rest contain e * [[2007 AIME II Problems]]1 KB (135 words) - 11:34, 22 March 2011
- ...times than it appears among the four letters in AIME or the four digits in 2007. A set of plates in which each possible sequence appears exactly once conta {{AIME box|year=2007|n=II|before=First Question|num-a=2}}1 KB (180 words) - 13:01, 3 December 2023
- [[Image:AIME II prob10 bruteforce.PNG ]] {{AIME box|year=2007|n=II|num-b=2|num-a=4}}6 KB (933 words) - 23:05, 7 July 2023
- {{AIME box|year=2007|n=II|num-b=3|num-a=5}}1 KB (207 words) - 10:12, 20 April 2024
- The [[graph]] of the [[equation]] <math>9x+223y=2007</math> is drawn on graph paper with each [[square]] representing one [[unit There are <math>223 \cdot 9 = 2007</math> squares in total formed by the rectangle with edges on the x and y a4 KB (559 words) - 23:38, 2 January 2023
- {{AIME box|year=2007|n=II|num-b=5|num-a=7}}2 KB (339 words) - 19:57, 11 January 2025
- {{AIME box|year=2007|n=II|num-b=6|num-a=8}}3 KB (428 words) - 17:04, 4 December 2020
- {{AIME box|year=2007|n=II|num-b=1|num-a=3}}1 KB (228 words) - 07:41, 4 November 2022
- Given that the total length of all lines drawn is exactly 2007 units, let <math>N</math> be the maximum possible number of basic rectangle ...math>(x - 1)(y - 1)</math>. <math>5x + 4y = 2007 \Longrightarrow y = \frac{2007 - 5x}{4}</math>. Substituting, we find that <math>(x - 1)\left(-\frac 54x +3 KB (399 words) - 20:17, 24 February 2021
- [[Image:2007 AIME II-11.png]] {{AIME box|year=2007|n=II|num-b=10|num-a=12}}2 KB (407 words) - 15:31, 29 February 2020
- {{AIME box|year=2007|n=II|num-b=11|num-a=13}}5 KB (829 words) - 11:22, 8 January 2024
- {{AIME box|year=2007|n=II|num-b=12|num-a=14}}4 KB (678 words) - 07:06, 18 October 2024
- [[Image:2007 AIME II-15b.gif]] {{AIME box|year=2007|n=II|num-b=14|after=Last question}}11 KB (2,099 words) - 22:44, 6 October 2024
- {{AIME box|year=2007|n=II|num-b=13|num-a=15}}7 KB (1,335 words) - 16:44, 25 January 2022
- {{AIME Problems|year=2007|n=II}} ...than it appears among the four letters in AIME or the four digits in <math>2007</math>. A set of plates in which each possible sequence appears exactly onc9 KB (1,435 words) - 00:45, 6 December 2021
Page text matches
- ...AMC historical results''' page. This page should include results for the [[AIME]] as well. For [[USAMO]] results, see [[USAMO historical results]]. == AIME Qualification ==19 KB (2,024 words) - 17:13, 21 February 2025
- ([[2007 iTest Problems/Problem 6|Source]]) ([[2003 AIME I Problems/Problem 1|Source]])10 KB (809 words) - 15:40, 17 March 2024
- '''2006 AIME II''' problems and solutions. The first link contains the full set of test * [[2006 AIME II Problems]]1 KB (133 words) - 11:32, 22 March 2011
- * [[2006_AIME_II_Problems/Problem_5 | 2006 AIME II Problem 5]] * [[2007_AIME_II_Problems/Problem_10 | 2007 AIME II Problem 10]]4 KB (590 words) - 10:52, 28 September 2024
- *[[2007 AMC 12A Problems/Problem 18]] *[[1984 AIME Problems/Problem 8|1984 AIME Problem 8]]5 KB (860 words) - 14:36, 10 December 2023
- * Perfect score on the [[AIME]] as a freshman. * [[iTest]] head test writer (2007 and 2008)2 KB (362 words) - 10:20, 27 September 2024
- * [[2005_AIME_II_Problems/Problem_3 | 2005 AIME II Problem 3]] * [[2007 AIME II Problems/Problem 12 | 2007 AIME II Problem 12]]4 KB (649 words) - 20:09, 19 July 2024
- ([[2007 AIME II Problems/Problem 15|Source]])3 KB (533 words) - 12:51, 2 September 2024
- * [[2007_AIME_II_Problems/Problem_14 | 2007 AIME II Problem 14]]4 KB (743 words) - 23:28, 17 November 2024
- A '''Mock AIME''' is a contest that is intended to mimic the [[AIME]] competition. (In more recent years, recurring competitions will be listed ...xOGY2Y2QwOTc3NWZiYjY0LnBkZg==&rn=TWlsZG9yZiBNb2NrIEFJTUUucGRm Mildorf Mock AIME 1]8 KB (901 words) - 19:45, 13 January 2025
- This is a list of all [[AIME]] exams in the AoPSWiki. Many of these problems and solutions are also ava | 2025 || [[2025 AIME I | AIME I]] || [[2025 AIME II | AIME II]]3 KB (400 words) - 19:21, 13 February 2025
- *[[2007 AIME II Problems/Problem 15]]2 KB (321 words) - 21:54, 20 June 2024
- *[[Mock AIME 1 2006-2007 Problems/Problem 13 | Previous Problem]] *[[Mock AIME 1 2006-2007 Problems/Problem 15 | Next Problem]]3 KB (541 words) - 16:32, 22 November 2023
- [[Image:2007 AIME II-9.png]] {{AIME box|year=2007|n=II|num-b=8|num-a=10}}5 KB (818 words) - 10:05, 7 June 2022
- {{AIME box|year=2007|n=II|num-b=9|num-a=11}}8 KB (1,368 words) - 18:02, 20 July 2024
- {{AIME Problems|year=2007|n=I}} [[2007 AIME I Problems/Problem 1|Solution]]7 KB (1,218 words) - 14:28, 11 July 2022
- The '''2007 AIME I''' was held on March 13, 2007. The first link contains the full set of test problems. The rest contain e * [[2007 AIME I Problems]]1 KB (135 words) - 11:32, 22 March 2011
- The '''2007 AIME II''' was held on March 28, 2007. The first link contains the full set of test problems. The rest contain e * [[2007 AIME II Problems]]1 KB (135 words) - 11:34, 22 March 2011
- ...times than it appears among the four letters in AIME or the four digits in 2007. A set of plates in which each possible sequence appears exactly once conta {{AIME box|year=2007|n=II|before=First Question|num-a=2}}1 KB (180 words) - 13:01, 3 December 2023
- [[Image:AIME II prob10 bruteforce.PNG ]] {{AIME box|year=2007|n=II|num-b=2|num-a=4}}6 KB (933 words) - 23:05, 7 July 2023