Search results
Create the page "2000 AIME Problems" on this wiki! See also the search results found.
- {{AIME box|year=2000|n=II|num-b=11|num-a=13}} [[Category:Intermediate Geometry Problems]]3 KB (532 words) - 13:14, 22 August 2020
- {{AIME box|year=2000|n=II|num-b=10|num-a=12}} [[Category:Intermediate Geometry Problems]]4 KB (750 words) - 22:55, 5 February 2024
- {{AIME box|year=2000|n=II|num-b=9|num-a=11}} [[Category:Intermediate Geometry Problems]]2 KB (399 words) - 17:37, 2 January 2024
- ...th>, find the least integer that is greater than <math>z^{2000}+\frac 1{z^{2000}}</math>. Using [[De Moivre's Theorem]] we have <math>z^{2000} = \cos 6000^\circ + i\sin 6000^\circ</math>, <math>6000 = 16(360) + 240</m4 KB (675 words) - 13:42, 4 April 2024
- {{AIME box|year=2000|n=II|num-b=7|num-a=9}} [[Category:Intermediate Geometry Problems]]4 KB (584 words) - 19:35, 7 December 2019
- {{AIME box|year=2000|n=II|num-b=6|num-a=8}} [[Category:Intermediate Combinatorics Problems]]2 KB (281 words) - 12:09, 5 April 2024
- {{AIME box|year=2000|n=II|num-b=5|num-a=7}} [[Category:Intermediate Geometry Problems]]3 KB (433 words) - 19:42, 20 December 2021
- {{AIME box|year=2000|n=II|num-b=4|num-a=6}} [[Category:Intermediate Combinatorics Problems]]1 KB (184 words) - 21:13, 12 September 2020
- {{AIME box|year=2000|n=II|num-b=3|num-a=5}} [[Category:Intermediate Number Theory Problems]]2 KB (397 words) - 15:55, 11 May 2022
- {{AIME box|year=2000|n=II|num-b=2|num-a=4}} [[Category:Intermediate Combinatorics Problems]]1 KB (191 words) - 04:27, 4 November 2022
- ...tice point. How many lattice points lie on the hyperbola <math>x^2 - y^2 = 2000^2</math>? <cmath>(x-y)(x+y)=2000^2=2^8 \cdot 5^6</cmath>804 bytes (126 words) - 20:30, 4 July 2013
- ...= 400</math> so <math>3^{400} \equiv 1 \pmod{1000}</math> and so <math>3^{2000}\equiv 1 \pmod{1000}</math> and so <math>3^{2007} \equiv 3^7 \equiv 2187 \e *[[Mock AIME 1 2006-2007 Problems/Problem 2 | Previous Problem]]963 bytes (135 words) - 15:53, 3 April 2012
- ...asic, checking the parity of numbers is often an useful tactic for solving problems, especially with [[proof by contradiction]]s and [[casework]]. == Problems ==4 KB (694 words) - 22:00, 12 January 2024
- Return to [[1999 AIME]] ([[1999 AIME Problems]]) ...ore=[[1998 AIME Answer Key|1998 AIME]]|after=[[2000 AIME I Answer Key|2000 AIME I]]}}251 bytes (20 words) - 18:29, 13 March 2009
- ...n AIME problem so it is implicit that <math>n < 1000</math>, so <math>2n < 2000</math>. It is easy to see that <math>a_n</math> is strictly increasing by i ...21, 801</math>. <math>N</math> cannot exceed <math>1000</math> since it is AIME problem. Now take the first criterion, let <math>a</math> be the smaller co4 KB (628 words) - 16:23, 2 January 2024
- == Problems == ...hat is the ratio of the cone’s height to its [[radius]]? ([[2003 AMC 12B Problems/Problem 13]])7 KB (1,128 words) - 20:12, 27 September 2022
- Return to [[2001 AIME I]] ([[2001 AIME I Problems]]) ...000 AIME II Answer Key|2000 AIME II]]|after=[[2001 AIME II Answer Key|2001 AIME II]]}}267 bytes (26 words) - 18:16, 19 June 2008
- Return to [[2000 AIME I]] ([[2000 AIME I Problems]]) ...re=[[1999 AIME Answer Key|1999 AIME]]|after=[[2000 AIME II Answer Key|2000 AIME II]]}}261 bytes (24 words) - 19:17, 27 May 2016
- Return to [[2000 AIME II]] ([[2000 AIME II Problems]]) ...[[2000 AIME I Answer Key|2000 AIME I]]|after=[[2001 AIME I Answer Key|2001 AIME I]]}}266 bytes (26 words) - 13:09, 24 December 2020
- {{AIME Problems|year=2009|n=II}} [[2009 AIME II Problems/Problem 1|Solution]]8 KB (1,366 words) - 21:33, 3 January 2021
