Search results

Page title matches

Page text matches

  • == Problem == draw((0,0)--(18,0));
    2 KB (307 words) - 15:30, 30 March 2024
  • == Problem == ...[[User:Integralarefun|Integralarefun]] ([[User talk:Integralarefun|talk]]) 18:19, 27 September 2023 (EDT)
    2 KB (268 words) - 18:19, 27 September 2023
  • == Problem == ...in area. They also have the same altitude. If the base of the triangle is 18 inches, the median of the trapezoid is:
    878 bytes (143 words) - 20:56, 1 April 2017
  • ...ecause this keeps showing up in number theory problems. Let's look at this problem below: ...u through the thinking behind SFFT). Now we use factor pairs to solve this problem.
    7 KB (1,107 words) - 07:35, 26 March 2024
  • ...at <math>n>k</math>. The definition that <math>|N| > |K|</math> (as in our problem) is that there exists a surjective mapping from <math>N</math> to <math>K</ ...select a fifth sock without creating a pair. We may use this to prove the problem:
    11 KB (1,985 words) - 21:03, 5 August 2023
  • ...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>18! = 6402373705728000</math> ([[2007 iTest Problems/Problem 6|Source]])
    10 KB (809 words) - 16:40, 17 March 2024
  • ...hat is the units digit of <math>k^2 + 2^k</math>? ([[2008 AMC 12A Problems/Problem 15]]) ...27^5=n^5</math>. Find the value of <math>{n}</math>. ([[1989 AIME Problems/Problem 9|1989 AIME, #9]])<br><br>
    16 KB (2,658 words) - 16:02, 8 May 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
  • *[[2007 AMC 12A Problems/Problem 18]] *[[1984 AIME Problems/Problem 8|1984 AIME Problem 8]]
    5 KB (860 words) - 15:36, 10 December 2023
  • * [[2017_USAJMO_Problems/Problem_3 | 2017 USAJMO Problem 3]] * [[2016_AMC_12A_Problems/Problem_17 | 2016 AMC 12A Problem 17]] (See Solution 2)
    2 KB (280 words) - 15:30, 22 February 2024
  • ==Problem== ...and in this situation, the value of <math>I + M + O</math> would be <math>18</math>. Now, we use this process on <math>2001</math> to get <math>667 * 3
    2 KB (276 words) - 05:25, 9 December 2023
  • ...ns can significantly help in solving functional identities. Consider this problem: === Problem Examples ===
    2 KB (361 words) - 14:40, 24 August 2021
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 10B Problems/Problem 1]]
    2 KB (182 words) - 21:57, 23 January 2021
  • ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 12B Problems/Problem 1 | Problem 1]]
    2 KB (210 words) - 00:06, 7 October 2014
  • * <math>91 \not\equiv 18 \pmod{6}</math> because <math>\frac{91 - 18}{6} = \frac{73}{6}</math>, which is not an integer. === Sample Problem ===
    15 KB (2,396 words) - 20:24, 21 February 2024
  • ...ngruence: <math>x \equiv 5 \pmod{21}</math>, and <math>x \equiv -3 \equiv 18 \pmod{21}</math>. (Note that two values of <math>x</math> that are congrue ...following topics expand on the flexible nature of modular arithmetic as a problem solving tool:
    14 KB (2,317 words) - 19:01, 29 October 2021
  • ...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 == ...<math> \overline{AC} </math> is perpendicular to <math> \overline{CD}, AB=18, BC=21, </math> and <math> CD=14. </math> Find the perimeter of <math> ABCD
    7 KB (1,173 words) - 03:31, 4 January 2023
  • == Problem == <math>c=18</math>
    3 KB (439 words) - 18:24, 10 March 2015
  • == Problem == ...ne{AC}</math> is [[perpendicular]] to <math>\overline{CD}</math>, <math>AB=18</math>, <math>BC=21</math>, and <math>CD=14</math>. Find the [[perimeter]]
    2 KB (217 words) - 21:43, 2 February 2014
  • ==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 == [[2002 AMC 12A Problems/Problem 1|Solution]]
    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 == [[2001 AMC 12 Problems/Problem 1|Solution]]
    13 KB (1,957 words) - 12:53, 24 January 2024
  • == Problem 1 == [[2002 AMC 12B Problems/Problem 1|Solution]]
    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 == [[2004 AMC 12B Problems/Problem 1|Solution]]
    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 == // from amc10 problem series
    3 KB (458 words) - 16:40, 6 October 2019
  • == Problem == \mathrm{(B)}\ \frac 18
    1 KB (188 words) - 22:10, 9 June 2016
  • == Problem == {{AMC12 box|year=2006|ab=B|num-b=18|num-a=20}}
    4 KB (696 words) - 09:47, 10 August 2015
  • == Problem == \mathrm{(A)}\ \frac 18
    3 KB (485 words) - 14:09, 21 May 2021
  • == Problem == &= \pi^2 \left ( \frac14 - \frac1{36} - \frac1{18}\right ) \\
    3 KB (563 words) - 22:45, 24 October 2021

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