Timeline for Polynomial bijection from $\mathbb Q\times\mathbb Q$ to $\mathbb Q$?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2019 at 1:13 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
Added reference to published version
|
| Jan 13, 2016 at 12:31 | comment | added | Boaz Tsaban | @GerryMyerson is right. The issue is that the problem is presented as unsolved, drawing unnecessary attention and time, just to find in the comments that it is as answered as it could be. I believe, MO is not expected to provide answers like complete solutions of P=NP. Rather, answers that are within knowledge, or easy reach, of experts. I can stop doing this service if this is against the policies, but then an alternative solution to the issue I raise here better be found. | |
| Jan 13, 2016 at 5:16 | comment | added | Todd Trimble | @GerryMyerson Probably on suggestion from David Corwin, and/or on the Stack Exchange principle that important relevant information shouldn't be relegated to comments. I guess Boaz signals, by making it CW, that this isn't for reputation gain, but as a public service. | |
| Jan 13, 2016 at 5:04 | comment | added | Gerry Myerson | This was posted (by Jonas Meyer) as a comment on 11 April 2010, and got 125 upvotes (so far!) as a comment. Why post it now as an answer? | |
| Jan 13, 2016 at 1:49 | history | edited | Tadashi | CC BY-SA 3.0 |
Added link to arXiv reference
|
| S Jan 13, 2016 at 1:06 | history | answered | Boaz Tsaban | CC BY-SA 3.0 | |
| S Jan 13, 2016 at 1:06 | history | made wiki | Post Made Community Wiki by Boaz Tsaban |