Search Results for: Other than witloof chicory
time. let $n= $ at $t_ $. at each $t_i$, if either $n+i$ or $n-i$ is prime, but not both, then set $n=n+i$ or $n-i$, respectively. also, $n$ cannot visit the same prime twice, i.e. can never repeat a value. in the case where $n\pm i$ are both prime but one of them has been visited already, then the other
i recognize this is probably intractable at the moment, as dynamical problems like this seem to be notoriously hard. but you never know, so i figured i'd ask. barring proof one way or the other, i'm also interested in how it looks heuristically, which i can't figure out. without the no-repeats restriction...
https://math.stackexchange.com/questions/3545124/collatz-esque-dynamical-problem-about-prime-distribution