Search results

Page title matches

Page text matches

  • <cmath>6-8-10 = (3-4-5)*2</cmath> * [[2006_AIME_I_Problems/Problem_1 | 2006 AIME I Problem 1]]
    5 KB (886 words) - 21:12, 22 January 2024
  • == Problem == <math> (\mathrm {A}) \ 5 \qquad (\mathrm {B}) \ 6 \qquad (\mathrm {C})\ 8 \qquad (\mathrm {D}) \ 9 \qquad (\mathrm {E})\ 10 <
    2 KB (307 words) - 15:30, 30 March 2024
  • == Problem == {{AMC10 box|year=2016|ab=A|num-b=4|num-a=6}}
    1 KB (184 words) - 13:58, 22 August 2023
  • == Problem == ...using the mean in your reasoning, you can just take the mean of the other 6 numbers, and it'll solve it marginally faster. -[[User:Integralarefun|Integ
    2 KB (268 words) - 18:19, 27 September 2023
  • == Problem == <math>\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf
    2 KB (315 words) - 15:34, 18 June 2022
  • == Problem == filldraw(rectangle((1,1),(6,4)),gray(0.75));
    2 KB (337 words) - 14:56, 25 June 2023
  • == Problem == ...uad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 5\dfrac{1}{4} \qquad \textbf{(D)}\ 6\dfrac{1}{2} \qquad \textbf{(E)}\ 8</math>
    8 KB (1,016 words) - 00:17, 31 December 2023
  • * [[Noetic Learning Math Contest]] - semiannual problem solving contest for elementary and middle school students. [Grades 2-8] ...ills through [https://www.beestar.org/exercise/samples.jsp?adid=105 Weekly Problem Solving Contests] and [https://www.beestar.org/competition/?adid=105 Beesta
    4 KB (473 words) - 16:14, 1 May 2024
  • * [https://www.hardestmathproblem.org Hardest Math Problem] math contest for grades 5-8 with great prizes. * [[Noetic Learning Math Contest]]: a popular problem-solving contest for students in grades 2-8.
    7 KB (792 words) - 10:14, 23 April 2024
  • Class meets for about 7 hours per day, in two shifts (morning and evening), 6 days per week. Each class has a Lead Instructor who is a mathematician with ...ctures and providing proofs. Classes include independent and collaborative problem solving as well as lots of laughter; in this way, students learn creative a
    5 KB (706 words) - 23:49, 29 January 2024
  • ...cluding Art of Problem Solving, the focus of MATHCOUNTS is on mathematical problem solving. Students are eligible for up to three years, but cannot compete be ...ics]]. The focus of MATHCOUNTS curriculum is in developing [[mathematical problem solving]] skills.
    10 KB (1,497 words) - 11:42, 10 March 2024
  • ...thematics offers two areas of math contests: Grade School (Grades 3, 4, 5, 6, 7, 8 + Algebra 1) and High School (Regional and State Finals). *2024 State FInals - Saturday 4/6/24
    8 KB (1,182 words) - 14:26, 3 April 2024
  • ...ks''' page is for compiling a list of [[textbook]]s for mathematics -- not problem books, contest books, or general interest books. See [[math books]] for mo * Getting Started is recommended for students grades 6 to 9.
    7 KB (901 words) - 14:11, 6 January 2022
  • ...Problem A/B, 1/2</u>: 7<br><u>Problem A/B, 3/4</u>: 8<br><u>Problem A/B, 5/6</u>: 9}} ...chool olympiads are, although they include more advanced mathematics. Each problem is graded on a scale of 0 to 10. The top five scorers (or more if there are
    4 KB (623 words) - 13:11, 20 February 2024
  • These '''Computer Science books''' are recommended by [[Art of Problem Solving]] administrators and members of the [http://www.artofproblemsolving .../ref_list_smcs.jsp?&mid=1500&div=9 Computer Science Reading for Grade 3-5, 6-8]
    2 KB (251 words) - 00:45, 17 November 2023
  • ==Problem== =\frac{2}{2}+\frac{4}{4}+\frac{6}{8}+\frac{8}{16}+\cdots\\
    1 KB (193 words) - 21:13, 18 May 2021
  • ...parentheses. For instance, <math>x \in [3,6)</math> means <math>3 \le x < 6</math>. The problem here is that we multiplied by <math>x+5</math> as one of the last steps. W
    12 KB (1,798 words) - 16:20, 14 March 2023
  • The USAMTS is administered by the [[Art of Problem Solving Foundation]] with support and sponsorship by the [[National Securit ...|difficulty=3-6|breakdown=<u>Problem 1-2</u>: 3-4<br><u>Problem 3-5</u>: 5-6}}
    4 KB (613 words) - 13:08, 18 July 2023
  • ...administered by the [[American Mathematics Competitions]] (AMC). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC. ...iculty=1-3|breakdown=<u>Problem 1-5</u>: 1<br><u>Problem 6-20</u>: 2<br><u>Problem 21-25</u>: 3}}
    4 KB (574 words) - 15:28, 22 February 2024
  • ...administered by the [[American Mathematics Competitions]] (AMC). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC! ...ulty=2-4|breakdown=<u>Problem 1-10</u>: 2<br><u>Problem 11-20</u>: 3<br><u>Problem 21-25</u>: 4}}
    4 KB (520 words) - 12:11, 13 March 2024
  • ...ministered by the [[Mathematical Association of America]] (MAA). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC! ...<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
  • == Problem 46== draw((-2/3,1/2)--(-sqrt(3)/6,1/2)--(0,0)--(sqrt(3)/6,1/2)--(2/3,1/2));
    3 KB (415 words) - 18:01, 24 May 2020
  • ==Problem 1== [[2015 IMO Problems/Problem 1|Solution]]
    4 KB (692 words) - 22:33, 15 February 2021
  • ...administered by the [[American Mathematics Competitions]] (AMC). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC and of the recent expansion ...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
  • {{WotWAnnounce|week=June 6-12}} The '''American Regions Math League''' (ARML) is a [[mathematical problem solving]] competition primarily for U.S. high school students.
    2 KB (267 words) - 17:06, 7 March 2020
  • ...tices held during the Spring Semester to determine the team each year. The 6 practices include 3 individual tests to help determine the team and some le ...[[MAML]] (Maine Association of Math Leagues) Meets. Training includes the problem set "Pete's Fabulous 42."
    21 KB (3,500 words) - 18:41, 23 April 2024
  • ...This yields <math>x(y+5)+6(y+5)=60</math>. Now, we can factor as <math>(x+6)(y+5)=60</math>. ...ecause this keeps showing up in number theory problems. Let's look at this problem below:
    7 KB (1,107 words) - 07:35, 26 March 2024
  • ...oblem solving]] involves using all the tools at one's disposal to attack a problem in a new way. <math>\frac{\pi^2}{6}=\frac{1}{1^2}+\frac{1}{2^2}+\frac{1}{3^2}+\cdots</math><br>
    2 KB (314 words) - 06:45, 1 May 2014
  • The geometric mean of the numbers 6, 4, 1 and 2 is <math>\sqrt[4]{6\cdot 4\cdot 1 \cdot 2} = \sqrt[4]{48} = 2\sqrt[4]{3}</math>. * [[1966 AHSME Problems/Problem 3]]
    2 KB (282 words) - 22:04, 11 July 2008
  • ...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
  • * <math>3! = 6</math> * <math>6! = 720</math>
    10 KB (809 words) - 16:40, 17 March 2024
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AIME II Problems/Problem 1]]
    1 KB (133 words) - 12:32, 22 March 2011
  • int n = 6; ...),red+linewidth(2));match(2,3,1); </asy>For <math>p=2,3</math> and <math>a=6,4</math>, respectively.</center>
    16 KB (2,658 words) - 16:02, 8 May 2024
  • f.p=fontsize(6); f.p=fontsize(6);
    3 KB (551 words) - 16:22, 13 September 2023
  • ...ast two digits of <math> 7^{81}-3^{81} </math>. ([[Euler's Totient Theorem Problem 1 Solution|Solution]]) ...ast two digits of <math> 3^{3^{3^{3}}} </math>. ([[Euler's Totient Theorem Problem 2 Solution|Solution]])
    3 KB (542 words) - 17:45, 21 March 2023
  • ...uited to studying large-scale properties of prime numbers. The most famous problem in analytic number theory is the [[Riemann Hypothesis]]. ...es <math>G_4</math> and <math>G_6</math> are modular forms of weight 4 and 6 respectively.
    5 KB (849 words) - 16:14, 18 May 2021
  • ...instance, if we tried to take the harmonic mean of the set <math>\{-2, 3, 6\}</math> we would be trying to calculate <math>\frac 3{\frac 13 + \frac 16 * [[2002 AMC 12A Problems/Problem 11]]
    1 KB (196 words) - 00:49, 6 January 2021
  • ...if its units digit is divisible by 2, i.e. if the number ends in 0, 2, 4, 6 or 8. ...s at the end of it to be divisible by 1,000,000 because <math>1,000,000=10^6</math>.
    8 KB (1,315 words) - 18:18, 2 March 2024
  • Other, odder inductions are possible. If a problem asks you to prove something for all integers greater than 3, you can use <m ...ernational Mathematics Olympiad | IMO]]. A good example of an upper-level problem that can be solved with induction is [http://www.artofproblemsolving.com/Fo
    5 KB (768 words) - 20:45, 1 September 2022
  • An example of a classic problem is as follows: ...hem twice. A number that is divisible by both 2 and 3 must be divisible by 6, and there are 16 such numbers. Thus, there are <math>50+33-16=\boxed{67}</
    4 KB (635 words) - 12:19, 2 January 2022
  • This is a problem where constructive counting is not the simplest way to proceed. This next e ...wer is <math>8 \cdot 7 \cdot 7 \cdot 7 \cdot 7 \cdot 7 \cdot 7 = 8 \cdot 7^6 = 941,192</math>, as desired. <math>\square</math>
    12 KB (1,896 words) - 23:55, 27 December 2023
  • Similarly, <math>42 \equiv 6 \pmod{9}</math>, so <math>\gcd(42,9) = \gcd(9,6)</math>. <br/> Continuing, <math>9 \equiv 3 \pmod{6}</math>, so <math>\gcd(9,6) = \gcd(6,3)</math>. <br/>
    6 KB (924 words) - 21:50, 8 May 2022
  • ...multiply the functions together, getting <math>1+3x+6x^2+8x^3+8x^4+6x^5+3x^6+x^7</math>. We want the number of ways to choose 4 eggs, so we just need to
    4 KB (659 words) - 12:54, 7 March 2022
  • ...th>\sum_{n=0}^{\infty} \frac{x^n}{n!} = 1 + x + \frac{x^2}{2} + \frac{x^3}{6} + \dots</cmath> for all <math>x</math>. ...[[polynomial]]s with [[binomial coefficient]]s. For example, if a contest problem involved the polynomial <math>x^5+4x^4+6x^3+4x^2+x</math>, one could factor
    5 KB (935 words) - 13:11, 20 February 2024
  • ...function: <math>f(x) = x^2 + 6</math>. The function <math>g(x) = \sqrt{x-6}</math> has the property that <math>f(g(x)) = x</math>. Therefore, <math>g ([[2006 AMC 10A Problems/Problem 2|Source]])
    10 KB (1,761 words) - 03:16, 12 May 2023
  • ...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) - 17:20, 16 June 2023
  • [[2008 AMC 12B Problems/Problem 22]] [[2001 AIME I Problems/Problem 6]]
    1,016 bytes (141 words) - 03:39, 29 November 2021
  • .../www.artofproblemsolving.com/Forum/viewtopic.php?p=394407#394407 1986 AIME Problem 11] ...lving.com/Forum/resources.php?c=182&cid=45&year=2000&p=385891 2000 AIME II Problem 7]
    12 KB (1,993 words) - 23:49, 19 April 2024
  • ...- 3)^2 + (y + 6)^2 = 25</math> represents the circle with center <math>(3,-6)</math> and radius 5 units. ([[2006 AMC 12A Problems/Problem 16|Source]])
    9 KB (1,581 words) - 18:59, 9 May 2024
  • ...umber can be rewritten as <math>2746_{10}=2\cdot10^3+7\cdot10^2+4\cdot10^1+6\cdot10^0.</math> ...of the decimal place (recall that the decimal place is to the right of the 6, i.e. 2746.0) tells us that there are six <math>10^0</math>'s, the second d
    4 KB (547 words) - 17:23, 30 December 2020
  • == Problem == ...d \textbf{(B)}\ 3S + 2\qquad \textbf{(C)}\ 3S + 6 \qquad\textbf{(D)}\ 2S + 6 \qquad \textbf{(E)}\ 2S + 12</math>
    788 bytes (120 words) - 10:32, 8 November 2021
  • ...1 AMC 12 Problems|2001 AMC 12 #2]] and [[2001 AMC 10 Problems|2001 AMC 10 #6]]}} == Problem ==
    1,007 bytes (165 words) - 00:28, 30 December 2023
  • '''Math Day at the Beach''' is a [[mathematical problem solving]] festival for Southern California high school students, hosted by ...oth individual and team competition. Teams represent high schools and have 6 members each. The competition takes place on a Saturday in March.
    4 KB (644 words) - 12:56, 29 March 2017
  • ...iv style="text-align:right">([[2000 AMC 12 Problems/Problem 4|2000 AMC 12, Problem 4]])</div> ...? <div style="text-align:right">([[1998 AIME Problems/Problem 8|1998 AIME, Problem 8]])</div>
    6 KB (957 words) - 23:49, 7 March 2024
  • ==Problem== label("160",(1.6,.5),NE);
    1 KB (160 words) - 16:53, 17 December 2020
  • Can you do the main problem now? # Here's a slightly different way to think about the main problem, that doesn't use physics. How much does the function <math>f(x)= \frac{x^
    11 KB (2,082 words) - 15:23, 2 January 2022
  • \qquad \mathrm{(D) \ } \sqrt{6} \qquad \mathrm{(E) \ } (\sqrt{6} + 1)/2
    6 KB (1,003 words) - 09:11, 7 June 2023
  • ...Cameron Matthews. In 2003, Crawford became the first employee of [[Art of Problem Solving]] where he helped to write and teach most of the online classes dur * [[USAMTS]] problem writer and grader (2004-2006)
    2 KB (360 words) - 02:20, 2 December 2010
  • \qquad \mathrm{(D) \ } \sqrt{6} \qquad \mathrm{(E) \ } (\sqrt{6} + 1)/2
    4 KB (658 words) - 16:19, 28 April 2024
  • == Problem == ...2+...+n^2) =</math> <math>\dfrac{(n+1)(n+2)(2n+3)}{6}+\dfrac{n(n+1)(2n+1)}{6}=\boxed{\dfrac{2n^3+6n^2+7n+3}{3}}</math>.
    7 KB (1,276 words) - 20:51, 6 January 2024
  • ...function: <math>f(x) = x^2 + 6</math>. The function <math>g(x) = \sqrt{x-6}</math> has the property that <math>f(g(x)) = x</math>. In this case, <mat ...ns can significantly help in solving functional identities. Consider this problem:
    2 KB (361 words) - 14:40, 24 August 2021
  • ...math>n</math> satisfy the equation <math>\left[\frac{n}{5}\right]=\frac{n}{6}</math>. [[1985 AIME Problems/Problem 10|(1985 AIME)]]
    3 KB (508 words) - 21:05, 26 February 2024
  • == Problem == {{IMO box|year=1985|num-b=4|num-a=6}}
    3 KB (496 words) - 13:35, 18 January 2023
  • ...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) - 21:57, 23 January 2021
  • <math>6 = 3 + 3</math> Euler, becoming interested in the problem, answered with an equivalent version of the conjecture:
    7 KB (1,201 words) - 16:59, 19 February 2024
  • ...nction, it is easy to see that <math>\zeta(s)=0</math> when <math>s=-2,-4,-6,\ldots</math>. These are called the trivial zeros. This hypothesis is one The Riemann Hypothesis is an important problem in the study of [[prime number]]s. Let <math>\pi(x)</math> denote the numbe
    2 KB (425 words) - 12:01, 20 October 2016
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AIME I Problems/Problem 1]]
    1 KB (135 words) - 18:15, 19 April 2021
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AIME II Problems/Problem 1]]
    1 KB (135 words) - 12:24, 22 March 2011
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2005 AIME I Problems/Problem 1 | Problem 1]]
    1 KB (154 words) - 12:30, 22 March 2011
  • ...c 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) - 03:32, 23 July 2023
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AIME I Problems/Problem 1]]
    1 KB (135 words) - 12:31, 22 March 2011
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2005 AIME II Problems/Problem 1]]
    1 KB (135 words) - 12:30, 22 March 2011
  • ...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) - 00:06, 7 October 2014
  • ...on &4 &6 & 4 \\ \hline Cube/Hexahedron & 8 & 12 & 6\\ \hline Octahedron & 6 & 12 & 8\\ \hline Dodecahedron & 20 & 30 & 12\\ \hline Icosahedron & 12 & 3 ==Problem==
    1,006 bytes (134 words) - 14:15, 6 March 2022
  • ...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 ...amous theorems and formulas and see if there's any way you can make a good problem out of them.
    51 KB (6,175 words) - 20:58, 6 December 2023
  • <math>1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, \ldots </math> ...\not\equiv 18 \pmod{6}</math> because <math>\frac{91 - 18}{6} = \frac{73}{6}</math>, which is not an integer.
    15 KB (2,396 words) - 20:24, 21 February 2024
  • <math>\{ \ldots, -6, -3, 0, 3, 6, \ldots \}</math> <math>\overline{6} \cdot \overline{6} = \overline{6 \cdot 6} = \overline{36} = \overline{1}</math>
    14 KB (2,317 words) - 19:01, 29 October 2021
  • label("$45^{\circ}$", A, 6*dir(290)); [[2007 AMC 12A Problems/Problem 10 | 2007 AMC 12A Problem 10]]
    3 KB (499 words) - 23:41, 11 June 2022
  • ...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) - 18:06, 6 October 2014
  • == Problem 1 == [[2006 AIME I Problems/Problem 1|Solution]]
    7 KB (1,173 words) - 03:31, 4 January 2023
  • == Problem == ...sequence. The only thing that will be left will be a sequence <math>\{0,3,6,9,\cdots,3k\}</math> for some even <math>k</math>. Since we started with 20
    6 KB (910 words) - 19:31, 24 October 2023
  • == Problem == ...1000</math>, we have five choices for <math>k</math>, namely <math>k=0,2,4,6,8</math>.
    10 KB (1,702 words) - 00:45, 16 November 2023
  • == Problem == ...e 2 towers which use blocks <math>1, 2</math>, so there are <math>2\cdot 3^6 = 1458</math> towers using blocks <math>1, 2, \ldots, 8</math>, so the answ
    3 KB (436 words) - 05:40, 4 November 2022
  • == Problem == draw((6.5,0)--origin--(0,6.5), Arrows(5));
    4 KB (731 words) - 17:59, 4 January 2022
  • == Problem == ...th> [[positive integer]]s. <math>a^{12}r^{66}=8^{2006} = (2^3)^{2006} = (2^6)^{1003}</math> so <math>a^{2}r^{11}=2^{1003}</math>.
    4 KB (651 words) - 18:27, 22 May 2021
  • == Problem == fill((2*i,0)--(2*i+1,0)--(2*i+1,6)--(2*i,6)--cycle, mediumgray);
    4 KB (709 words) - 01:50, 10 January 2022
  • == Problem == The number <math> \sqrt{104\sqrt{6}+468\sqrt{10}+144\sqrt{15}+2006}</math> can be written as <math> a\sqrt{2}+
    3 KB (439 words) - 18:24, 10 March 2015
  • ==Problem 1== [[2021 JMC 10 Problems/Problem 1|Solution]]
    12 KB (1,784 words) - 16:49, 1 April 2021
  • == Problem 1 == [[2006 AMC 12B Problems/Problem 1|Solution]]
    13 KB (2,058 words) - 12: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) - 21: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) - 17: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) - 21: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) - 21:30, 6 October 2014
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2005 AMC 12B Problems/Problem 1|Problem 1]]
    2 KB (206 words) - 23:23, 21 June 2021
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2000 AMC 12 Problems/Problem 1]]
    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/Problem 1]]
    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/Problem 1]]
    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. * [[2003 AMC 12A Problems/Problem 1]]
    1 KB (162 words) - 21:52, 6 October 2014
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2002 AMC 12B Problems/Problem 1]]
    1 KB (154 words) - 00:32, 7 October 2014
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2003 AMC 12B Problems/Problem 1]]
    1 KB (160 words) - 20:46, 1 February 2016
  • == Problem 1 == [[2006 AMC 12A Problems/Problem 1|Solution]]
    15 KB (2,223 words) - 13:43, 28 December 2020
  • == Problem 1 == [[2005 AMC 12A Problems/Problem 1|Solution]]
    13 KB (1,971 words) - 13:03, 19 February 2020
  • == Problem 1 == [[2004 AMC 12A Problems/Problem 1|Solution]]
    13 KB (1,953 words) - 00:31, 26 January 2023
  • == Problem 1 == [[2003 AMC 12A Problems/Problem 1|Solution]]
    13 KB (1,955 words) - 21:06, 19 August 2023
  • == Problem 1 == <math>(2x+3)(x-4)+(2x+3)(x-6)=0 </math>
    12 KB (1,792 words) - 13:06, 19 February 2020
  • == Problem 1 == [[2000 AMC 12 Problems/Problem 1|Solution]]
    13 KB (1,948 words) - 12:26, 1 April 2022
  • == Problem 1 == ...3\qquad \text{(B)}\ 3S + 2\qquad \text{(C)}\ 3S + 6 \qquad\text{(D)} 2S + 6 \qquad \text{(E)}\ 2S + 12</math>
    13 KB (1,957 words) - 12:53, 24 January 2024
  • == Problem 1 == \qquad\mathrm{(D)}\ 6
    10 KB (1,547 words) - 04:20, 9 October 2022
  • == Problem 1 == <cmath>\frac{2-4+6-8+10-12+14}{3-6+9-12+15-18+21}?</cmath>
    13 KB (1,987 words) - 18:53, 10 December 2022
  • == Problem 1 == <math>(\mathrm {A}) 3\qquad (\mathrm {B}) 6 \qquad (\mathrm {C}) 9 \qquad (\mathrm {D}) 12 \qquad (\mathrm {E}) 15</mat
    13 KB (2,049 words) - 13:03, 19 February 2020
  • == Problem 1 == [[2005 AMC 12B Problems/Problem 1|Solution]]
    12 KB (1,781 words) - 12:38, 14 July 2022
  • == Problem == {{AMC12 box|year=2006|ab=B|num-b=4|num-a=6}}
    654 bytes (115 words) - 21:47, 1 August 2020
  • == Problem == {{AMC12 box|year=2006|ab=B|num-b=6|num-a=8}}
    1 KB (213 words) - 15:33, 9 April 2024
  • == Problem== ...and for each choice there is one acceptable order. Similarly, for <math>c=6</math> and <math>c=8</math> there are, respectively, <math>\binom{5}{2}=10<
    3 KB (409 words) - 17:10, 30 April 2024
  • == Problem == Joe has 2 ounces of cream, as stated in the problem.
    927 bytes (137 words) - 10:45, 4 July 2013
  • == Problem == ...qrt {3} \qquad \textrm{(C) } 8 \qquad \textrm{(D) } 9 \qquad \textrm{(E) } 6\sqrt {3}</math>
    3 KB (447 words) - 03:49, 16 January 2021
  • == Problem == // from amc10 problem series
    3 KB (458 words) - 16:40, 6 October 2019
  • == Problem == ...n is <math>\frac{5\sqrt{2}}{2}\cdot\frac{1}{\sqrt{3}}\cdot2 = \frac{5\sqrt{6}}{3}</math>.
    1 KB (203 words) - 16:36, 18 September 2023
  • == Problem == ...h>5</math> and <math>6</math> on each die are in the ratio <math>1:2:3:4:5:6</math>. What is the probability of rolling a total of <math>7</math> on the
    1 KB (188 words) - 22:10, 9 June 2016
  • == Problem == \mathrm{(A)}\ 4\qquad\mathrm{(B)}\ 5\qquad\mathrm{(C)}\ 6\qquad\mathrm{(D)}\ 7\qquad\mathrm{(E)}\ 8
    4 KB (696 words) - 09:47, 10 August 2015
  • == Problem == \mathrm{(D)}\ 6\sqrt {2006}
    2 KB (339 words) - 13:15, 12 July 2015
  • == Problem == ...ABC</math>, such that <math>PA=11</math>, <math>PB=7</math>, and <math>PC=6</math>. Legs <math>\overline{AC}</math> and <math>\overline{BC}</math> have
    7 KB (1,169 words) - 14:04, 10 June 2022
  • == Problem == \mathrm{(C)}\ \dfrac{\pi^2}{6}
    3 KB (563 words) - 22:45, 24 October 2021
  • #REDIRECT [[2006 AMC 12A Problems/Problem 6]]
    45 bytes (5 words) - 14:43, 14 January 2016
  • ...ate|[[2006 AMC 12A Problems|2006 AMC 12A #10]] and [[2006 AMC 10A Problems/Problem 10|2006 AMC 10A #10]]}} == Problem ==
    1 KB (167 words) - 23:23, 16 December 2021
  • == Problem == <cmath>r_A + r_B + r_C = 6</cmath>
    1 KB (184 words) - 13:57, 19 January 2021
  • == Problem == ...{2}\qquad \mathrm{(D) \ } \frac{5\pi}{6} \quad \mathrm{(E) \ } \frac{7\pi}{6}</math>
    919 bytes (138 words) - 12:45, 4 August 2017
  • == Problem == ...-axis. The equation of <math>L_1</math> is <math>y=\frac{5}{12}x+\frac{19}{6}</math>, so the coordinate of this point is <math>\left(-\frac{38}{5},0\rig
    2 KB (253 words) - 22:52, 29 December 2021
  • ...ate|[[2006 AMC 12A Problems|2006 AMC 12A #20]] and [[2006 AMC 10A Problems/Problem 25|2006 AMC 10A #25]]}} == Problem ==
    5 KB (908 words) - 19:23, 22 September 2022
  • == Problem == ...rt{6}+\sqrt{3}\qquad \rm{(D) \ } 3\sqrt{2}+\sqrt{6}\qquad \mathrm{(E) \ } 6\sqrt{2}-\sqrt{3}</math>
    2 KB (343 words) - 15:39, 14 June 2023
  • == Problem == ...ill actually give an [[octahedron]], not a cube, because it only has <math>6</math> vertices.
    4 KB (498 words) - 00:46, 4 August 2023
  • ==Problem== {{AMC10 box|year=2005|ab=B|num-b=4|num-a=6}}
    978 bytes (156 words) - 14:14, 14 December 2021
  • ...C 12B Problems|2005 AMC 12B #4]] and [[2005 AMC 10B Problems|2005 AMC 10B #6]]}} == Problem ==
    1 KB (197 words) - 14:16, 14 December 2021
  • == Problem == {{AMC12 box|year=2005|ab=B|num-b=4|num-a=6}}
    2 KB (223 words) - 14:30, 15 December 2021
  • {{duplicate|[[2005 AMC 12B Problems|2005 AMC 12B #6]] and [[2005 AMC 10B Problems|2005 AMC 10B #10]]}} == Problem ==
    2 KB (299 words) - 15:29, 5 July 2022
  • == Problem == \mathrm{(A)}\ 6 \qquad
    2 KB (357 words) - 20:15, 27 December 2020
  • == Problem == ...h>85</math>. The mean is <math>\dfrac{70\,(2)+80\,(5)+85\,(4)+90\,(3)+95\,(6)}{20}=\dfrac{1720}{20}=86</math>. The difference between the mean and media
    2 KB (280 words) - 15:35, 16 December 2021
  • == Problem == ...nties, so you have <math>6</math> bills left. <math>\dbinom{6}{2} = \dfrac{6\times5}{2\times1} = 15</math> ways. However, you counted the case when you
    4 KB (607 words) - 21:01, 20 May 2023
  • == Problem == Suppose that <math>4^{x_1}=5</math>, <math>5^{x_2}=6</math>, <math>6^{x_3}=7</math>, ... , <math>127^{x_{124}}=128</math>. What is <math>x_1x_2
    1 KB (203 words) - 19:57, 24 December 2020
  • == Problem == ...>, is tangent to the lines <math>y=x</math>, <math>y=-x</math> and <math>y=6</math>. What is the radius of this circle?
    2 KB (278 words) - 21:12, 24 December 2020
  • == Problem == ...h> can have is <math>(1+2+3+4)=10</math>, and the greatest value is <math>(6+7+8+9)=30</math>. Therefore, <math>(e+f+g+h)</math> must equal <math>11</ma
    2 KB (411 words) - 21:02, 21 December 2020
  • == Problem == f.p=fontsize(6);
    2 KB (262 words) - 21:20, 21 December 2020
  • == Problem == ...h>. Now we have <math>(a+b)+(a-b)=11+1</math>, <math>2a=12</math>, <math>a=6</math>, then <math>b=5</math>, <math>x=65</math>, <math>y=56</math>, <math>
    2 KB (283 words) - 20:02, 24 December 2020
  • == Problem == ...and <math>h</math> be distinct elements in the set <math>\{-7,-5,-3,-2,2,4,6,13\}.</math>
    3 KB (463 words) - 19:28, 6 November 2022
  • == Problem == Our sum is simply <math>2 - 2\cdot\frac{8}{11} = \frac{6}{11}</math>, and thus we can divide by <math>2</math> to obtain <math>\frac
    4 KB (761 words) - 09:10, 1 August 2023
  • == Problem == We approach this problem by counting the number of ways ants can do their desired migration, and the
    10 KB (1,840 words) - 21:35, 7 September 2023
  • == Problem == Applying the Power of a Point Theorem gives <math> 6\cdot x = 4\cdot 1 </math>, so <math> x = \frac 23 </math>
    289 bytes (45 words) - 13:14, 16 July 2017
  • ==Problem 1== [[2006 AMC 10A Problems/Problem 1|Solution]]
    13 KB (2,028 words) - 16:32, 22 March 2022
  • == Problem == <math>b=-6</math>
    2 KB (348 words) - 23:10, 16 December 2021
  • ...k contains the full set of test problems. The rest contain each individual problem and its solution. **[[2008 USAMO Problems/Problem 1]]
    471 bytes (52 words) - 21:46, 12 August 2014
  • == Problem == size(150); pathpen = linewidth(0.6); defaultpen(fontsize(10));
    3 KB (424 words) - 10:14, 17 December 2021
  • == Problem == ...}{6}</math>. The probability of winning is <math>\frac{1}{2}\cdot \frac{1}{6} =\frac{1}{12}</math>. If the game is to be fair, the amount paid, <math>5<
    1 KB (207 words) - 09:39, 25 July 2023
  • == Problem == draw((6,0){up}..{left}(0,6),blue);
    3 KB (532 words) - 17:49, 13 August 2023
  • == Problem == D((2*t,2)--(2*t,4)); D((2*t,5)--(2*t,6));
    5 KB (732 words) - 23:19, 19 September 2023
  • == Problem == So, there are <math>6 - 1 = 5</math> choices for the position of the letters.
    2 KB (254 words) - 14:39, 5 April 2024
  • == Problem == ...5</math> possible values in <math>\bmod{5}</math> and we are picking <math>6</math> numbers, by the [[Pigeonhole Principle]], two of the numbers must be
    1 KB (187 words) - 08:21, 17 March 2023
  • == Problem == ...gements for the non-<math>2</math> or <math>3</math> digits. We have <math>6 \cdot 56</math> = <math>336</math> arrangements for this case. We have <mat
    3 KB (525 words) - 20:25, 30 April 2024
  • == Problem == <math>\textbf{(A) } \frac{1}{8}\qquad\textbf{(B) } \frac{1}{6}\qquad\textbf{(C) } \frac{1}{4}\qquad\textbf{(D) } \frac{1}{3}\qquad\textbf
    2 KB (292 words) - 10:19, 19 December 2021
  • ...tiple indistinct elements, such as the following: <math>\{1,4,5,3,24,4,4,5,6,2\}</math> Such an entity is actually called a multiset. ...describe sets should be used with extreme caution. One way to avoid this problem is as follows: given a property <math>P</math>, choose a known set <math>T<
    11 KB (2,021 words) - 00:00, 17 July 2011
  • ...k contains the full set of test problems. The rest contain each individual problem and its solution. **[[2006 USAMO Problems/Problem 1]]
    467 bytes (51 words) - 09:25, 6 August 2014
  • === Problem 1 === [[2006 USAMO Problems/Problem 1 | Solution]]
    3 KB (520 words) - 09:24, 14 May 2021
  • ==Problem 1== [[1991 AJHSME Problems/Problem 1|Solution]]
    17 KB (2,246 words) - 13:37, 19 February 2020
  • #REDIRECT [[2006 AIME I Problems/Problem 6]]
    44 bytes (5 words) - 12:05, 28 June 2009
  • ==Problem== ...x digits <math>4,5,6,7,8,9</math> in one of the six boxes in this addition problem?
    1 KB (191 words) - 17:12, 29 October 2016
  • ==Problem== ...metric sequence to be <math>\{ g, gr, gr^2, \dots \}</math>. Rewriting the problem based on our new terminology, we want to find all positive integers <math>m
    4 KB (792 words) - 00:29, 13 April 2024
  • == Problem == ...The number of possible sets of 6 cards that can be drawn from the deck is 6 times the number of possible sets of 3 cards that can be drawn. Find <math>
    1 KB (239 words) - 11:54, 31 July 2023
  • == Problem == *Person 1: <math>\frac{9 \cdot 6 \cdot 3}{9 \cdot 8 \cdot 7} = \frac{9}{28}</math>
    4 KB (628 words) - 11:28, 14 April 2024
  • == Problem == ...d pair]]s <math> (a,b) </math> of [[integer]]s such that <math> \log_a b + 6\log_b a=5, 2 \leq a \leq 2005, </math> and <math> 2 \leq b \leq 2005. </mat
    3 KB (547 words) - 19:15, 4 April 2024
  • == Problem == ...xample, eight cards form a magical stack because cards number 3 and number 6 retain their original positions. Find the number of cards in the magical st
    2 KB (384 words) - 00:31, 26 July 2018
  • == Problem 1 == ...The number of possible sets of 6 cards that can be drawn from the deck is 6 times the number of possible sets of 3 cards that can be drawn. Find <math>
    7 KB (1,119 words) - 21:12, 28 February 2020
  • == Problem == <cmath>(y^{12}+y^8+y^4+1)(y^2+1)=(y^{14}+y^{12}+y^{10}+y^8+y^6+y^4+y^2+1)</cmath>
    2 KB (279 words) - 12:33, 27 October 2019
  • == Problem == ..._3O_3'</math> is similar to <math>O_1O_2O_2'</math> so <math>O_3O_3'=\frac{6}{14} \cdot 10=\frac{30}{7}</math>. From rectangles, <math>O_3'T=O_1T_1=4</m
    4 KB (693 words) - 13:03, 28 December 2021
  • == Problem == This problem begs us to use the familiar identity <math>e^{it} = \cos(t) + i \sin(t)</ma
    6 KB (1,154 words) - 03:30, 11 January 2024
  • == Problem == ...e(10)); pair A=(0,9), B=(9,9), C=(9,0), D=(0,0), E=(2.5-0.5*sqrt(7),9), F=(6.5-0.5*sqrt(7),9), G=(4.5,9), O=(4.5,4.5); draw(A--B--C--D--A);draw(E--O--F)
    13 KB (2,080 words) - 21:20, 11 December 2022
  • #REDIRECT [[2006 AMC 12A Problems/Problem 6]]
    45 bytes (5 words) - 10:59, 20 February 2016
  • #REDIRECT [[2006 AMC 12A Problems/Problem 6]]
    45 bytes (5 words) - 11:01, 20 February 2016
  • ...cate|[[2006 AMC 12A Problems|2006 AMC 12A #4]] and [[2006 AMC 10A Problems/Problem 4|2006 AMC 10A #4]]}} == Problem ==
    2 KB (257 words) - 11:20, 2 January 2022
  • == Problem 1 == [[2005 AIME I Problems/Problem 1|Solution]]
    6 KB (983 words) - 05:06, 20 February 2019
  • == Problem == [[Image:2005 AIME I Problem 1.png]]
    1 KB (213 words) - 13:17, 22 July 2017
  • == Problem == ...th>(6,334)</math>, <math>(12,167)</math>, <math>(167,12)</math>,<math>(334,6)</math>, <math>(501,4)</math>, <math>(668,3)</math>, <math>(1002,2)</math>
    2 KB (303 words) - 01:31, 5 December 2022
  • == Problem == ==Solution 6 (NO ALGEBRA)==
    8 KB (1,248 words) - 11:43, 16 August 2022
  • == Problem == There are two separate parts to this problem: one is the color (gold vs silver), and the other is the orientation.
    5 KB (830 words) - 01:51, 1 March 2023
  • == Problem == ==Solution 6 (De Moivre's Theorem)==
    4 KB (686 words) - 01:55, 5 December 2022
  • == Problem == draw((5,8.66)--(16.87,6.928));
    4 KB (567 words) - 20:20, 3 March 2020
  • == Problem == ...ns, so from these cubes we gain a factor of <math>\left(\frac{2}{3}\right)^6</math>.
    4 KB (600 words) - 21:44, 20 November 2023
  • == Problem == ...d <math> n. </math> For example, <math> \tau (1)=1 </math> and <math> \tau(6) =4. </math> Define <math> S(n) </math> by <math> S(n)=\tau(1)+ \tau(2) + \
    4 KB (647 words) - 02:29, 4 May 2021
  • == Problem == ...>R</math> and <math>U</math> stay together, then there are <math>3 \cdot 2=6</math> ways.
    5 KB (897 words) - 00:21, 29 July 2022
  • == Problem == ...n from the second gives <cmath>20a=240-40x\rightarrow a=12-2x\rightarrow x=6-\frac a2</cmath>
    12 KB (2,000 words) - 13:17, 28 December 2020
  • == Problem == ...> Point <math> D </math> is on <math> \overline{BC} </math> with <math> CD=6. </math> Point <math> E </math> is on <math> \overline{BC} </math> such tha
    13 KB (2,129 words) - 18:56, 1 January 2024
  • == Problem == We approach the problem by [[recursion]]. We [[partition]] the positive integers into the sets
    9 KB (1,491 words) - 01:23, 26 December 2022
  • == Problem == real x = 20 - ((750)^.5)/3, CE = 8*(6^.5) - 4*(5^.5), CD = 8*(6^.5), h = 4*CE/CD;
    4 KB (729 words) - 01:00, 27 November 2022
  • == Problem == ...19}+ \frac3{19}+ \frac 1{17}+ \frac2{17}= \frac6{19} + \frac 3{17} = \frac{6\cdot17 + 3\cdot19}{17\cdot19} = \frac{159}{323}</math> and so the answer is
    2 KB (298 words) - 20:02, 4 July 2013
  • == Problem == ...left(\frac{\frac{4}{5}}{1-\frac{1}{25}}\right)= \frac{2}{3} \cdot \frac{5}{6} = \frac{5}{9},</cmath> and the answer is <math>m+n = 5 + 9 = \boxed{014}</
    2 KB (303 words) - 22:28, 11 September 2020
  • == Problem == ...th>r_{ABC} = \frac{[ABC]}{s_{ABC}} = \frac{15 \cdot 36 /2}{(15+36+39)/2} = 6</math>. Thus <math>r_{A'B'C'} = r_{ABC} - 1 = 5</math>, and since the ratio
    5 KB (836 words) - 07:53, 15 October 2023
  • == Problem == ...th> be a [[triangle]] with sides 3, 4, and 5, and <math> DEFG </math> be a 6-by-7 [[rectangle]]. A segment is drawn to divide triangle <math> ABC </math
    4 KB (618 words) - 20:01, 4 July 2013
  • == Problem == ...n + 1) + n = 3210 + 1111n</math>, for <math>n \in \lbrace0, 1, 2, 3, 4, 5, 6\rbrace</math>.
    2 KB (374 words) - 14:53, 27 December 2019
  • == Problem == The thing about this problem is, you have some "choices" that you can make freely when you get to a cert
    8 KB (1,437 words) - 21:53, 19 May 2023
  • == Problem == Alpha and Beta both took part in a two-day problem-solving competition. At the end of the second day, each had attempted quest
    3 KB (436 words) - 18:31, 9 January 2024
  • == Problem == ...\le i \neq j}^{15} S_iS_j\right)\\ (-8)^2 &= \frac{15(15+1)(2\cdot 15+1)}{6} + 2C\end{align*}</cmath>
    5 KB (833 words) - 19:43, 1 October 2023
  • == 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
  • == Problem 1 == [[2004 AIME I Problems/Problem 1|Solution]]
    9 KB (1,434 words) - 13:34, 29 December 2021
  • == 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
  • == 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) - 21:55, 19 June 2023
  • == 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
  • == 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
  • == 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
  • == 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
  • == 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
  • ==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
  • == Problem 1 == [[2004 AIME II Problems/Problem 1|Solution]]
    9 KB (1,410 words) - 05:05, 20 February 2019
  • ...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
  • ...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
  • ...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
  • ...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
  • ...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
  • ...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
  • ...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
  • ...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
  • ...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
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1983 AIME Problems/Problem 1|Problem 1]]
    1 KB (114 words) - 20:35, 31 October 2020
  • == Problem 1 == [[1983 AIME Problems/Problem 1|Solution]]
    7 KB (1,104 words) - 12:53, 6 July 2022
  • ==Problem== This problem is essentially asking how many ways there are to choose <math>2</math> dist
    5 KB (830 words) - 22:15, 28 December 2023
  • == Problem 1 == [[1984 AIME Problems/Problem 1|Solution]]
    6 KB (933 words) - 01:15, 19 June 2022
  • == Problem 1 == [[1986 AIME Problems/Problem 1|Solution]]
    5 KB (847 words) - 15:48, 21 August 2023
  • == Problem 1 == [[1987 AIME Problems/Problem 1|Solution]]
    6 KB (869 words) - 15:34, 22 August 2023
  • == Problem 1 == ...r -- the correct five buttons. The sample shown below has <math>\{1, 2, 3, 6, 9\}</math> as its combination. Suppose that these locks are redesigned so
    6 KB (902 words) - 08:57, 19 June 2021
  • == Problem 1 == [[1989 AIME Problems/Problem 1|Solution]]
    7 KB (1,045 words) - 20:47, 14 December 2023
  • == Problem 1 == The [[increasing sequence]] <math>2,3,5,6,7,10,11,\ldots</math> consists of all [[positive integer]]s that are neithe
    6 KB (870 words) - 10:14, 19 June 2021
  • == Problem 1 == [[1991 AIME Problems/Problem 1|Solution]]
    7 KB (1,106 words) - 22:05, 7 June 2021
  • == Problem 1 == [[1992 AIME Problems/Problem 1|Solution]]
    8 KB (1,117 words) - 05:32, 11 November 2023
  • == Problem 1 == [[1993 AIME Problems/Problem 1|Solution]]
    8 KB (1,275 words) - 06:55, 2 September 2021
  • == Problem 1 == [[1994 AIME Problems/Problem 1|Solution]]
    7 KB (1,141 words) - 07:37, 7 September 2018
  • == Problem 1 == [[Image:AIME 1995 Problem 1.png]]
    6 KB (1,000 words) - 00:25, 27 March 2024
  • == Problem 1 == [[1996 AIME Problems/Problem 1|Solution]]
    6 KB (931 words) - 17:49, 21 December 2018
  • == Problem 1 == [[1997 AIME Problems/Problem 1|Solution]]
    7 KB (1,098 words) - 17:08, 25 June 2020
  • == Problem 1 == ...{12}</math> the [[least common multiple]] of the positive integers <math>6^6</math> and <math>8^8</math>, and <math>k</math>?
    7 KB (1,084 words) - 02:01, 28 November 2023
  • == Problem 1 == [[1999 AIME Problems/Problem 1|Solution]]
    7 KB (1,094 words) - 13:39, 16 August 2020
  • == Problem 1 == [[2000 AIME I Problems/Problem 1|Solution]]
    7 KB (1,204 words) - 03:40, 4 January 2023
  • == Problem 1 == [[2001 AIME I Problems/Problem 1|Solution]]
    7 KB (1,212 words) - 22:16, 17 December 2023
  • == Problem 1 == [[2002 AIME I Problems/Problem 1|Solution]]
    8 KB (1,374 words) - 21:09, 27 July 2023
  • == Problem 1 == [[2003 AIME I Problems/Problem 1|Solution]]
    6 KB (965 words) - 16:36, 8 September 2019
  • == Problem 1 == <center><math>\frac 2{\log_4{2000^6}} + \frac 3{\log_5{2000^6}}</math></center>
    6 KB (947 words) - 21:11, 19 February 2019
  • == Problem 1 == [[2001 AIME II Problems/Problem 1|Solution]]
    8 KB (1,282 words) - 21:12, 19 February 2019
  • == Problem 1 == [[2002 AIME II Problems/Problem 1|Solution]]
    7 KB (1,177 words) - 15:42, 11 August 2023
  • == Problem 1 == The product <math>N</math> of three positive integers is 6 times their sum, and one of the integers is the sum of the other two. Find
    7 KB (1,127 words) - 09:02, 11 July 2023
  • == Problem == == Solution 6 ==
    4 KB (642 words) - 03:14, 17 August 2022
  • == Problem == ...non-negative (and moreover, plugging in <math>y=-6</math>, we get <math>-6=6</math>, which is obviously false). Hence we have <math>y=10</math> as the o
    3 KB (532 words) - 05:18, 21 July 2022
  • ==Problem== ...ircle is <math>\sqrt{50}</math> cm, the length of <math>AB</math> is <math>6</math> cm and that of <math>BC</math> is <math>2</math> cm. The angle <math
    11 KB (1,741 words) - 22:40, 23 November 2023
  • == Problem == One way to solve this problem is by [[substitution]]. We have
    4 KB (672 words) - 10:17, 17 March 2023
  • == Problem == Let <math>a_n=6^{n}+8^{n}</math>. Determine the remainder upon dividing <math>a_ {83}</math
    3 KB (361 words) - 20:20, 14 January 2023
  • == Problem == ...in which the trio sits together (as a single entity). There are <math>3! = 6</math> ways to determine their order, and there are <math>(23-1)! = 22!</ma
    9 KB (1,392 words) - 20:37, 19 January 2024
  • == Problem == There are <math>6</math> possible sequences.
    5 KB (855 words) - 20:26, 14 January 2023
  • == Problem == ...>2s</math>. All other edges have length <math>s</math>. Given that <math>s=6\sqrt{2}</math>, what is the volume of the solid?
    5 KB (865 words) - 21:11, 6 February 2023
  • == Problem == draw((-2.6,0)--(-2.6,0.6));
    2 KB (412 words) - 18:23, 1 January 2024
  • == Problem == ...example, the alternating sum for <math>\{1, 2, 3, 6,9\}</math> is <math>9-6+3-2+1=5</math> and for <math>\{5\}</math> it is simply <math>5</math>. Find
    5 KB (894 words) - 22:02, 5 April 2024
  • == Problem == In the adjoining figure, two circles with radii <math>8</math> and <math>6</math> are drawn with their centers <math>12</math> units apart. At <math>P
    13 KB (2,149 words) - 18:44, 5 February 2024
  • == Problem == ...h>. Suppose that the radius of the circle is <math>5</math>, that <math>BC=6</math>, and that <math>AD</math> is bisected by <math>BC</math>. Suppose fu
    19 KB (3,221 words) - 01:05, 7 February 2023
  • == Problem == D(A--B--C--cycle); D(A+(B-A)*3/4--A+(C-A)*3/4); D(B+(C-B)*5/6--B+(A-B)*5/6);D(C+(B-C)*5/12--C+(A-C)*5/12);
    4 KB (726 words) - 13:39, 13 August 2023
  • == Problem == == Solution 6 ==
    5 KB (782 words) - 14:49, 1 August 2023
  • == Problem == [[Image:1984_AIME-6.png]]
    6 KB (1,022 words) - 19:29, 22 January 2024
  • == Problem == Open up a coding IDE and use recursion to do this problem. The idea is to define a function (I called it <math>f</math>, you can call
    4 KB (617 words) - 18:01, 9 March 2022
  • == Problem == The equation <math>z^6+z^3+1=0</math> has complex roots with argument <math>\theta</math> between
    3 KB (430 words) - 19:05, 7 February 2023
  • == Problem == draw(surface(A--B--C--cycle),rgb(0.6,0.7,0.6),nolight);
    6 KB (947 words) - 20:44, 26 November 2021
  • == Problem == ...>s, we are placing the extra <math>3</math> <math>n</math>s into the <math>6</math> intervals beside the <math>b</math>s.
    7 KB (1,115 words) - 00:52, 7 September 2023
  • == Problem == ...either <math>0 \bmod{6}</math>, <math>2 \bmod{6}</math>, or <math>4 \bmod{6}</math>. Notice that the numbers <math>9</math>, <math>15</math>, <math>21<
    8 KB (1,346 words) - 01:16, 9 January 2024
  • == Problem == ...math> \frac{x^2}{6^2-1}+\frac{y^2}{6^2-3^2}+\frac{z^2}{6^2-5^2}+\frac{w^2}{6^2-7^2}=1 </math><br /><math> \frac{x^2}{8^2-1}+\frac{y^2}{8^2-3^2}+\frac{z^
    6 KB (1,051 words) - 04:52, 8 May 2024
  • == Problem == === Solution 6 ===
    6 KB (1,122 words) - 12:23, 6 January 2022
  • == Problem == [[Image:AIME 1985 Problem 15.png]]
    2 KB (245 words) - 22:44, 4 March 2024
  • == Problem == ...0 = n^2 + 19n + 90</math> and <math>n^2 -21n + 90 = 0</math> and <math>n = 6</math> or <math>n = 15</math>. Now, note that the top <math>n</math> playe
    5 KB (772 words) - 22:14, 18 June 2020
  • == Problem == <cmath>\begin{alignat*}{6}
    17 KB (2,837 words) - 13:34, 4 April 2024
  • == Problem == ...mum we can get is <math>1+2+3 = 6</math>, so we only need to try the first 6 numbers.
    12 KB (1,859 words) - 18:16, 28 March 2022
  • == Problem == {{AIME box|year=1985|num-b=6|num-a=8}}
    1 KB (222 words) - 11:04, 4 November 2022
  • == Problem == ...r this point it must continue to repeat. Thus, in particular <math>a_{j + 6} = a_j</math> for all <math>j</math>, and so repeating this <math>n</math>
    2 KB (410 words) - 13:37, 1 May 2022
  • == Problem == ...> (since we know <math>a</math> is positive). Thus <math>c = 6^3 - 3\cdot 6 = \boxed{198}</math>.
    1 KB (205 words) - 18:58, 10 March 2024
  • == Problem == f.p=fontsize(6);
    11 KB (1,722 words) - 09:49, 13 September 2023
  • == Problem == ...th>\dbinom{6}{0} + \dbinom{6}{1} + \dbinom{6}{2} + \dbinom{6}{3} + \dbinom{6}{4}=57</math> of its subsets have at most four elements (the number of subs
    2 KB (364 words) - 19:41, 1 September 2020
  • == Problem == ...first 16 triangular numbers, which evaluates to <math>\frac{(16)(17)(18)}{6} = \boxed{816}</math>.
    6 KB (872 words) - 16:51, 9 June 2023
  • == Problem == pathpen = black; pointpen = black +linewidth(0.6); pen s = fontsize(10);
    11 KB (1,850 words) - 18:07, 11 October 2023
  • == Problem == ...ctorization]] of <math>1000000 = 2^65^6</math>, so there are <math>(6 + 1)(6 + 1) = 49</math> divisors, of which <math>48</math> are proper. The sum of
    3 KB (487 words) - 20:52, 16 September 2020
  • == Problem == ...owever, we must change it back to base 10 for the answer, which is <math>3^6 + 3^5 + 3^2 = 729 + 243 + 9 = \boxed {981}</math>.
    5 KB (866 words) - 00:00, 22 December 2022
  • == Problem == The key to this problem is to realize that <math>n+10 \mid n^3 +1000</math> for all <math>n</math>.
    2 KB (338 words) - 19:56, 15 October 2023
  • == Problem == <center><math>2x_1+x_2+x_3+x_4+x_5=6</math></center>
    1 KB (212 words) - 16:25, 17 November 2019
  • == Problem == ...tan x \cdot \tan y = \frac{\tan x + \tan y}{30} = \frac{25}{30} = \frac{5}{6}</math>
    3 KB (545 words) - 23:44, 12 October 2023
  • == Problem == ...sqrt{7}\right)\left(\sqrt{5}-\sqrt{6}+\sqrt{7}\right)\left(-\sqrt{5}+\sqrt{6}+\sqrt{7}\right).</cmath>
    3 KB (460 words) - 00:44, 5 February 2022
  • == Problem == &= (x(x-6) + 18)(x(x+6)+18),
    7 KB (965 words) - 10:42, 12 April 2024
  • == Problem == ...that <math>(n + \frac{1}{1000})^3 = n^3 + \frac{3}{10^3} n^2 + \frac{3}{10^6} n + \frac{1}{10^9}</math>. For a given value of <math>n</math>, if <math>(
    4 KB (673 words) - 19:48, 28 December 2023
  • == Problem == ...or large factors of <math>2\cdot 3^{11}</math> which are less than <math>3^6</math>. The largest such factor is clearly <math>2\cdot 3^5 = 486</math>;
    3 KB (418 words) - 18:30, 20 January 2024
  • == Problem == ...ains a [[point]] <math>P</math> for which <math>PA = 10</math>, <math>PB = 6</math>, and <math>\angle APB = \angle BPC = \angle CPA</math>. Find <math>
    1 KB (200 words) - 18:44, 5 February 2024
  • == Problem == Since <math>91n - 104k < n + k</math>, <math>k > \frac{6}{7}n</math>. Also, <math>0 < 91n - 104k</math>, so <math>k < \frac{7n}{8}</
    2 KB (393 words) - 16:59, 16 December 2020
  • == Problem == {{AIME box|year=1987|num-b=6|num-a=8}}
    3 KB (547 words) - 22:54, 4 April 2016
  • == Problem == {{AIME box|year=1987|num-b=4|num-a=6}}
    1 KB (160 words) - 04:44, 21 January 2023
  • == Problem == Thus, listing out the first ten numbers to fit this form, <math>2 \cdot 3 = 6,\ 2^3 = 8,\ 2 \cdot 5 = 10,</math> <math>\ 2 \cdot 7 = 14,\ 3 \cdot 5 = 15,
    3 KB (511 words) - 09:29, 9 January 2023
  • == Problem == ...ring the day, and the boss delivers them in the order <math>1, 2, 3, 4, 5, 6, 7, 8, 9</math>.
    7 KB (1,186 words) - 10:16, 4 June 2023
  • == Problem == ...+ 1</math> into the polynomial with a higher degree, as shown in Solution 6.
    10 KB (1,585 words) - 03:58, 1 May 2023
  • == Problem == ...[[face]]s 12 [[square]]s, 8 [[regular polygon|regular]] [[hexagon]]s, and 6 regular [[octagon]]s. At each [[vertex]] of the polyhedron one square, one
    5 KB (811 words) - 19:10, 25 January 2021
  • == Problem == ...this in to <math>5a^2 + 12a \equiv 1 \pmod{25}</math> gives <math>10a_1 + 6 \equiv 1 \pmod{25}</math>. Obviously, <math>a_1 \equiv 2 \pmod 5</math>, so
    6 KB (893 words) - 08:15, 2 February 2023
  • == Problem == ...8}{24} \cdot \frac{24}{10} \cdot \frac{14}{4} \cdot \frac{10}{6} \cdot f(4,6)\\
    4 KB (538 words) - 13:24, 12 October 2021
  • == Problem == {{AIME box|year=1988|num-b=6|num-a=8}}
    1 KB (178 words) - 23:25, 20 November 2023
  • == Problem == [[Image:1988_AIME-6.png]]
    5 KB (878 words) - 23:06, 20 November 2023
  • == Problem == {{AIME box|year=1988|num-b=4|num-a=6}}
    822 bytes (108 words) - 22:21, 6 November 2016
  • == Problem == ...rder -- the correct five buttons. The sample shown below has <math>\{1,2,3,6,9\}</math> as its [[combination]]. Suppose that these locks are redesigned
    1 KB (181 words) - 18:23, 26 August 2019
  • == Problem == ...e figure below). Given that <math>AP=6</math>, <math>BP=9</math>, <math>PD=6</math>, <math>PE=3</math>, and <math>CF=20</math>, find the area of <math>\
    13 KB (2,091 words) - 00:20, 26 October 2023
  • == Problem == ...pairs: <math>[2,9]</math>, <math>[3,7]</math>, <math>[4,11]</math>, <math>[6,10]</math>. Now, <math>1989 = 180\cdot 11 + 9</math>. Because this isn't an
    2 KB (274 words) - 04:07, 17 December 2023
  • == Problem == === Solution 6===
    8 KB (1,401 words) - 21:41, 20 January 2024
  • == Problem == &>1.6\cdot1.6\cdot1.3 \\
    6 KB (874 words) - 15:50, 20 January 2024
  • == Problem == ...math>f(k)=k^2x_1+(k+1)^2x_2+(k+2)^2x_3+(k+3)^2x_4+(k+4)^2x_5+(k+5)^2x_6+(k+6)^2x_7</cmath> for some <math>k\in\{1,2,3\}.</math>
    8 KB (1,146 words) - 04:15, 20 November 2023
  • == Problem == {{AIME box|year=1989|num-b=6|num-a=8}}
    2 KB (239 words) - 16:09, 2 June 2023
  • == Problem == pair A=(0,0),B=(10,0),C=6*expi(pi/3);
    5 KB (864 words) - 19:55, 2 July 2023
  • == Problem == ...g a heads in one flip of the biased coin as <math>h</math>. Based upon the problem, note that <math>{5\choose1}(h)^1(1-h)^4 = {5\choose2}(h)^2(1-h)^3</math>.
    2 KB (258 words) - 00:07, 25 June 2023
  • == Problem == ...> in which plugging into the other expression we know <math>3(25k^3 - 2) + 6 = 75k^3</math> is a perfect square. We know <math>75 = 5^2 \cdot 3</math> s
    3 KB (552 words) - 12:41, 3 March 2024
  • == Problem == ...28)+1=755161.</math> Since the alternating sum of the digits <math>7-5+5-1+6-1=11</math> is divisible by <math>11,</math> we conclude that <math>755161<
    4 KB (523 words) - 00:12, 8 October 2021
  • == Problem == pair D=origin, A=(13,0), B=(13,12), C=(0,12), P=(6.5, 6);
    7 KB (1,086 words) - 08:16, 29 July 2023
  • == Problem == ...gon can be written in the form <math>a + b \sqrt{2} + c \sqrt{3} + d \sqrt{6},</math> where <math>a^{}_{}</math>, <math>b^{}_{}</math>, <math>c^{}_{}</m
    6 KB (906 words) - 13:23, 5 September 2021
  • == Problem == Someone observed that <math>6! = 8 \cdot 9 \cdot 10</math>. Find the largest [[positive]] [[integer]] <m
    3 KB (519 words) - 09:28, 28 June 2022
  • == Problem == ...^{16}, \ldots n^{144}\}</math> and of set <math>B</math> as <math>\{n^3, n^6, \ldots n^{144}\}</math>. <math>n^x</math> can yield at most <math>144</mat
    3 KB (564 words) - 04:47, 4 August 2023
  • == Problem == ...pattern, we find that there are <math>\sum_{i=6}^{11} {i\choose{11-i}} = {6\choose5} + {7\choose4} + {8\choose3} + {9\choose2} + {{10}\choose1} + {{11}
    3 KB (425 words) - 12:36, 12 May 2024
  • == Problem == <!-- replaced: Image:1990 AIME Problem 7.png by I_like_pie -->
    8 KB (1,319 words) - 11:34, 22 November 2023
  • == Problem == {{AIME box|year=1990|num-b=4|num-a=6}}
    1 KB (175 words) - 03:45, 21 January 2023
  • == Problem == Find the value of <math>(52+6\sqrt{43})^{3/2}-(52-6\sqrt{43})^{3/2}</math>.
    5 KB (765 words) - 23:00, 26 August 2023
  • == Problem == The [[increasing sequence]] <math>2,3,5,6,7,10,11,\ldots</math> consists of all [[positive integer]]s that are neithe
    2 KB (283 words) - 23:11, 25 June 2023
  • == Problem == <math> \textbf{(A) } 2\qquad \textbf{(B) } 3\qquad \textbf{(C) } 6\qquad \textbf{(D) } 8\qquad \textbf{(E) } 9 </math>
    1 KB (172 words) - 10:47, 19 December 2021
  • == Problem == {{AMC10 box|year=2006|ab=B|num-b=4|num-a=6}}
    1 KB (242 words) - 18:35, 15 August 2023
  • == Problem == {{AMC10 box|year=2006|ab=B|num-b=6|num-a=8}}
    1 KB (179 words) - 10:33, 19 August 2022
  • == Problem == ...bf{(A) } 1\qquad \textbf{(B) } 3\qquad \textbf{(C) } 4\qquad \textbf{(D) } 6\qquad \textbf{(E) } 9 </math>
    1 KB (170 words) - 14:00, 26 January 2022
  • == Problem == ...f{(C) }1 \qquad \textbf{(D) \ } \frac{14}{13}\qquad \textbf{(E) } \frac{7}{6} </math>
    1 KB (182 words) - 14:11, 26 January 2022
  • == Problem == ...inds that <math>n=44</math> is the largest possible integer satisfying the problem conditions.
    7 KB (1,328 words) - 20:24, 5 February 2024
  • == Problem == ...4\sqrt{3}\qquad \textbf{(C) } 8\qquad \textbf{(D) } 9\qquad \textbf{(E) } 6\sqrt{3} </math>
    3 KB (445 words) - 22:01, 20 August 2022
  • == Problem == ...o more similar triangles, we find that point <math>E</math> is at <math>(9.6, 7.2)</math>.
    8 KB (1,270 words) - 23:36, 27 August 2023
  • == Problem == ...multiples of <math>4</math> (with a few exceptions that don't affect this problem).
    2 KB (336 words) - 10:51, 11 May 2024
  • == Problem == dot((cos(i*pi/6), sin(i*pi/6)));
    4 KB (740 words) - 19:33, 28 December 2022
  • ...k contains the full set of test problems. The rest contain each individual problem and its solution. ** [[2002 Pan African MO Problems/Problem 1]]
    581 bytes (73 words) - 13:47, 4 December 2019
  • == Problem == <math> \textbf{(A) } \frac{1}{10}\qquad \textbf{(B) } \frac{1}{6}\qquad \textbf{(C) } \frac{1}{5}\qquad \textbf{(D) } \frac{1}{3}\qquad \tex
    1 KB (211 words) - 04:32, 4 November 2022
  • == Problem == Note: The problem is much easier computed if we consider what <math>\sec (x)</math> is, then
    10 KB (1,590 words) - 14:04, 20 January 2023
  • == Problem == Clearly, the sequence repeats every 6 terms.
    1 KB (158 words) - 01:33, 29 May 2023
  • == Problem == ...ath>(\pm1,\pm144),( \pm 2, \pm 72),( \pm 3, \pm 48),( \pm 4, \pm 36),( \pm 6, \pm 24),( \pm 8, \pm 18),( \pm 9, \pm 16),( \pm 12, \pm 12)</math>; since
    2 KB (310 words) - 11:25, 13 June 2023
  • == Problem == {{AIME box|year=1991|num-b=6|num-a=8}}
    2 KB (285 words) - 05:15, 13 June 2022
  • == Problem == {{AIME box|year=1991|num-b=4|num-a=6}}
    919 bytes (141 words) - 20:00, 4 July 2022
  • == Problem == ...<math>-1 \le y \le 1</math>. It is [[periodic function|periodic]] (in this problem) with a period of <math>\frac{2}{5}</math>.
    2 KB (300 words) - 16:01, 26 November 2019
  • == Problem == ...st going to be equivalent to multiplying this fraction by <math>\frac{995}{6}</math>. Notice that this fraction's numerator plus denominator is equal to
    5 KB (865 words) - 12:13, 21 May 2020
  • == Problem == ...g this inequality may be found by Stars and Bars to be <math>\binom{7+6-1}{6-1} = \boxed{792}</math>.
    2 KB (443 words) - 22:41, 22 December 2021
  • == Problem == ...> is irrelevant as long as there still exists a circle as described in the problem.
    5 KB (874 words) - 10:27, 22 August 2021
  • == Problem == ...means <math>A</math> looks like <math>(a_1,a_1+k,a_1+2k+1,a_1+3k+3,a_1+4k+6,...)</math>. More specifically, <math>A_n=a_1+k(n-1)+\frac{(n-1)(n-2)}{2}</
    5 KB (778 words) - 21:36, 3 December 2022
  • == Problem == {{AIME box|year=1992|num-b=6|num-a=8}}
    800 bytes (114 words) - 17:40, 14 March 2017
  • == Problem == ...math>h+d\ge 10</math> or <math>c+g\ge 10</math> or <math>b+f\ge 10</math>. 6. Consider <math>c \in \{0, 1, 2, 3, 4\}</math>. <math>1abc + 1ab(c+1)</mat
    3 KB (455 words) - 02:03, 10 July 2021
  • == Problem == {{AIME box|year=1992|num-b=4|num-a=6}}
    2 KB (277 words) - 20:45, 4 March 2024
  • == Problem == \text{Row 4: } & & & 1 & & 4 & & 6 & & 4 & & 1 & & \\\vspace{4pt}
    3 KB (476 words) - 14:13, 20 April 2024
  • == Problem == ...math>1000n+3000>1006n+2012</math>, so <math>n<\frac{988}{6}=164 \dfrac {4}{6}=164 \dfrac{2}{3}</math>. Thus, the answer is <math>\boxed{164}</math>.
    2 KB (251 words) - 08:05, 2 January 2024
  • == Problem == ...ntial ascending numbers, one for each [[subset]] of <math>\{1, 2, 3, 4, 5, 6, 7, 8, 9\}</math>.
    2 KB (336 words) - 05:18, 4 November 2022
  • == Problem == \qquad \mathrm{(C) \ } \pi(2-\sqrt{3})\qquad \mathrm{(D) \ } \frac{\pi}{6}+\frac{\sqrt{3}+1}{2}\qquad \mathrm{(E) \ } \frac{\pi}{3}-1+\sqrt{3} </math
    5 KB (873 words) - 15:39, 29 May 2023
  • == Problem == In rectangle <math>ABCD</math>, we have <math>A=(6,-22)</math>, <math>B=(2006,178)</math>, <math>D=(8,y)</math>, for some inte
    4 KB (594 words) - 15:45, 30 July 2023
  • == Problem == ...5</math>, and <math>6</math>, on each die are in the ratio <math>1:2:3:4:5:6</math>. What is the probability of rolling a total of <math>7</math> on the
    3 KB (484 words) - 19:09, 15 October 2023
  • == Problem == label("$y$",(1.6,1));
    5 KB (861 words) - 00:53, 25 November 2023
  • == Problem == pair X=(-6,0), O=origin, P=(6,0), B=tangent(X, O, 2, 1), A=tangent(X, O, 2, 2), C=tangent(X, P, 4, 1), D=
    4 KB (558 words) - 14:38, 6 April 2024
  • == Problem == <math> \mathrm{(A) \ } 4\qquad \mathrm{(B) \ } 5\qquad \mathrm{(C) \ } 6\qquad \mathrm{(D) \ } 7\qquad \mathrm{(E) \ } 8 </math>
    5 KB (878 words) - 14:39, 3 December 2023
  • == Problem == ...es of the larger. Of all the rectangles that can be inscribed unstuck in a 6 by 8 rectangle, the smallest perimeter has the form <math>\sqrt{N}\,</math>
    3 KB (601 words) - 09:25, 19 November 2023
  • == Problem == n & 7 & 6 & 5 & 4 & 3 & 2 & 1 \\
    4 KB (611 words) - 13:59, 15 July 2023
  • == Problem == In order to begin this problem, we need to calculate the probability that Alfred will win on the first rou
    7 KB (1,058 words) - 20:57, 22 December 2020
  • == Problem == ...f <math>16</math>, <math>n \equiv 118 \pmod {125}</math> and <math>n\equiv 6 \pmod {16}</math>. The smallest <math>n</math> for this case is <math>118</
    3 KB (488 words) - 02:06, 22 September 2023
  • == Problem == ...th> elements of <math>S.</math> So our final answer is then <math>\frac {3^6 - 1}{2} + 1 = \boxed{365}.</math>
    9 KB (1,400 words) - 14:09, 12 January 2024
  • == Problem == There is a total of <math>P(1000,6)</math> possible ordered <math>6</math>-tuples <math>(a_1,a_2,a_3,b_1,b_2,b_3).</math>
    5 KB (772 words) - 09:04, 7 January 2022
  • == Problem == {{AIME box|year=1993|num-b=4|num-a=6}}
    2 KB (355 words) - 13:25, 31 December 2018
  • == Problem == ...s of <math>186</math>, which are <math>1 \cdot 186, 2\cdot 93, 3 \cdot 62, 6\cdot 31</math>. <math>(d-c)</math> and <math>(d+c-a-b)</math> must be facto
    8 KB (1,343 words) - 16:27, 19 December 2023
  • == Problem == :(b) those who caught <math>3</math> or more fish averaged <math>6</math> fish each;
    2 KB (364 words) - 00:05, 9 July 2022
  • == Problem == ...)^2}{2} - \sum_{i=0}^9 \frac{(4i+4)^2}{2}\right| = \left|\sum_{i=0}^9 -(8i+6) \right|.</cmath>
    2 KB (241 words) - 11:56, 13 March 2015
  • == Problem == The thousands digit is <math>\in \{4,5,6\}</math>.
    3 KB (440 words) - 21:20, 22 July 2021
  • == Problem == ...[circumcenter]]s of <math>\triangle PAB, PBC, PCA</math>. According to the problem statement, the circumcenters of the triangles cannot lie within the interio
    4 KB (717 words) - 22:20, 3 June 2021
  • == Problem == ...math>\frac{52}{24}n = \frac {13}6n</math> squares in every row. Then <math>6|n</math>, and our goal is to maximize the value of <math>n</math>.
    3 KB (473 words) - 17:06, 1 January 2024
  • == Problem == ...'s, <math>6</math>'s, and <math>15</math>'s. Because <math>0</math>, <math>6</math>, and <math>15</math> are all multiples of <math>3</math>, the change
    4 KB (645 words) - 15:12, 15 July 2019
  • == Problem == ...- DC^2 = (BC + DC)(BC - DC) = 29^6</math>. Trying out factors of <math>29^6</math>, we can either guess and check or just guess to find that <math>BC +
    3 KB (534 words) - 16:23, 26 August 2018
  • == Problem == ...math>P_k = \frac {3}{2k - 1}P_{k - 1}</math>. Iterating this for <math>k = 6,5,4,3,2</math> (obviously <math>P_1 = 1</math>), we get <math>\frac {3^5}{1
    3 KB (589 words) - 14:18, 21 July 2019
  • ==Problem== .../math> and our displacement is <math>\left[8\sqrt{3}, \frac{(a+b)\sqrt{3}}{6}\right]</math>. (Do you see why we switched <math>x</math> and <math>y</mat
    5 KB (788 words) - 13:53, 8 July 2023
  • == Problem == ...h>(p,q)</math> and <math>(-p,-q)</math>, for a total of <math>\frac{12}{2}=6</math> lines. Finally, we add the <math>12</math> unique tangent lines to t
    3 KB (442 words) - 19:51, 8 January 2024
  • == Problem == ...}\right)^2 = 100</math>. Thus, the total number of unit triangles is <math>6 \times 100 = 600</math>.
    4 KB (721 words) - 16:14, 8 March 2021
  • == Problem == <center><math>(1+ 1 +2+3+4+5+6+7+8+9) (1+ 1 +2+3+\cdots+9) (1+ 1 +2+3+\cdots+9)</math></center>
    2 KB (275 words) - 19:27, 4 July 2013
  • == Problem == ...48*expi(11*pi/6), D=E+48*expi(7*pi/6), A=E+30*expi(5*pi/6), C=E+30*expi(pi/6), F=foot(O,B,A);
    3 KB (484 words) - 13:11, 14 January 2023
  • == Problem == .../math> to <math>k = 6</math>, we get <math>\sum_{k=1}^{6} 4k^2 + 1 = 364 + 6 = 370</math> (either adding or using the [[perfect square|sum of consecutiv
    2 KB (287 words) - 01:25, 12 December 2019
  • == Problem == .... This yields the equations <math>x = 2a+1, 6a+2, 12a+3, 20a+4, 30a+5, 42a+6, 56a+7, 72a+8, 90a+9</math>.
    4 KB (646 words) - 17:37, 1 January 2024
  • == Problem == {{AIME box|year=1995|num-b=6|num-a=8}}
    3 KB (427 words) - 09:23, 13 December 2023
  • == Problem == ...ive <math>3+4i</math>. This gets three equations necessary for solving the problem. <cmath>p+r = 3</cmath> <cmath>pr-qs = 13</cmath> <cmath>-q-s = 4</cmath> S
    3 KB (451 words) - 15:02, 6 September 2021
  • == Problem == Circles of radius <math>3</math> and <math>6</math> are externally tangent to each other and are internally tangent to a
    3 KB (605 words) - 11:30, 5 May 2024
  • == Problem == ...umber of steps the object may have taken is either <math>4</math> or <math>6</math>.
    3 KB (602 words) - 23:15, 16 June 2019
  • == Problem == <cmath>1 - \cos^2 2 \theta = \frac{\cos 4\theta - \cos 6 \theta}{2},</cmath>
    5 KB (710 words) - 21:04, 14 September 2020
  • == Problem == <math>\gcd(150,324)=6</math>,
    5 KB (923 words) - 21:21, 22 September 2023
  • == Problem == In [[triangle]] <math>ABC</math>, <math>AB=\sqrt{30}</math>, <math>AC=\sqrt{6}</math>, and <math>BC=\sqrt{15}</math>. There is a point <math>D</math> for
    3 KB (521 words) - 01:18, 25 February 2016
  • == Problem == &= \frac{9 \cdot 10 + 7 \cdot 9 + 5 \cdot 8 + 3 \cdot 7 + 1 \cdot 6 - 1 \cdot 5 - 3 \cdot 4 - 5 \cdot 3 - 7 \cdot 2 - 9 \cdot 1}{9} \\
    5 KB (879 words) - 11:23, 5 September 2021
  • == Problem == Let <math>\mathrm {P}</math> be the product of the [[root]]s of <math>z^6+z^4+z^3+z^2+1=0</math> that have a positive [[imaginary]] part, and suppose
    6 KB (1,022 words) - 20:23, 17 April 2021
  • == Problem == ...<math>22 \pmod {32}</math>. He then goes ahead and opens all lockers <math>6 \pmod {32}</math>, leaving <math>22 \pmod {64}</math> or <math>54 \pmod {64
    3 KB (525 words) - 23:51, 6 September 2023
  • == Problem == ...> is the harmonic mean of <math>x</math> and <math>y</math> equal to <math>6^{20}</math>?
    1 KB (155 words) - 19:32, 4 July 2013
  • == Problem == {{AIME box|year=1996|num-b=6|num-a=8}}
    4 KB (551 words) - 11:44, 26 June 2020
  • == Problem == ...rical to the first one. Therefore, there are <math>5 \cdot 2^6 + 5 \cdot 2^6</math> ways for an undefeated or winless team.
    3 KB (461 words) - 01:00, 19 June 2019
  • == Problem == {{AIME box|year=1996|num-b=4|num-a=6}}
    3 KB (585 words) - 22:08, 19 November 2022
  • == Problem == label("$6$",(unit*(r+1)/2,0,0),N);
    2 KB (257 words) - 17:50, 4 January 2016
  • == Problem == ...)\theta) \ge \frac{\sqrt{3}}{2}</cmath>Thus, <cmath>|m - n| \le \frac{\pi}{6} \cdot \frac{1997}{2 \pi} = \left\lfloor \frac{1997}{12} \right\rfloor =166
    5 KB (874 words) - 22:30, 1 April 2022
  • ==Problem== So a total of <math>6</math> doublings = <math>2^6</math> = <math>64</math>, the total length = <math>64 \cdot \sqrt {2} = a\s
    7 KB (1,225 words) - 19:56, 4 August 2021
  • == Problem == In our problem <math>f^2(x) = x</math>. It follows that
    11 KB (2,063 words) - 22:59, 21 October 2023
  • == Problem 11 == === Solution 6 ===
    10 KB (1,514 words) - 14:35, 29 March 2024
  • == Problem == ...reating the set as ordered. The final solution is then <math>\frac{729-27}{6}=\boxed{117}</math>
    3 KB (585 words) - 19:37, 25 April 2022
  • == Problem == ...5\cdot 3^4 \cdot 5 + 20\cdot 3^3 \cdot 5\sqrt{5} + 15 \cdot 3^2 \cdot 25 + 6 \cdot 3 \cdot 25\sqrt{5} + 5^3\right)</math> <math>= \frac{1}{64}\left(1030
    4 KB (586 words) - 21:53, 30 December 2023
  • == Problem == ...more detailed explanations, see related [[2007 AIME I Problems/Problem 10|problem (AIME I 2007, 10)]].''
    4 KB (638 words) - 16:41, 22 January 2024
  • == Problem == <math>\left(\frac{1}{6}t\right)^2 + \left(-110 + \frac{1}{2}t\right)^2 = 51^2</math>.
    4 KB (617 words) - 18:47, 17 July 2022
  • == Problem == [[Image:1997_AIME-6.png]]
    3 KB (497 words) - 00:39, 22 December 2018
  • == Problem == {{AIME box|year=1997|num-b=4|num-a=6}}
    1 KB (208 words) - 11:46, 4 June 2021
  • == Problem == ...mula, that gives us <math>s=1^2+2^2+\cdots+8^2=\dfrac{(8)(8+1)(2\cdot8+1)}{6}=12*17=204</math>.
    3 KB (416 words) - 21:09, 27 October 2022
  • == Problem == { }_{2} X_{4},{ }_{4} X_{6}, \ldots,{ }_{n-2} X_{n},(n, n+1)(n+1,1)(1, n+2)(n+2,2)
    9 KB (1,671 words) - 22:10, 15 March 2024
  • == Problem == <math>\frac{(60-m)^2}{60^2} = .6</math><br />
    4 KB (624 words) - 18:34, 18 February 2018
  • == Problem == | 0 || 1 || 2 || 3 || 4 || 5 || 6
    2 KB (354 words) - 19:37, 24 September 2023
  • == Problem == Note that this is an algebraic bijection, we have simplified the problem and essentially removed the odd condition, so now we can finish with plain
    5 KB (684 words) - 11:41, 13 August 2023
  • == Problem == [[Image:AIME_1998-6.png|350px]]
    2 KB (254 words) - 19:38, 4 July 2013
  • == Problem == Though the problem may appear to be quite daunting, it is actually not that difficult. <math>\
    1 KB (225 words) - 02:20, 16 September 2017
  • == Problem == ...m{2}{2} = 6</math> ways. This gives us a total of <math>10 \cdot 2 \cdot 6 = 120</math> possibilities in which all three people get odd sums.
    5 KB (917 words) - 02:37, 12 December 2022
  • == Problem == ...count only 1 ordered pair. By doing with 4, we count 4 ordered pairs. With 6, we get 7 pairs. With 8 we get 12. By continuing on, and then finding the d
    6 KB (913 words) - 16:34, 6 August 2020
  • == Problem == ...{12}</math> the [[least common multiple]] of the positive integers <math>6^6</math>, <math>8^8</math>, and <math>k</math>?
    2 KB (289 words) - 22:50, 23 April 2024
  • == Problem == ...,Q,NE);label("\(R\)",R,SE);</asy><asy>import three; defaultpen(linewidth(0.6));
    7 KB (1,107 words) - 20:34, 27 January 2023
  • == Problem == Now <math>[CAP] + [ABP] + [BCP] = [ABC] = \sqrt {(21)(8)(7)(6)} = 84</math>, by [[Heron's formula]].
    7 KB (1,184 words) - 13:25, 22 December 2022
  • == Problem == ...endpoints. When we select these segments, we are working with <math>4, 5, 6, 7,</math> or <math>8</math> endpoints in total.
    3 KB (524 words) - 17:25, 17 July 2023
  • == Problem == == Solution 6 ==
    6 KB (1,010 words) - 19:01, 24 May 2023
  • == Problem == {{AIME box|year=1999|num-b=6|num-a=8}}
    3 KB (475 words) - 13:33, 4 July 2016
  • == Problem == [[Image:1999_AIME-6.png]]
    2 KB (354 words) - 16:42, 20 July 2021
  • == Problem == {{AIME box|year=1999|num-b=4|num-a=6}}
    1 KB (170 words) - 19:40, 4 July 2013
  • == Problem == ...is divisible by <math>3</math>. However, if the common difference is <math>6</math>, we find that <math>5,11,17,23</math>, and <math>29</math> form an [
    2 KB (332 words) - 13:22, 3 August 2020
  • == Problem == This problem just requires a good diagram and strong 3D visualization.
    3 KB (445 words) - 19:40, 4 July 2013
  • == Problem == Consider the general problem: with a stack of <math>n</math> cards such that they will be laid out <math
    15 KB (2,673 words) - 19:16, 6 January 2024
  • == Problem == D((-6,0)--(6,0),Arrows(4)); D((0,-6)--(0,6),Arrows(4)); truck((1,0)); truck((2,0)); truck((3,0)); truck((4,0));
    3 KB (571 words) - 00:38, 13 March 2014
  • == Problem == Essentially, the problem asks us to compute <cmath>\sum_{a=-3}^3 \sum_{b=-3}^3 \frac{2^a}{5^b}</cmat
    4 KB (667 words) - 13:58, 31 July 2020
  • == Problem == note: this is the type of problem that makes you think symmetry, but actually can be solved easily with subst
    5 KB (781 words) - 15:02, 20 April 2024
  • == Problem == ...]s <math>(x,y)</math> of [[integer]]s is it true that <math>0 < x < y < 10^6</math> and that the [[arithmetic mean]] of <math>x</math> and <math>y</math
    6 KB (966 words) - 21:48, 29 January 2024
  • == Problem == If we work with the problem for a little bit, we quickly see that there is no direct combinatorics way
    7 KB (1,011 words) - 20:09, 4 January 2024
  • == Problem == The numbers <math>1, 2, 3, 4, 5, 6, 7,</math> and <math>8</math> are randomly written on the faces of a regula
    11 KB (1,837 words) - 18:53, 22 January 2024
  • == Problem == ...ive mail and <math>1</math> represent a house that does receive mail. This problem is now asking for the number of <math>19</math>-digit strings of <math>0</m
    13 KB (2,298 words) - 19:46, 9 July 2020
  • == Problem == ...sphere]] is inscribed in the [[tetrahedron]] whose vertices are <math>A = (6,0,0), B = (0,4,0), C = (0,0,2),</math> and <math>D = (0,0,0).</math> The [
    6 KB (1,050 words) - 18:44, 27 September 2023
  • ===Problem 1=== [[2014 USAJMO Problems/Problem 1|Solution]]
    3 KB (600 words) - 16:42, 5 August 2023
  • ...k contains the full set of test problems. The rest contain each individual problem and its solution. *[[2005 AMC 10B Problems/Problem 1]]
    1 KB (165 words) - 12:40, 14 August 2020
  • == Problem == ...<math>4</math> OOOs. Doing a sanity check, <math>12 + 8 + 12 + 6 + 8 + 4 + 6 + 4 = 60,</math> which is the total number of points.
    8 KB (1,187 words) - 02:40, 28 November 2020
  • == Problem == ...at most <math>3</math> digits in base-<math>7</math>. Letting <math>a_2 = 6</math>, we find that <math>630_7 = \boxed{315}_{10}</math> is our largest 7
    3 KB (502 words) - 11:28, 9 December 2023
  • == Problem == ...we find that the [[inradius]] is <math>r = \frac{A}{s} = \frac{\sqrt{1311}}6</math>. Since <math>\triangle ADE \sim \triangle ABC</math>, the ratio of t
    9 KB (1,540 words) - 08:31, 1 December 2022
  • == Problem == Recast the problem entirely as a block-walking problem. Call the respective dice <math>a, b, c, d</math>. In the diagram below,
    11 KB (1,729 words) - 20:50, 28 November 2023
  • == Problem == ===Solution 6===
    6 KB (1,043 words) - 10:09, 15 January 2024
  • ==Problem== ...circ}</math> and <math>\angle BAC=60^{\circ}</math>, so <math>BC = 12\sqrt{6}</math>.
    3 KB (534 words) - 03:22, 23 January 2023
  • == Problem == ...el to <math>\overline{GF},</math> <math>BF = AG = 8,</math> and <math>GF = 6;</math> and face <math>CDE</math> has <math>CE = DE = 14.</math> The other
    7 KB (1,181 words) - 20:32, 8 January 2024
  • == Problem == Substituting <math>c=24</math> and solving with algebra now gives <math>a=6\sqrt{31}, b=3\sqrt{70}</math>. Now we can find <math>F</math>. Note that <m
    6 KB (974 words) - 13:01, 29 September 2023
  • == Problem == ...h>2</math> and <math>u</math> must be <math>4</math>, in order for <math>5,6</math> to be paint-able. Thus <math>424</math> is paintable.
    4 KB (749 words) - 19:44, 25 April 2024
  • == Problem == ...6 digits, we can cut out a lot of 6's from <math>858</math> to reduce the problem to finding the first three digits after the decimal of
    2 KB (316 words) - 19:54, 4 July 2013
  • == Problem == ...{225}(x_2)=(3+\sqrt{5})+(3-\sqrt{5})=6</math> <math>\Rightarrow x_1x_2=225^6=15^{12}</math>.
    1 KB (194 words) - 19:55, 23 April 2016
  • == Problem == ...diagonal only form 6 squares. So in total, we have overcounted by <math>9+6=15</math>, and <math>198-15=\fbox{183}</math>.
    1 KB (220 words) - 20:50, 12 November 2022
  • == Problem == ...xtraneous pairs: <math>(1,2), (1,3), (2,3), (1,4), (2,4), (1,5), (2,5), (1,6), (1,7), (1,8),</math> and <math>(1,9)</math>. <math>36-11=\boxed{025}</mat
    2 KB (246 words) - 17:02, 21 May 2023
  • == Problem == ...the sum of these elements is <math>\sum_{i=0}^{5} {2i \choose i} = 1 + 2 +6 + 20 + 70 + 252 = 351</math>.
    4 KB (651 words) - 19:42, 7 October 2023
  • == Problem == ...e); D(A--D(MP("M",M))--B); D(C--M); D(C--D(MP("N",N))--B--N--M,linetype("6 6")+linewidth(0.7));
    7 KB (1,058 words) - 01:41, 6 December 2022
  • == Problem == ...consecutive squares]], namely <math>\sum_{k=1}^n k^2 = \frac{n(n+1)(2n+1)}{6}</math>.
    4 KB (696 words) - 11:55, 10 September 2023
  • == Problem == pair O=(0,0),A=(-15,0),B=(-6,0),C=(15,0),D=(0,8);
    3 KB (490 words) - 18:13, 13 February 2021
  • == Problem == ...h>{4\choose 3} = 4</math> triangles of the first type, and there are <math>6</math> faces, so there are <math>24</math> triangles of the first type. Eac
    3 KB (477 words) - 18:35, 27 December 2021
  • == Problem == ...entprojection = perspective(5,4,3); defaultpen(linetype("8 8")+linewidth(0.6));
    2 KB (288 words) - 19:58, 4 July 2013
  • == Problem == <cmath>\implies \frac{6}{5} = \frac{n}{10}</cmath>
    3 KB (516 words) - 21:59, 22 October 2020
  • == Problem == *<math>21</math> will be the greater number in <math>6</math> subsets.
    2 KB (317 words) - 00:09, 9 January 2024
  • == Problem == *For <math>6</math> circles, the ratio is <math>7/12</math>.
    4 KB (523 words) - 15:49, 8 March 2021
  • == Problem == {{(6!)!}\over{6}}={{720!}\over6}={{720\cdot719!}\over6}=120\cdot719!.</cmath>Because <math>
    756 bytes (104 words) - 07:27, 21 November 2023
  • ==Problem== ...extbf{(A) } 3\qquad\textbf{(B) } 4\qquad\textbf{(C) } 5\qquad\textbf{(D) } 6\qquad\textbf{(E) } 7</math>
    2 KB (384 words) - 22:57, 17 February 2024
  • == Problem == ...coordinates of its vertices are distinct elements of the set <math>\{0,2,4,6,8,10\}.</math> The area of the hexagon can be written in the form <math>m\s
    9 KB (1,461 words) - 15:09, 18 August 2023
  • == Problem == Notice that this problem can be converted into a Markov Chain transition matrix.
    15 KB (2,406 words) - 23:56, 23 November 2023
  • == Problem == ...ors even, we let the larger one equal <math>150</math> and the other <math>6</math>, which gives <math>b=48</math>. This checks, so the solution is <mat
    1 KB (218 words) - 14:14, 25 June 2021
  • == Problem == Consider the polynomials <math>P(x) = x^{6} - x^{5} - x^{3} - x^{2} - x</math> and <math>Q(x) = x^{4} - x^{3} - x^{2}
    3 KB (475 words) - 21:53, 6 May 2024
  • ==Problem== ...g terms <math>1,2,3</math>, we use <math>-1,0,1</math> and solve the <math>6</math>th term.
    5 KB (793 words) - 15:18, 14 July 2023
  • == Problem == {{AIME box|year=2003|n=II|num-b=6|num-a=8}}
    2 KB (323 words) - 09:56, 16 September 2022
  • == Problem == G=(6.3333,4);
    5 KB (787 words) - 17:38, 30 July 2022
  • == Problem == ...dentical wedge and sticking it to the existing one). Thus, <math>V=\dfrac{6^2\cdot 12\pi}{2}=216\pi</math>, so <math>n=\boxed{216}</math>.
    1 KB (204 words) - 17:41, 30 July 2022
  • == Problem == ...h>, and calling the foot <math>M</math>, we have <math>WM=XM=\frac{\sqrt3}{6}</math>. Since <math>\cos\angle{WMX}=\cos\angle{AMX}=MX/AM=1/3</math>. By L
    3 KB (563 words) - 17:36, 30 July 2022
  • == Problem == ...restricted. Therefore, the number of seven-letter good words is <math>3*2^6=192</math>
    2 KB (336 words) - 17:29, 30 July 2022
  • == Problem == The [[product]] <math>N</math> of three [[positive integer]]s is <math>6</math> times their [[sum]], and one of the [[integer]]s is the sum of the o
    1 KB (174 words) - 08:56, 11 July 2023
  • == Problem == ...h>\mathcal{C}_{2}</math> intersect at two points, one of which is <math>(9,6)</math>, and the product of the radii is <math>68</math>. The x-axis and th
    7 KB (1,182 words) - 09:56, 7 February 2022
  • == Problem == R=(6.4615,0);
    6 KB (935 words) - 13:23, 3 September 2021
  • == Problem == ...an be represented by the number of paths from <math>(0,0)</math> to <math>(6,4)</math> that always stay below the line <math>y=\frac{2x}{3}</math>. We c
    7 KB (1,127 words) - 13:34, 19 June 2022
  • == Problem == <center><math>1^2+2^2+3^2+\ldots+k^{2}=\frac{k(k+1)(2k+1)}6</math>.</center>
    3 KB (403 words) - 12:10, 9 September 2023
  • == Problem == ...ve terms are <math>1,2,..,9998</math>, while the negative ones are <math>5,6,...,10002</math>. Hence we are left with <math>1000 \cdot \frac{1}{4} (1 +
    2 KB (330 words) - 05:56, 23 August 2022
  • == Problem == ...on-negative integers, for which <math>a^6</math> is not a divisor of <math>6^a</math>.
    3 KB (515 words) - 14:46, 14 February 2021
  • == Problem == [[Image:AIME 2002 II Problem 4.gif]]
    2 KB (268 words) - 07:28, 13 September 2020
  • == Problem == It is given that <math>\log_{6}a + \log_{6}b + \log_{6}c = 6,</math> where <math>a,</math> <math>b,</math> and <math>c</math> are [[posi
    2 KB (263 words) - 22:50, 5 April 2024
  • == Problem == triple S=(1,0,0), T=(2,0,2), U=(8,6,8), V=(8,8,6), W=(2,2,0), X=(6,8,8);
    4 KB (518 words) - 15:01, 31 December 2021
  • == Problem == ...gle{BCD}</math>, <math>AB = 8</math>, <math>BD = 10</math>, and <math>BC = 6</math>. The length <math>CD</math> may be written in the form <math>\frac {
    4 KB (743 words) - 03:32, 23 January 2023
  • == Problem == ...h>\frac 18</math>. Thus we have the recursion <math>\Delta P_{i+1} = \frac{6}{8} \Delta P_i</math>, and so <math>\Delta P_i = \frac 12 \cdot \left(\frac
    2 KB (380 words) - 00:28, 5 June 2020
  • == Problem == ...er league with six other teams, each of which it plays once. In any of its 6 matches, the probabilities that Club Truncator will win, lose, or tie are e
    3 KB (415 words) - 23:25, 20 February 2023
  • == Problem == ...0^{6} - 1 | 10^{6k} - 1</math>, and so any <math>\boxed{j-i \equiv 0 \pmod{6}}</math> will work.
    4 KB (549 words) - 23:16, 19 January 2024
  • == Problem == <math>(6)</math> Five unit squares are blue, <math>4</math> cases in all
    8 KB (1,207 words) - 20:04, 5 September 2023
  • == Problem == ...\frac{2001}{3^k}\right),\ 1 \le \frac{2001}{3^k} \le 3 \Longrightarrow k = 6</math>. Indeed,
    3 KB (545 words) - 23:41, 14 June 2023
  • == Problem == ...(D(MP("A_3",A3,NE)) -- O3 -- foot(O3, A2, O2), linetype("4 4")+linewidth(0.6));
    7 KB (1,112 words) - 02:15, 26 December 2022
  • == Problem == ...ides of a [[triangle]] whose area is positive. Consider sets <math>\{4, 5, 6, \ldots, n\}</math> of consecutive positive integers, all of whose ten-elem
    2 KB (286 words) - 22:32, 5 January 2024
  • == Problem == Let <math>R = (8,6)</math>. The lines whose equations are <math>8y = 15x</math> and <math>10y
    2 KB (240 words) - 20:34, 4 July 2013
  • == Problem == The [[equation]] <math>2000x^6+100x^5+10x^3+x-2=0</math> has exactly two real roots, one of which is <math
    6 KB (1,060 words) - 17:36, 26 April 2024
  • == Problem == pair A=(0,0), D=(1,7), Da = MP("D'",D((-7,1)),N), B=(-8,-6), C=B+Da, F=foot(A,C,D);
    4 KB (750 words) - 22:55, 5 February 2024
  • == Problem == ...><math>\frac 1{2!17!}+\frac 1{3!16!}+\frac 1{4!15!}+\frac 1{5!14!}+\frac 1{6!13!}+\frac 1{7!12!}+\frac 1{8!11!}+\frac 1{9!10!}=\frac N{1!18!}</math></ce
    2 KB (281 words) - 12:09, 5 April 2024
  • == Problem == {{AIME box|year=2000|n=II|num-b=4|num-a=6}}
    1 KB (184 words) - 21:13, 12 September 2020
  • == Problem == ...teger with six positive divisors, which indicates that it either is (<math>6 = 2 \cdot 3</math>) a prime raised to the <math>5</math>th power, or two pr
    2 KB (397 words) - 15:55, 11 May 2022
  • == Problem == <cmath>(x-y)(x+y)=2000^2=2^8 \cdot 5^6</cmath>
    804 bytes (126 words) - 20:30, 4 July 2013
  • == Problem == <center><math>\frac 2{\log_4{2000^6}} + \frac 3{\log_5{2000^6}}</math></center>
    2 KB (292 words) - 13:33, 4 April 2024
  • == Problem == label("$\sqrt{2}r$",(-6,0),S);
    2 KB (381 words) - 14:28, 14 December 2021
  • #REDIRECT[[2005 AMC 12B Problems/Problem 6]]
    44 bytes (5 words) - 17:37, 30 June 2011
  • == Problem == ...rac{5}{2}\left(\frac{1}{6}\right)^{11} \qquad \textbf{(E) } \left(\frac{1}{6}\right)^{10} </math>
    3 KB (385 words) - 14:03, 16 June 2022
  • == Problem == ...f <math>3</math> or <math>4</math> but not <math>12</math> are <math>3, 4, 6, 8, </math>and <math>9</math>, a total of five numbers. Since <math>\frac{5
    1 KB (212 words) - 14:44, 15 December 2021
  • == Problem == Suppose that <math>4^a = 5</math>, <math>5^b = 6</math>, <math>6^c = 7</math>, and <math>7^d = 8</math>. What is <math>a \cdot b\cdot c \cdo
    2 KB (324 words) - 15:30, 16 December 2021
  • == Problem == ...are <math>2</math>, <math>3</math>, <math>4</math>, <math>5</math>, <math>6</math>, <math>7</math>, <math>8</math>, and <math>9</math>. There are only
    1 KB (195 words) - 15:33, 16 December 2021
  • == Problem == ...th>, <math>2</math>, <math>3</math>, <math>4</math>, <math>5</math>, <math>6</math>, <math>7</math>, <math>8</math>, <math>9</math>, or <math>10</math>,
    3 KB (398 words) - 19:17, 17 September 2023
  • == Problem == ...(A) } 2 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 5 \qquad \textbf{(D) } 6 \qquad \textbf{(E) } 8 </math>
    3 KB (489 words) - 19:22, 17 September 2023

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