Timeline for answer to Covering a finite ring with arithmetic progressions by Fedor Petrov
Current License: CC BY-SA 3.0
Post Revisions
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2017 at 17:02 | vote | accept | Anton | ||
| Jan 22, 2017 at 14:17 | comment | added | Fedor Petrov | I fixed indices according to he condition that all $i_r$ are non-zero. | |
| Jan 22, 2017 at 14:12 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
deleted 71 characters in body
|
| Jan 22, 2017 at 13:56 | comment | added | Anton | Thanks a lot for your answer. I think there is something wrong with indexing. Did you mean to write $i_{t-1}$ instead of $i_{k-1}$ at the beginning? Also, at the end, I suspect that you mean $i_{n-k}=0$ and not $i_k=0$. | |
| Jan 22, 2017 at 13:47 | comment | added | Anton | Also, do you think the answer would change drastically if I demand $i_r \neq 0$ and $i_1=1$? Because this is the setup in which I am mostly interested in. Your answer was quite surprising to me, as I would expect (at least in my setup) that the upper bound on $t$ is of the form $cn/k$, where $c$ is a constant. | |
| Jan 22, 2017 at 6:26 | history | answered | Fedor Petrov | CC BY-SA 3.0 |