Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.18431

On Permutations Whose Adjacent-Sum Reciprocals Sum to One

Jinggao Ai·Dingsheng Hu·Junmin Yan
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we give a constructive proof that for any integer n>7 (resp. n>6), the numbers 1,2,...,n can be arranged in a circle (resp. in a line) such that the sum of the reciprocals of all adjacent sums equals 1. The above conjecture was originally posed by Zhi-Wei Sun. Partitioning the integers according to n mod 12 into nine residue classes, we prove a recursive proposition and inductively construct new examples. Main lemmas and propositions in introduction are proved in Section 2. The rest of the cases are handled by explicit constructions in appendix.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jinggao Ai, Dingsheng Hu, Junmin Yan. 2026-10-13. On Permutations Whose Adjacent-Sum Reciprocals Sum to One. https://arxiv.org/abs/2610.18431

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗
arXiv2026

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗