Let $S$ be a subset of $\{1,\dots,n\}$. Does there exist a good algorithm to find a partition of $S$ into "reasonably long" arithmetic progressions?
Many thanks!
Let $S$ be a subset of $\{1,\dots,n\}$. Does there exist a good algorithm to find a partition of $S$ into "reasonably long" arithmetic progressions?
Many thanks!
Copyright © 2021 JogjaFile Inc.