Timeline for A conjecture regarding prime numbers
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 27, 2017 at 13:21 | history | suggested | Glorfindel | CC BY-SA 3.0 |
formatting
|
| Nov 27, 2017 at 10:54 | review | Suggested edits | |||
| S Nov 27, 2017 at 13:21 | |||||
| Nov 26, 2017 at 23:54 | comment | added | Gerhard Paseman | I think it should be the case (that there is an elementary proof) that for fixed j, there are only finitely many cases where your conjecture fails with all primes involved less than j. You might even be able to give an explicit bound. If I get any more along this line I will also report it. Gerhard "Maybe Only Finitely Many J?" Paseman, 2017.11.26. | |
| Nov 26, 2017 at 22:49 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |