Timeline for About GPY conjecture generalization?
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2017 at 18:37 | history | edited | C Marius | CC BY-SA 3.0 |
added 57 characters in body
|
| S Jun 8, 2017 at 17:17 | history | suggested | Sylvain JULIEN | CC BY-SA 3.0 |
Tried to give a more precise exposition
|
| Jun 8, 2017 at 16:43 | review | Suggested edits | |||
| S Jun 8, 2017 at 17:17 | |||||
| Jun 8, 2017 at 16:17 | comment | added | C Marius | No, it is counted every time it appears ... please edit the post to make a better exposition... | |
| Jun 8, 2017 at 16:13 | comment | added | Sylvain JULIEN | So if $g$ is a given prime gap that appears several times, you only count it once? | |
| Jun 8, 2017 at 16:06 | comment | added | C Marius | $A_1(p_N)$ is a set $A_1(p_M)$ another set | |
| Jun 8, 2017 at 16:05 | history | edited | C Marius | CC BY-SA 3.0 |
added 327 characters in body
|
| Jun 8, 2017 at 16:04 | comment | added | Sylvain JULIEN | Do you consider $ A_{1}(p_{N}) $ as a set or as a multiset? | |
| Jun 8, 2017 at 15:52 | history | edited | C Marius | CC BY-SA 3.0 |
deleted 446 characters in body; edited title
|
| Jun 8, 2017 at 15:09 | history | edited | C Marius | CC BY-SA 3.0 |
added 28 characters in body
|
| Jun 8, 2017 at 14:21 | history | edited | C Marius | CC BY-SA 3.0 |
added 338 characters in body
|
| Jun 8, 2017 at 14:04 | comment | added | C Marius | Can somebody explain the down votes? Why no explanation? | |
| Jun 8, 2017 at 13:49 | history | edited | C Marius | CC BY-SA 3.0 |
added 240 characters in body
|
| Jun 8, 2017 at 13:39 | history | edited | C Marius | CC BY-SA 3.0 |
added 4 characters in body
|
| Jun 8, 2017 at 13:17 | history | edited | C Marius | CC BY-SA 3.0 |
added 22 characters in body
|
| Jun 8, 2017 at 12:53 | history | asked | C Marius | CC BY-SA 3.0 |