Search results

Page title matches

  • ==Problem== ...rcles are mutually externally tangent. Two of the circles have radii <math>3</math> and <math>7</math>. If the area of the triangle formed by connecting
    795 bytes (129 words) - 10:22, 4 April 2012
  • == Problem == ...> and <math>E</math> are collinear in that order such that <math>AB = BC = 1, CD = 2,</math> and <math>DE = 9</math>. If <math>P</math> can be any point
    1 KB (217 words) - 06:18, 2 July 2015

Page text matches

  • ...ed States at the [[International Mathematics Olympiad]] (IMO). While most AIME participants are high school students, some bright middle school students a High scoring AIME students are invited to take the prestigious [[United States of America Mat
    8 KB (1,057 words) - 12:02, 25 February 2024
  • ...administered by the [[American Mathematics Competitions]] (AMC). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC and of the recent expansion ...7-9|breakdown=<u>Problem 1/4</u>: 7<br><u>Problem 2/5</u>: 8<br><u>Problem 3/6</u>: 9}}
    6 KB (869 words) - 12:52, 20 February 2024
  • Substituting <math>\sin^2B=1-\cos^2B</math> results in <cmath>4[ABCD]^2=(1-\cos^2B)(ab+cd)^2=(ab+cd)^2-\cos^2B(ab+cd)^2</cmath>
    3 KB (465 words) - 18:31, 3 July 2023
  • ...A number of '''Mock AMC''' competitions have been hosted on the [[Art of Problem Solving]] message boards. They are generally made by one community member ...AMC]] competition. There is no guarantee that community members will make Mock AMCs in any given year, but there probably will be one.
    51 KB (6,175 words) - 20:58, 6 December 2023
  • The '''Mock AIME 2 Pre 2005''' was written by [[Art of Problem Solving]] community member Mildorf. * [[Mock AIME 2 Pre 2005 Problems|Entire Exam]]
    2 KB (181 words) - 10:58, 18 March 2015
  • The '''Mock AIME 7 Pre 2005''' was written by [[Art of Problem Solving]] community member Mildorf. * [[Mock AIME 7 Pre 2005 Problems|Entire Exam]]
    1 KB (146 words) - 16:33, 14 October 2022
  • The '''Mock AIME 1 2005-2006''' was written by [[Art of Problem Solving]] community member paladin8. * [[Mock AIME 1 2005-2006/Answer Key|Answer Key]]
    1 KB (135 words) - 17:41, 21 January 2017
  • == Problem 1 == [[Mock AIME 1 Pre 2005 Problems/Problem 1|Solution]]
    6 KB (1,100 words) - 22:35, 9 January 2016
  • ==Problem 1== ...rcles are mutually externally tangent. Two of the circles have radii <math>3</math> and <math>7</math>. If the area of the triangle formed by connecting
    7 KB (1,135 words) - 23:53, 24 March 2019
  • ==Problem== ...sets of <math>7</math> digits, consider <math>9</math> urns labeled <math>1,2,\cdots,9</math> (note that <math>0</math> is not a permissible digit); th
    950 bytes (137 words) - 10:16, 29 November 2019
  • ==Problem== <cmath>2f\left(x\right) + f\left(\frac{1}{x}\right) = 5x + 4</cmath>
    1 KB (191 words) - 10:22, 4 April 2012
  • ==Problem== <cmath>\zeta_1+\zeta_2+\zeta_3=1</cmath>
    2 KB (221 words) - 02:49, 19 March 2015
  • ==Problem== === Solution 1 (recursive) ===
    5 KB (795 words) - 16:03, 17 October 2021
  • ==Problem== <cmath>\sum_{n = 1}^{9800} \frac{1}{\sqrt{n + \sqrt{n^2 - 1}}}</cmath>
    3 KB (501 words) - 14:48, 29 November 2019
  • ==Problem== ...ect at <math>P</math>. If <math>AB = 1, CD = 4,</math> and <math>BP : DP = 3 : 8,</math> then the area of the inscribed circle of <math>ABCD</math> can
    2 KB (330 words) - 10:23, 4 April 2012
  • ==Problem== Here are some thoughts on the problem:
    3 KB (520 words) - 12:55, 11 January 2019
  • ==Problem== ==Solution 1==
    2 KB (278 words) - 16:32, 27 December 2019
  • ==Problem== <math>\{A_n\}_{n \ge 1}</math> is a sequence of positive integers such that
    2 KB (306 words) - 10:36, 4 April 2012
  • ==Problem== ...<math>n</math> such that <math>1 \le n \le 1000</math> and <math>n^{12} - 1</math> is divisible by <math>73</math>.
    714 bytes (105 words) - 23:59, 24 April 2013
  • ==Problem== <math>\left(\frac{2}{3}\right)^{2005} \cdot \sum_{k=1}^{2005} \frac{k^2}{2^k} \cdot {2005 \choose k}</math>
    3 KB (502 words) - 14:53, 19 July 2020

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