Timeline for Is there a theorem that says that there is always more than one way to "continue a finite sequence"?
Current License: CC BY-SA 2.5
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 24, 2010 at 4:02 | comment | added | timur | I totally agree! There are also those sequences with shapes that are common in IQ-style tests. Those are mostly snapshots of something moving or patterns that appear in say the mnemonic devices to compute 3x3 determinants, but one can argue any way one wants and continue arbitrarily. | |
Jan 28, 2010 at 14:01 | comment | added | Qiaochu Yuan | Just so I can make my point better, the sequence I gave above is the number of regular polytopes in n dimensions (starting from zero). I cannot imagine any conceivable problem-solving method that could have deduced this from the sequence alone unless you were already familiar with it. | |
Jan 28, 2010 at 13:55 | comment | added | GS | And all this time I've been trying to figure out what to feed my peeves... | |
Nov 6, 2009 at 22:55 | comment | added | S. Carnahan♦ | I had always heard "pet peeve" used to describe behaviors rather than people. Unfortunately, the dictionary doesn't agree with my hairsplitting. | |
Nov 6, 2009 at 22:06 | comment | added | Qiaochu Yuan | What would you consider a "proof"? | |
Nov 6, 2009 at 22:01 | comment | added | Sonia Balagopalan | "Sequence-continuation problems happen to be one of my pet peeves." I totally agree! Psychologically, the reason I'm asking this question is that I want to see a 'proof' that sequence-continuation is not a mathematical exercise. | |
Nov 6, 2009 at 21:59 | comment | added | Michael Lugo | People who say that sequence-continuation problems are one of their pet peeves are one of my pet peeves. | |
Nov 6, 2009 at 21:53 | history | edited | Qiaochu Yuan | CC BY-SA 2.5 |
edited body
|
Nov 6, 2009 at 21:47 | history | edited | Qiaochu Yuan | CC BY-SA 2.5 |
added 27 characters in body
|
Nov 6, 2009 at 21:42 | history | answered | Qiaochu Yuan | CC BY-SA 2.5 |