Metraipolis › archive › dc_27fecafd6cae
Making Every Number from 1 to N Under a Fixed Cycle of $+$, $\times$, $-$, $÷$ — arXiv:2610.10095
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10095
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:44:05.909Z
- SHA-256 of the archived text
34022b47e84e6316c55b4b4c0b6bf45bd220d0c3679a6140796a7748deed8592- Stable URL of this page
https://metraipolis.com/documento/dc_27fecafd6cae
How to cite
Making Every Number from 1 to N Under a Fixed Cycle of $+$, $\times$, $-$, $÷$ — arXiv:2610.10095 — arXiv (en), https://arxiv.org/abs/2610.10095 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_27fecafd6cae (Metraipolis archive dc_27fecafd6cae, sha256 34022b47e84e6316c55b4b4c0b6bf45bd220d0c3679a6140796a7748deed8592)
BibTeX
@misc{dc27fecafd6cae,
title = {Making Every Number from 1 to N Under a Fixed Cycle of $+$, $times$, $-$, $÷$ — arXiv:2610.10095},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10095},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_27fecafd6cae; sha256 34022b47e84e6316c55b4b4c0b6bf45bd220d0c3679a6140796a7748deed8592},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10095. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Start with the number $2$. At each move, combine two numbers already made, but the operations must be used in the fixed repeating order $+,\times,-,÷$. We ask for the fewest moves needed to make every integer from $1$ to $N$. Since $2$ is already one of the numbers we want and each move makes at most one new number, at least $N-1$ moves are needed. We show that $N-1$ moves are also enough for every $N\ge 9$. Conventional induction cannot work, because a division that comes right after a completed interval $\{1,\dots,P\}$ produces numbers already made. Instead we extend a completed interval $\{1,\dots,P\}$ to $\{1,\dots,3P\}$ all at once, which counting shows is the smallest multiplicative extension $P\to kP$ that can work, and then adjust the last few moves to reach every other $N$. For $9\le N\le 33$ we give explicit sequences, found by computer search.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM); Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2610.10095 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:17:00.196Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).