Search results

  • ...n McNugget Theorem''' (or '''Postage Stamp Problem''' or '''Frobenius Coin Problem''') states that for any two [[relatively prime]] [[positive integer]]s <mat ...t Theorem has also been called the Frobenius Coin Problem or the Frobenius Problem, after German mathematician Ferdinand Frobenius inquired about the largest
    17 KB (2,748 words) - 19:22, 24 February 2024
  • ...ate|[[2007 AMC 12A Problems|2007 AMC 12A #10]] and [[2007 AMC 10A Problems/Problem 14|2007 AMC 10A #14]]}} ==Problem==
    2 KB (231 words) - 14:02, 3 June 2021
  • ...ate|[[2007 AMC 12A Problems|2007 AMC 12A #12]] and [[2007 AMC 10A Problems/Problem 16|2007 AMC 10A #16]]}} ==Problem==
    3 KB (445 words) - 08:59, 24 March 2023
  • <b>Problem: </b> ...e add an even and odd. We can use complementary counting to help solve the problem. There are a total of <math>90</math> possibilities since Jack can choose <
    4 KB (694 words) - 22:00, 12 January 2024
  • ==Problem== ...mouse is at <math>(4,-2)</math> and is running up the [[line]] <math>y=-5x+18</math>. At the point <math>(a,b)</math> the mouse starts getting farther fr
    2 KB (387 words) - 18:20, 27 November 2023
  • ...ate|[[2007 AMC 12A Problems|2007 AMC 12A #22]] and [[2007 AMC 10A Problems/Problem 25|2007 AMC 10A #25]]}} == Problem ==
    15 KB (2,558 words) - 19:33, 4 February 2024
  • == Problem == {{AMC12 box|year=2007|ab=A|num-b=16|num-a=18}}
    1,022 bytes (153 words) - 14:56, 7 August 2017
  • == Problem == ...t 2}{223} = 18</math>. Thus <math>A</math> lies on the lines <math>y = \pm 18 \quad \mathrm{(1)}</math>.
    4 KB (565 words) - 17:01, 2 April 2023
  • == Problem == We can simply apply casework to this problem.
    4 KB (536 words) - 21:18, 22 May 2023
  • == Problem == {{AMC12 box|year=2005|num-b=16|num-a=18|ab=A}}
    2 KB (215 words) - 13:56, 19 January 2021
  • == Problem == ...t\rfloor +\left\lfloor\frac{200}{9}\right\rfloor - \left\lfloor \frac{200}{18}\right\rfloor +\left\lfloor \frac{200}{27}\right\rfloor - \left\lfloor \fra
    4 KB (562 words) - 18:37, 30 October 2020
  • == Problem == ...es. Thus, thus total possibilities for <math>(a,b)</math> is <math>576+144+18=738</math>.
    7 KB (1,114 words) - 03:41, 12 September 2021
  • == Problem I1 == [[2005 PMWC Problems/Problem I1|Solution]]
    9 KB (1,449 words) - 20:49, 2 October 2020
  • == Problem I1 == [[1998 PMWC Problems/Problem I1|Solution]]
    11 KB (1,738 words) - 19:25, 10 March 2015
  • == Problem I1 == [[1999 PMWC Problems/Problem I1|Solution]]
    6 KB (703 words) - 21:21, 21 April 2014
  • ==Problem== <math>4</math> | <math>18</math>
    1 KB (203 words) - 19:14, 7 April 2016
  • ==Problem== {{CYMO box|year=2006|l=Lyceum|num-b=16|num-a=18}}
    789 bytes (123 words) - 22:00, 30 November 2015
  • ==Problem== {{CYMO box|year=2006|l=Lyceum|num-b=18|num-a=20}}
    1 KB (214 words) - 23:44, 22 December 2016
  • ==Problem== fill((-30,0)..(-24,18)--(0,0)--(-24,-18)..cycle,gray(0.7));
    3 KB (476 words) - 03:50, 23 January 2023
  • ...ate|[[2004 AMC 12A Problems|2004 AMC 12A #18]] and [[2004 AMC 10A Problems/Problem 22|2004 AMC 10A #22]]}} == Problem ==
    5 KB (738 words) - 13:11, 27 March 2023

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