Timeline for Induction question [closed]
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 22, 2010 at 11:09 | history | closed |
Gjergji Zaimi Mariano Suárez-Álvarez Andrew Stacey Andrea Ferretti Wadim Zudilin |
too localized | |
| Jul 22, 2010 at 10:44 | comment | added | Pietro Majer | oops! . | |
| Jul 22, 2010 at 10:39 | answer | added | Péter Komjáth | timeline score: 3 | |
| Jul 22, 2010 at 10:37 | answer | added | Tony Huynh | timeline score: 0 | |
| Jul 22, 2010 at 10:22 | comment | added | Gjergji Zaimi | @Pietro: I dont think one has to be twice of the other. In the classical solution one considers the n chains C_k={k,2k,4k,...} for $k\in \{1,3,5,\dots, 2n-1\}$ and then use the pigeonhole principle. | |
| Jul 22, 2010 at 10:12 | comment | added | Gjergji Zaimi | This is a problem for the epsilons :) | |
| Jul 22, 2010 at 10:08 | comment | added | Pietro Majer | Actually, one is twice the other. Here pigeonhole seems better than induction. Consider the n subsets {1,2},{2,4},..,{n,2n}. | |
| Jul 22, 2010 at 9:55 | history | asked | psteelk | CC BY-SA 2.5 |