加载中…
Hegarty conjectured for that has a permutation which destroys all arithmetic progressions mod . For $n\ge n_0/n$ has an arithmetic-progression destroying permutation. However $n_0\approx 1.4\times 10^{14}$ and thus resolving the conjecture in full remained out of reach of any computational techniques. However, this paper using constructions modeled after those used by Elkies and Swaminathan for the case of with being prime, establish the conjecture in full. Furthermore our results do not rely on the fact that it suffices to study when and thus our results completely independent of the proof given by Hegarty and Martinsson.

生成讲解博客的中文版本

生成AI智能校验的中文版本