Timeline for What tools should I use for this problem?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2021 at 23:13 | comment | added | Karl Fabian | @Diego Santos: For fixed $p$ you can consider the numbers $\left({\rm mod}(a_i,p)\right)_{i=0,\ldots,d}$ to lie on a circle of circumference $p$. We are interested in the largest gap between these numbers. In principle this can occur between the largest number $\leq p$ and the smallest number $\geq 0$, which here is always $a_0=0$. Therefore one has to add also $p$ itself to the list from which the maximal gap is determined. A possible value of $q$ is then any point in a gap that is larger then $k$, which is more than $k/2$ away from both neighbors. | |
| Dec 7, 2021 at 15:53 | comment | added | Diego Santos | @KarlFabian, first: thank you! Second: where are you considering the sequence to start? Because the $q$ makes a huge difference (I found by experimenting that for different $q$ we get different $p$), and I cannot understand where it enters. Third: I google "maximal circular gap " and find no results for this definition. What exactly it is? | |
| Dec 5, 2021 at 23:47 | comment | added | Karl Fabian | @MattF.: That is neater. I didn't know "Differences" worked around that for ages ... | |
| Dec 5, 2021 at 22:35 | history | edited | user44143 | CC BY-SA 4.0 |
added graph and some explanation
|
| Dec 5, 2021 at 22:13 | comment | added | user44143 | I would write Gap[x_, p_] := Join[Mod[x, p], {0, Mod[1, p], p}] // Sort // Differences // Max | |
| Dec 5, 2021 at 16:31 | history | answered | Karl Fabian | CC BY-SA 4.0 |