Create the page "Problem 6" on this wiki! See also the search results found.

Page title matches

• 2013 AIME I Problems/Problem 6
  ==Problem== ...is equivalent to <math>\frac{12\cdot 11\cdot 10\cdot 9\cdot 8\cdot 7\cdot 6}{144}=12\cdot11\cdot10\cdot7\cdot3</math>. If all of the math textbooks a
  5 KB (831 words) - 17:20, 9 January 2024
• 1991 AHSME Problems/Problem 6
  == Problem ==
  886 bytes (130 words) - 18:13, 5 September 2021
• 2013 AIME II Problems/Problem 6
  ==Problem 6== ...is small, so <math>10=6x+9</math>. <math>x=1/6\implies \sqrt{10}\approx 19/6</math>. This is 3.16.
  5 KB (842 words) - 19:42, 15 June 2024
• 2013 USAMO Problems/Problem 6
  ==Problem==
  4 KB (691 words) - 18:29, 10 May 2023
• 2005 IMO Problems/Problem 6
  ==Problem== ...more than 2/5 of the contestants. Moreover, no contestant solved all the 6 problems. Show that there are at least 2 contestants who solved exactly 5 p
  436 bytes (62 words) - 23:25, 26 August 2024
• 2014 AIME II Problems/Problem 6
  ==Problem== ...ls a six twice when using the fair die is <math>\frac{1}{6}\times \frac{1}{6}=\frac{1}{36}</math>. The probability that he rolls a six twice using the
  2 KB (356 words) - 09:03, 14 June 2021
• 2013 USAJMO Problems/Problem 6
  ==Problem 6== Again, we experiment. If x = 2, y = 3, and z = 3, then <math>18 > 7 + 4\sqrt{6}</math>.
  3 KB (517 words) - 20:02, 30 April 2014
• 1967 AHSME Problems/Problem 6
  == Problem ==
  530 bytes (88 words) - 01:35, 16 August 2023
• 1967 IMO Problems/Problem 6
  problem. I would also comment that choosing to verify the statement <math>6</math> days, and <math>36</math> medals were awarded".
  5 KB (788 words) - 20:35, 24 August 2024
• 1972 IMO Problems/Problem 6
  ==Problem== ...equilateral triangle (it is well-known that this is possible; in fact, the problem here is the <math>3</math>-dimensional version of this), and then complete
  7 KB (1,370 words) - 15:42, 29 January 2021
• 1975 IMO Problems/Problem 6
  ==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
• 1962 AHSME Problems/Problem 6
  ==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</m
  1 KB (174 words) - 15:55, 18 April 2018
• 2013 AMC 8 Problems/Problem 6
  ==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
• 1952 AHSME Problems/Problem 6
  == Problem==
  649 bytes (95 words) - 21:55, 1 January 2014
• 2014 AMC 10A Problems/Problem 6
  ...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
• 1994 AHSME Problems/Problem 6
  ==Problem==
  685 bytes (102 words) - 17:27, 9 January 2021
• 2015 USAMO Problems/Problem 6
  ===Problem 6===
  3 KB (560 words) - 21:08, 15 December 2018
• 2014 USAJMO Problems/Problem 6
  ==Problem==
  7 KB (1,273 words) - 18:17, 28 August 2021
• 2014 USAMO Problems/Problem 6
  ==Problem==
  2 KB (361 words) - 11:55, 25 June 2020
• 2006 IMO Problems/Problem 6
  ==Problem== {{IMO box|year=2006|num-b=5|after=Last Problem}}
  379 bytes (71 words) - 04:20, 31 August 2024

Page text matches

• 2004 AIME I Problems/Problem 8
  == Problem == There are no regular 3-pointed, 4-pointed, or 6-pointed stars. All regular 5-pointed stars are similar, but there are two n
  4 KB (620 words) - 21:26, 5 June 2021
• 2004 AIME I Problems
  == Problem 1 == [[2004 AIME I Problems/Problem 1|Solution]]
  9 KB (1,434 words) - 13:34, 29 December 2021
• 2004 AIME II Problems/Problem 15
  == Problem == Now, consider the strip of length <math>1024</math>. The problem asks for <math>s_{941, 10}</math>. We can derive some useful recurrences f
  6 KB (899 words) - 20:58, 12 May 2022
• 2004 AIME II Problems/Problem 14
  == Problem == ...n't need to be nearly as rigorous). A more natural manner of attacking the problem is to think of the process in reverse, namely seeing that <math>n \equiv 1
  11 KB (1,857 words) - 12:57, 18 July 2024
• 2004 AIME II Problems/Problem 12
  == Problem == ...CD </math> be an [[isosceles trapezoid]], whose dimensions are <math> AB = 6, BC=5=DA, </math>and <math> CD=4. </math> Draw [[circle]]s of [[radius]] 3
  3 KB (431 words) - 23:21, 4 July 2013
• 2004 AIME II Problems/Problem 10
  == Problem == ...}</math>. For example, with the binary string 0001001000 <math>y</math> is 6 and <math>x</math> is 3 (note that it is zero indexed).
  8 KB (1,283 words) - 19:19, 8 May 2024
• 2004 AIME II Problems/Problem 8
  == Problem == ...ays and likewise we can partition the 167 in three ways. So we have <math>6\cdot 3\cdot 3 = \boxed{54}</math> as our answer.
  2 KB (353 words) - 18:08, 25 November 2023
• 2004 AIME II Problems/Problem 7
  == Problem == It is clear from the problem setup that <math>0<\theta<\frac\pi2</math>, so the correct value is <math>\
  9 KB (1,501 words) - 05:34, 30 October 2023
• 2004 AIME II Problems/Problem 6
  == Problem == ...al. Also note some other conditions we have picked up in the course of the problem, namely that <math>b_1</math> is divisible by <math>8</math>, <math>b_2</ma
  6 KB (950 words) - 14:18, 15 January 2024
• 2004 AIME II Problems/Problem 5
  ==Problem== From the initial problem statement, we have <math>1000w\cdot\frac{1}{4}t=\frac{1}{4}</math>.
  4 KB (592 words) - 19:02, 26 September 2020
• 2004 AIME II Problems
  == Problem 1 == [[2004 AIME II Problems/Problem 1|Solution]]
  9 KB (1,410 words) - 05:05, 20 February 2019
• 2000 AIME II
  ...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
• 2001 AIME I
  ...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
• 2000 AIME I
  ...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
• 1999 AIME
  ...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
• 1998 AIME
  ...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
• 1997 AIME
  ...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
• 1996 AIME
  ...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
• 1995 AIME
  ...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
• 1994 AIME
  ...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

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)