Timeline for What is the shortest proof of the existence of a prime between $p$ and $p^2$ ? other examples? [closed]
Current License: CC BY-SA 2.5
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 17, 2021 at 18:56 | history | made wiki | Post Made Community Wiki by Stefan Kohl♦ | ||
| Dec 24, 2011 at 2:30 | history | undeleted | François G. Dorais | ||
| Dec 24, 2011 at 1:47 | history | deleted |
Andy Putman Ryan Budney user6976 |
||
| Jan 16, 2011 at 7:26 | vote | accept | Asterios Gkantzounis | ||
| Jan 15, 2011 at 20:13 | history | closed |
Wadim Zudilin Pete L. Clark Harry Gindi Felipe Voloch coudy |
not a real question | |
| Jan 14, 2011 at 17:33 | answer | added | Pietro Majer | timeline score: 0 | |
| Jan 14, 2011 at 16:37 | answer | added | Dror Speiser | timeline score: 6 | |
| Jan 14, 2011 at 14:54 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
added 15 characters in body; added 12 characters in body
|
| Jan 14, 2011 at 14:44 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
edited title; added 4 characters in body; edited title
|
| Jan 14, 2011 at 14:34 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
added 54 characters in body
|
| Jan 14, 2011 at 14:34 | comment | added | Alex B. | -1. The answer to 2. is "yes, lots" and the answer to 3. is "yes, you can generate them more or less randomly and you will not derive any insights from the answers. E.g. Every holomorphic function $f:\mathbb{C}\rightarrow\mathbb{C}$ satisfying $f(5)\neq \pi$ is infinitely differentiable." I dare you to prove this statement without proving something stronger at the same time. | |
| Jan 14, 2011 at 14:20 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
edited title; edited title
|
| Jan 14, 2011 at 14:05 | comment | added | arsmath | Asterios, could you make the title more precise? "Shortest proof" of what? | |
| Jan 14, 2011 at 12:24 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
added 7 characters in body
|
| Jan 14, 2011 at 12:07 | comment | added | Wadim Zudilin | There is no considerable advantage of enlarging the interval: this only simplifies the starting verification. I vote to close as see no mathematical question. If the question is nevertheless of interest, community wiki mode sounds more appropriate. | |
| Jan 14, 2011 at 12:01 | history | edited | Wadim Zudilin | CC BY-SA 2.5 |
retagged
|
| Jan 14, 2011 at 11:24 | comment | added | Asterios Gkantzounis | Pete,thank you ,of course i mean really shorter,impressively shorter. | |
| Jan 14, 2011 at 11:22 | comment | added | Pete L. Clark | So far as I know, the bit about finding a prime between $p$ and $p^2$ is a good example of what you're asking for: off the top of my head, I don't know a shorter proof than the one which establishes Bertrand's Postulate (i.e., an elementary but somewhat tricky couple of pages), which is a much stronger result. But I think your question "[A]re there any results that their first proof was large comparing to some proof that someone found later?" is far too broad for this site. (Certainly the answer is yes: a large percentage of first proofs are longer than what is eventually found.) | |
| Jan 14, 2011 at 11:21 | comment | added | Asterios Gkantzounis | thanks for the link,i putted numbers in front of the questions (i hope i havent change the meaning of your comment) | |
| Jan 14, 2011 at 11:19 | history | edited | Asterios Gkantzounis | CC BY-SA 2.5 |
added 8 characters in body
|
| Jan 14, 2011 at 11:14 | comment | added | Gerry Myerson | Maybe your (second) question has already been answered at mathoverflow.net/questions/43820/extremely-messy-proofs | |
| Jan 14, 2011 at 11:05 | history | asked | Asterios Gkantzounis | CC BY-SA 2.5 |