Art of Problem Solving
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

2001 AMC 12 Problems/Problem 11: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)

1 September 2025

30 August 2025

7 July 2025

1 May 2025

11 June 2022

8 November 2021

24 October 2021

2 March 2021

17 January 2021

31 December 2020

14 May 2020

14 March 2020

26 December 2019

7 September 2019

2 February 2019

4 November 2018

3 November 2018

13 June 2017

25 January 2016

22 January 2016

31 December 2015

31 January 2015

27 December 2014

30 December 2013

16 November 2013

3 July 2013

3 March 2012

17 February 2012

20 January 2012

5 January 2012

16 March 2011

23 February 2009

22 February 2009

15 February 2009

  • curprev 18:5818:58, 15 February 2009 Misof talk contribs 1,068 bytes +1,068 New page: == Problem == A box contains exactly five chips, three red and two white. Chips are randomly removed one at a time without replacement until all the red chips are drawn or all the white c...
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)