Search results

Page title matches

Page text matches

  • ...gnificant portion of the academic year. Selection is important in creating the best experience for any math student. ...that do, please add that information to any appropriate places you find in the [[AoPSWiki]].
    14 KB (1,881 words) - 18:07, 22 October 2024
  • '''{MathILy, MathILy-Er}''' are a pair of intensive 5-week-long residential summer math programs for high school stud ...d the apprentice instructors are graduate or undergraduate math students. The math content covered is undergraduate- and graduate-level.
    5 KB (706 words) - 22:49, 29 January 2024
  • * [[Nebraska MathCounts]] is part of the national [[MathCounts]] competition. *[[University of Nebraska-Omaha Math Contest]]. Consists of two problem solving rounds and a speed round - for grades 9-12.
    2 KB (200 words) - 09:11, 29 December 2020
  • ...on the path toward choosing the team that represents the United States at the [[International Mathematics Olympiad]] (IMO). ...Solving]] (AoPS) is a proud sponsor of the AMC and of the recent expansion of USAMO participants from around 250 to around 500.
    6 KB (874 words) - 22:02, 10 November 2024
  • Team selection for the [[American Regions Mathematics League]] varies from team to team. ...ge Xinke's AoPS account "hurdler", if you are interested in trying out for the Alabama team.
    22 KB (3,532 words) - 10:25, 27 September 2024
  • ...t two weeks of July to the first two weeks of August. The students stay at the [http://www.stanford.edu/group/synergy/ Synergy Coop.] ...I and Program II. Program I is taught by Rick Sommer and covers the basics of [[group theory]] and [[number theory]]. Program II is taught by Adrian Buts
    1 KB (166 words) - 16:54, 10 June 2016
  • '''Math Day at the Beach''' is a [[mathematical problem solving]] festival for Southern California high school students, hosted by ...nd team competition. Teams represent high schools and have 6 members each. The competition takes place on a Saturday in March.
    4 KB (644 words) - 11:56, 29 March 2017
  • ...m is free to participants, invitations are limited to the top finishers on the [[USAMO]]. ...The results of the USAMO and the TST are weighted equally when selecting the US IMO team.
    6 KB (966 words) - 21:29, 15 December 2024
  • ...ific competitions. Each year, countries from around the world send a team of 6 students to compete in a grueling competition. .../u>: 9.5<br><u>Problem SL1-2</u>: 5.5-7<br><u>Problem SL3-4</u>: 7-8<br><u>Problem SL5+</u>: 8-10}}
    3 KB (490 words) - 02:32, 23 July 2023
  • ...s, the administrator may ask other people to sign up to write problems for the contest. Mock AMCs are usually very popular in the months leading up to the actual [[AMC]] competition. There is no guarantee that community members w
    51 KB (6,175 words) - 20:41, 27 November 2024
  • ==Problem 1== What is the value of <cmath>\dfrac{20}{2\cdot1} - \dfrac{2+0}{2/1}?</cmath>
    12 KB (1,784 words) - 15:49, 1 April 2021
  • == Problem 1 == Compute the sum of all the roots of
    12 KB (1,792 words) - 12:06, 19 February 2020
  • == Problem 1 == ...th>I \cdot M \cdot O = 2001 </math>. What is the largest possible value of the sum <math>I + M + O</math>?
    13 KB (1,948 words) - 09:35, 16 June 2024
  • == Problem 1 == Which of the following is the same as
    13 KB (1,987 words) - 17:53, 10 December 2022
  • == Day 1 == === Problem 1 ===
    3 KB (520 words) - 08:24, 14 May 2021
  • == Problem == ...Alpha's two-day success ratio was 300/500 = 3/5. The largest possible two-day success ratio that Beta could achieve is <math> m/n, </math> where <math> m
    3 KB (436 words) - 17:31, 9 January 2024
  • == Problem 1 == ...egers in decreasing order when read from left to right. What is the sum of the possible remainders when <math> n </math> is divided by 37?
    9 KB (1,434 words) - 12:34, 29 December 2021
  • ==Problem== ...must be hired after three-quarters of the work has been completed so that the entire project can be completed on schedule or before?
    4 KB (592 words) - 18:02, 26 September 2020
  • == Problem 1 == ...> as its combination. Suppose that these locks are redesigned so that sets of as many as nine buttons or as few as one button could serve as combinations
    6 KB (902 words) - 07:57, 19 June 2021
  • == Problem 1 == [[1993 AIME Problems/Problem 1|Solution]]
    8 KB (1,275 words) - 05:55, 2 September 2021

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