Search results

Page title matches

Page text matches

  • The USAMTS is administered by the [[Art of Problem Solving Foundation]] with support and sponsorship by the [[National Securit ...gion=USA|type=Proof|difficulty=3-6|breakdown=<u>Problem 1-2</u>: 3-4<br><u>Problem 3-5</u>: 5-6}}
    4 KB (613 words) - 21:12, 15 October 2024
  • ...[[MAML]] (Maine Association of Math Leagues) Meets. Training includes the problem set "Pete's Fabulous 42." The first practice is Sunday, April 22, and the second is Saturday, May 19.
    22 KB (3,532 words) - 10:25, 27 September 2024
  • <math> \mathrm{(A) \ 22 } \qquad \mathrm{(B) \ 60 } \qquad \mathrm{(C) \ 119 } \qquad \mathrm{(D) \ ([[2000 AMC 12/Problem 6|Source]])
    4 KB (682 words) - 12:13, 8 December 2024
  • * <math>22! = 1124000727777607680000</math> ([[2007 iTest Problems/Problem 6|Source]])
    10 KB (809 words) - 15:40, 17 March 2024
  • ===2023 AIME I Problem 5=== ([[2023 AIME I Problems/Problem 5|Source]])
    6 KB (922 words) - 16:34, 13 January 2025
  • * [[Mock_AIME_2_2006-2007_Problems#Problem_8 | Mock AIME 2 2006-2007 Problem 8]] ([[number theory]]) *[[1994_AIME_Problems/Problem 9|1994 AIME Problem 9]]
    2 KB (316 words) - 15:03, 1 January 2024
  • ...ng may lead to a quick solution is the phrase "not" or "at least" within a problem statement. ''[[2006 AMC 10A Problems/Problem 21 | 2006 AMC 10A Problem 21]]: How many four-digit positive integers have at least one digit that is
    8 KB (1,192 words) - 16:20, 16 June 2023
  • [[2008 AMC 12B Problems/Problem 22]] [[2001 AIME I Problems/Problem 6]]
    1,016 bytes (141 words) - 02:39, 29 November 2021
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 10B Problems/Problem 1]]
    2 KB (182 words) - 20:57, 23 January 2021
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 12B Problems/Problem 1 | Problem 1]]
    2 KB (210 words) - 23:06, 6 October 2014
  • * <math>43 \equiv 22 \pmod{7}</math> because <math>\frac{43 - 22}{7} = \frac{21}{7} = 3</math>, which is an integer. === Sample Problem ===
    16 KB (2,410 words) - 13:05, 3 January 2025
  • ...k contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 10A Problems/Problem 1]]
    2 KB (180 words) - 17:06, 6 October 2014
  • == Problem == ...Then <math>x_{2k}=132</math> and <math>x_{2k+1}=135</math> for all <math>k>22</math>. Since <math>2007</math> is odd, we have <math>x_{2007}=135</math>.
    8 KB (1,334 words) - 16:37, 15 December 2024
  • == Problem == ...of ordered pairs that work is <math>1 + \frac{1001-11}{22}=1 + \frac{990}{22}=46</math>. (We must add 1 because both endpoints are being included.) So
    4 KB (651 words) - 17:27, 22 May 2021
  • ==Problem 1== [[2021 JMC 10 Problems/Problem 1|Solution]]
    12 KB (1,784 words) - 15:49, 1 April 2021
  • == Problem 1 == [[2006 AMC 12B Problems/Problem 1|Solution]]
    13 KB (2,058 words) - 11:36, 4 July 2023
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 12A Problems/Problem 1]]
    1 KB (168 words) - 20:51, 6 October 2014
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AMC 12A Problems/Problem 1]]
    2 KB (186 words) - 16:35, 16 December 2019
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AMC 12B Problems/Problem 1]]
    2 KB (181 words) - 20:40, 6 October 2014
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. ** [[2005 AMC 12A Problems/Problem 1|Problem 1]]
    2 KB (202 words) - 20:30, 6 October 2014

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