Timeline for Existence of range of numbers containing a coprime to given n
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 31, 2016 at 21:39 | comment | added | Jeppe Stig Nielsen | So @GerhardPaseman's mention of question 37679 did not lead to that thread being linked to this one, and maybe he abstained because it was his own thread, but I think it should be a link: (question 37679) Erik Westzynthius's cool upper bound argument: update? | |
| S Jul 31, 2016 at 20:11 | history | suggested | smci | CC BY-SA 3.0 |
clarify title
|
| Jul 31, 2016 at 19:59 | review | Suggested edits | |||
| S Jul 31, 2016 at 20:11 | |||||
| Jul 31, 2016 at 16:40 | vote | accept | Mehdi Yazdi | ||
| Jul 31, 2016 at 16:39 | answer | added | Seva | timeline score: 17 | |
| Jul 31, 2016 at 16:38 | comment | added | Gerhard Paseman | You want results on Jacobsthal's function. Some of the simplest explicit results are based on work of Harlan Stevens in a 1977 article. He proves that intervals of length (something like) $2^{2+2e\log k}$ suffice, and this can be improved. $k$ is the number of distinct prime factors of $n$. Check out MathOverflow Question 37679 for more. Gerhard "Still Talking About Jacobsthal's Function" Paseman, 2016.07.31. | |
| Jul 31, 2016 at 16:24 | history | asked | Mehdi Yazdi | CC BY-SA 3.0 |