Timeline for Unconventional types of induction
Current License: CC BY-SA 3.0
24 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 30, 2023 at 10:14 | comment | added | Gerry Myerson | And math.stackexchange.com/questions/294677/… and math.stackexchange.com/questions/304245/… and maybe some others. | |
| Apr 30, 2023 at 10:10 | comment | added | Gerry Myerson | Perhaps math.stackexchange.com/questions/145189/… is worth a look. Also math.stackexchange.com/questions/2720714/… and math.stackexchange.com/questions/1926967/… and math.stackexchange.com/questions/4437668/… | |
| Apr 29, 2023 at 0:11 | answer | added | Ira Gessel | timeline score: 4 | |
| Dec 8, 2016 at 13:17 | history | edited | Denis Serre | CC BY-SA 3.0 |
added 7 characters in body
|
| Dec 8, 2016 at 10:03 | history | edited | Martin Sleziak | CC BY-SA 3.0 |
changed dead link http://www.math.uga.edu/* to working link http://math.uga.edu/* - see also http://chat.stackexchange.com/transcript/2165/2016/11/20
|
| Dec 29, 2015 at 4:10 | answer | added | Joseph Van Name | timeline score: 3 | |
| May 19, 2014 at 3:04 | review | Close votes | |||
| May 19, 2014 at 7:47 | |||||
| May 13, 2014 at 8:59 | answer | added | Jan Grabowski | timeline score: 1 | |
| May 13, 2014 at 8:46 | answer | added | Primoz | timeline score: 4 | |
| May 13, 2014 at 7:58 | answer | added | Goldstern | timeline score: 14 | |
| May 13, 2014 at 7:55 | comment | added | Colin Reid | Gerry Myerson: If your base case was instead to prove P(n) for infinitely many n (in a way that does not actually specify which n, e.g. 'by compactness, there is a subsequence on which f(n) converges...'), that ought to count as an unconventional induction. | |
| May 13, 2014 at 7:05 | answer | added | Michael | timeline score: 2 | |
| May 12, 2014 at 2:56 | answer | added | George Shakan | timeline score: 10 | |
| May 11, 2014 at 23:25 | comment | added | Gerry Myerson | When I was in high school, I invented "proof by mathematical suction", which involved proving $P(\infty)$ as a base case, and then proving $P(n)$ implies $P(n-1)$. Somehow, the idea never caught on. | |
| May 11, 2014 at 22:18 | answer | added | Woett | timeline score: 0 | |
| May 11, 2014 at 20:13 | comment | added | Andy Putman | Hmm, that's not a great question either, but in any case your question is similar enough to it that any good answer to your answer would be a good answer to that one. Perhaps this should be closed as a duplicate? | |
| May 11, 2014 at 20:03 | comment | added | Joni Teräväinen | I just thought that there have been questions with similar spirit, e.g. mathoverflow.net/questions/92696/… | |
| May 11, 2014 at 20:02 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| May 11, 2014 at 20:00 | history | edited | Joni Teräväinen | CC BY-SA 3.0 |
clarifying
|
| May 11, 2014 at 19:34 | comment | added | Andy Putman | I don't think this is focused enough to make a good question. | |
| May 11, 2014 at 19:31 | review | Close votes | |||
| May 12, 2014 at 5:03 | |||||
| May 11, 2014 at 19:14 | history | edited | Joni Teräväinen | CC BY-SA 3.0 |
edited tags; edited title
|
| May 11, 2014 at 19:13 | history | edited | Andrés E. Caicedo |
edited tags
|
|
| May 11, 2014 at 19:01 | history | asked | Joni Teräväinen | CC BY-SA 3.0 |