Search results

Page title matches

  • ...plicate|[[2001 AMC 12 Problems|2001 AMC 12 #4]] and [[2001 AMC 10 Problems|2001 AMC 10 #16]]}} == Problem ==
    2 KB (311 words) - 21:53, 10 February 2024
  • == Problem == <math> \textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }6 </math>
    994 bytes (152 words) - 17:56, 19 June 2023
  • ==Problem== The digits 1, 2, 3, 4 and 9 are each used once to form the smallest possible '''even''' five-digi
    1 KB (176 words) - 00:37, 5 July 2013

Page text matches

  • ...ministered by the [[Mathematical Association of America]] (MAA). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC! ...blem 1-5</u>: 3<br><u>Problem 6-10</u>: 4<br><u>Problem 10-12</u>: 5<br><u>Problem 12-15</u>: 6}}
    8 KB (1,057 words) - 12:02, 25 February 2024
  • ...d only once. In particular, memorizing a formula for PIE is a bad idea for problem solving. ==== Problem ====
    9 KB (1,703 words) - 07:25, 24 March 2024
  • This is a problem where constructive counting is not the simplest way to proceed. This next e ...proceed with the construction. If we were to go like before and break the problem down by each box, we'd get a fairly messy solution.
    12 KB (1,896 words) - 23:55, 27 December 2023
  • [[2008 AMC 12B Problems/Problem 22]] [[2001 AIME I Problems/Problem 6]]
    1,016 bytes (141 words) - 03:39, 29 November 2021
  • ...plicate|[[2001 AMC 12 Problems|2001 AMC 12 #1]] and [[2001 AMC 10 Problems|2001 AMC 10 #3]]}} == Problem ==
    788 bytes (120 words) - 10:32, 8 November 2021
  • ...plicate|[[2001 AMC 12 Problems|2001 AMC 12 #3]] and [[2001 AMC 10 Problems|2001 AMC 10 #9]]}} ==Problem==
    1 KB (203 words) - 01:25, 1 March 2024
  • {{duplicate|[[2000 AMC 12 Problems|2000 AMC 12 #1]] and [[2000 AMC 10 Problems|2000 AMC 10 #1]]}} ==Problem==
    2 KB (276 words) - 05:25, 9 December 2023
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. *[[2000 AMC 12 Problems]]
    1 KB (126 words) - 13:28, 20 February 2020
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. *[[2001 AMC 12 Problems]]
    1 KB (127 words) - 21:36, 6 October 2014
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. *[[2002 AMC 12A Problems]]
    1 KB (158 words) - 21:33, 6 October 2014
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2002 AMC 12B Problems]]
    1 KB (154 words) - 00:32, 7 October 2014
  • {{AMC12 Problems|year=2004|ab=A}} == Problem 1 ==
    13 KB (1,953 words) - 00:31, 26 January 2023
  • {{AMC12 Problems|year=2002|ab=A}} == Problem 1 ==
    12 KB (1,792 words) - 13:06, 19 February 2020
  • {{AMC12 Problems|year=2000|ab=}} == Problem 1 ==
    13 KB (1,948 words) - 12:26, 1 April 2022
  • {{AMC12 Problems|year=2001|ab=}} == Problem 1 ==
    13 KB (1,957 words) - 12:53, 24 January 2024
  • {{AMC12 Problems|year=2002|ab=B}} == Problem 1 ==
    10 KB (1,547 words) - 04:20, 9 October 2022
  • {{AMC12 Problems|year=2004|ab=B}} == Problem 1 ==
    13 KB (2,049 words) - 13:03, 19 February 2020
  • {{duplicate|[[2000 AMC 12 Problems|2000 AMC 12 #2]] and [[2000 AMC 10 Problems|2000 AMC 10 #2]]}} == Problem ==
    973 bytes (104 words) - 14:51, 9 July 2023
  • == Problem == The assortments are: <math>\{(0,6,0); (0,5,1); (0,4,2); (0,3,3); (0,2,4); (0,1,5); (0,0,6)\} \rightarrow 7</math> assortments.
    7 KB (994 words) - 17:51, 11 April 2024
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2001 AMC 8 Problems]]
    1 KB (138 words) - 10:26, 22 August 2013

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