Timeline for Consecutive non squarefree integers
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2018 at 15:26 | history | edited | GH from MO |
edited tags
|
|
| Nov 18, 2013 at 13:46 | vote | accept | István Kovács | ||
| Nov 18, 2013 at 4:57 | history | edited | Lucia | CC BY-SA 3.0 |
Fixed an error in an estimate
|
| S Nov 18, 2013 at 4:19 | history | edited | Lucia | CC BY-SA 3.0 |
Fixed the problems communicated by Lucia. We were aware of the results of Erdős, but we can not see where we went wrong.
|
| S Nov 18, 2013 at 4:19 | history | suggested | Daniel Soltész | CC BY-SA 3.0 |
Fixed the problems communicated by Lucia. We were aware of the results of Erdős, but we can not see where we went wrong.
|
| Nov 18, 2013 at 4:00 | review | Suggested edits | |||
| Nov 18, 2013 at 4:19 | |||||
| Nov 18, 2013 at 2:47 | answer | added | Lucia | timeline score: 12 | |
| Nov 18, 2013 at 2:13 | comment | added | Anthony Quas | Interesting question. The literature seems to have quite a lot about upper bounds. The best upper bounds I could find were $[n,n+cn^{1/5}\log n]$ (due to Filaseta) - clearly much bigger than your lower bound. Granville showed that the abc conjecture implies an upper bound of $n^\epsilon$ for any $\epsilon>0$. | |
| Nov 18, 2013 at 1:12 | review | First posts | |||
| Nov 18, 2013 at 1:15 | |||||
| Nov 18, 2013 at 0:55 | history | asked | István Kovács | CC BY-SA 3.0 |