Search results
Create the page "Problem 6" on this wiki! See also the search results found.
Page title matches
- ==Problem== ...ion was posted and copyrighted by mathmanman. The original thread for this problem can be found here: [https://aops.com/community/p587109]3 KB (563 words) - 16:21, 29 January 2021
- ==Problem== ...h means that <math>x=6</math>, or the side length of the triangle is <math>6</math>. Thus, the triangle (and the square) have a perimeter of <math>18</m1 KB (174 words) - 15:55, 18 April 2018
- ==Problem== ...s in the two boxes that touch it in the row above. For example, <math>30 = 6\times5</math>. What is the missing number in the top row?3 KB (477 words) - 00:05, 2 February 2023
- == Problem==649 bytes (95 words) - 21:55, 1 January 2014
- ...C 12A Problems|2014 AMC 12A #4]] and [[2014 AMC 10A Problems|2014 AMC 10A #6]]}} ==Problem==4 KB (737 words) - 00:09, 27 June 2023
- ==Problem==685 bytes (102 words) - 17:27, 9 January 2021
- ===Problem 6===3 KB (560 words) - 21:08, 15 December 2018
- ==Problem==7 KB (1,273 words) - 18:17, 28 August 2021
- ==Problem==2 KB (361 words) - 11:55, 25 June 2020
- ==Problem== {{IMO box|year=2006|num-b=5|after=Last Problem}}397 bytes (76 words) - 11:18, 7 June 2024
- ==Problem==1 KB (191 words) - 06:08, 23 February 2023
- ==Problem== ...has enough to buy <math>30 \cdot \dfrac{2}{\dfrac{5}{3}} = 30 \cdot \dfrac{6}{5} = \fbox{(C) 36}</math>.1 KB (202 words) - 12:03, 2 July 2023
- ==Problem==1 KB (223 words) - 10:11, 3 March 2015
- == Problem 6 == ==Solution 6 (Vieta's solution)==7 KB (1,158 words) - 20:50, 8 December 2021
- == Problem ==719 bytes (63 words) - 13:18, 11 August 2023
- == Problem ==760 bytes (138 words) - 22:51, 4 October 2016
- == Problem == real m = sqrt(6)/12;878 bytes (132 words) - 04:39, 4 February 2016
- == Problem ==795 bytes (127 words) - 01:52, 16 August 2023
- == Problem ==1 KB (187 words) - 03:29, 7 June 2018
- == Problem ==925 bytes (159 words) - 03:15, 12 March 2017
Page text matches
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2000 AIME II Problems/Problem 1|Problem 1]]1 KB (139 words) - 08:41, 7 September 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2001 AIME I Problems/Problem 1|Problem 1]]1 KB (139 words) - 08:41, 7 September 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2000 AIME I Problems/Problem 1|Problem 1]]1 KB (135 words) - 18:05, 30 May 2015
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1999 AIME Problems/Problem 1|Problem 1]]1 KB (118 words) - 08:41, 7 September 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1998 AIME Problems/Problem 1|Problem 1]]1 KB (114 words) - 08:39, 7 September 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1997 AIME Problems/Problem 1|Problem 1]]1 KB (114 words) - 08:39, 7 September 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1996 AIME Problems/Problem 1|Problem 1]]1 KB (114 words) - 08:39, 7 September 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1995 AIME Problems/Problem 1|Problem 1]]1 KB (114 words) - 08:38, 7 September 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1994 AIME Problems/Problem 1|Problem 1]]1 KB (114 words) - 08:43, 7 September 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1983 AIME Problems/Problem 1|Problem 1]]1 KB (114 words) - 20:35, 31 October 2020
- == Problem 1 == [[1983 AIME Problems/Problem 1|Solution]]7 KB (1,104 words) - 03:13, 27 May 2024
- ==Problem== This problem is essentially asking how many ways there are to choose <math>2</math> dist5 KB (830 words) - 22:15, 28 December 2023
- == Problem 1 == [[1984 AIME Problems/Problem 1|Solution]]6 KB (933 words) - 01:15, 19 June 2022
- == Problem 1 == [[1986 AIME Problems/Problem 1|Solution]]5 KB (847 words) - 15:48, 21 August 2023
- == Problem 1 == [[1987 AIME Problems/Problem 1|Solution]]6 KB (869 words) - 15:34, 22 August 2023
- == Problem 1 == ...r -- the correct five buttons. The sample shown below has <math>\{1, 2, 3, 6, 9\}</math> as its combination. Suppose that these locks are redesigned so6 KB (902 words) - 08:57, 19 June 2021
- == Problem 1 == [[1989 AIME Problems/Problem 1|Solution]]7 KB (1,045 words) - 20:47, 14 December 2023
- == Problem 1 == The [[increasing sequence]] <math>2,3,5,6,7,10,11,\ldots</math> consists of all [[positive integer]]s that are neithe6 KB (870 words) - 10:14, 19 June 2021
- == Problem 1 == [[1991 AIME Problems/Problem 1|Solution]]7 KB (1,106 words) - 22:05, 7 June 2021
- == Problem 1 == [[1992 AIME Problems/Problem 1|Solution]]8 KB (1,117 words) - 05:32, 11 November 2023