Imo 2009 q6: Revision history

13 June 2013

• curprev 12:1912:19, 13 June 2013‎ Glasser talk contribs‎ 20,704 bytes −6‎ Minor fix
• curprev 12:1612:16, 13 June 2013‎ Glasser talk contribs‎ 20,710 bytes 0‎ Minor fix to proof 3: It said phi(0) instead of phi(1)

28 September 2010

• curprev 00:3800:38, 28 September 2010‎ Thomas.zeitlhoefler talk contribs‎ 20,710 bytes −532‎ All right, I finally got it. Your original solution was completely correct and i completely screwed up. I changed it to the original.

27 September 2010

• curprev 23:3423:34, 27 September 2010‎ Thomas.zeitlhoefler talk contribs‎ 21,242 bytes +622‎ Sorry for my last edit, the version before that had a little mistake and my attempt to correct it was much worse. I hope I have it now.
• curprev 16:5116:51, 27 September 2010‎ Thomas.zeitlhoefler talk contribs‎ 20,620 bytes −91‎ In the previous version of proof 1 there is a mistake. Let n=8, k=3, biggest i in I = 3. Then you get the elements a1+a7+a8 and a5+a6+a8 which are not necessarily distinct.

23 August 2009

• curprev 01:2901:29, 23 August 2009‎ Neergard talk contribs‎ 20,711 bytes +11‎ No edit summary

22 August 2009

• curprev 14:5714:57, 22 August 2009‎ Neergard talk contribs‎ 20,700 bytes +295‎ No edit summary

31 July 2009

• curprev 21:5721:57, 31 July 2009‎ Itempond.com talk contribs‎ 20,405 bytes +2,483‎ →‎Proof #6

29 July 2009

• curprev 09:0009:00, 29 July 2009‎ Alex and Ecki talk contribs‎ m 17,922 bytes +13‎ →‎Proof #1
• curprev 08:5408:54, 29 July 2009‎ Alex and Ecki talk contribs‎ 17,909 bytes −85‎ →‎Proof #5

25 July 2009

• curprev 09:5109:51, 25 July 2009‎ KristalCantwell talk contribs‎ 17,994 bytes +1,533‎ No edit summary

24 July 2009

• curprev 15:1615:16, 24 July 2009‎ Teorth talk contribs‎ 16,461 bytes +286‎ →‎Proof #1
• curprev 15:1415:14, 24 July 2009‎ Teorth talk contribs‎ 16,175 bytes +61‎ →‎Proof #1

23 July 2009

• curprev 21:2121:21, 23 July 2009‎ KristalCantwell talk contribs‎ 16,114 bytes +26‎ →‎Proof #4
• curprev 09:3209:32, 23 July 2009‎ Teorth talk contribs‎ 16,088 bytes +300‎ No edit summary
• curprev 09:2809:28, 23 July 2009‎ Teorth talk contribs‎ 15,788 bytes 0‎ →‎Proof #1
• curprev 09:1909:19, 23 July 2009‎ KristalCantwell talk contribs‎ 15,788 bytes −2‎ →‎Proof #4
• curprev 09:1609:16, 23 July 2009‎ KristalCantwell talk contribs‎ 15,790 bytes +2,227‎ No edit summary
• curprev 08:1508:15, 23 July 2009‎ AnthonyTowns talk contribs‎ 13,563 bytes +4,474‎ add another variant of proof#2
• curprev 00:1600:16, 23 July 2009‎ Rweba talk contribs‎ m 9,089 bytes −4‎ Fixed Latex error
• curprev 00:0900:09, 23 July 2009‎ Rweba talk contribs‎ m 9,093 bytes +12‎ Fixed a very minor typo

22 July 2009

• curprev 23:5923:59, 22 July 2009‎ Mark Bennet talk contribs‎ 9,081 bytes +340‎ →‎Notation
• curprev 23:5323:53, 22 July 2009‎ Mark Bennet talk contribs‎ m 8,741 bytes +63‎ →‎Proof #2
• curprev 23:4723:47, 22 July 2009‎ Mark Bennet talk contribs‎ m 8,678 bytes 0‎ →‎Proof #2
• curprev 23:4123:41, 22 July 2009‎ Mark Bennet talk contribs‎ m 8,678 bytes +19‎ →‎Proof #2
• curprev 23:3823:38, 22 July 2009‎ Mark Bennet talk contribs‎ m 8,659 bytes +6‎ →‎Proof #2
• curprev 23:3323:33, 22 July 2009‎ Mark Bennet talk contribs‎ 8,653 bytes +3,808‎ →‎Proof #2
• curprev 18:2718:27, 22 July 2009‎ Teorth talk contribs‎ 4,845 bytes +4,845‎ New page: The International Mathematical Olympiad (IMO) consists of a set of six problems, to be solved in two sessions of four and a half hours each. Traditionally, the last problem (Problem 6) is...