Making Every Number from 1 to N Under a Fixed Cycle of +, times, -,
math.CO, cs.DM, math.NT
Submitted: 2026-10-07
Updated: 2026-10-31
Comments: 25 pages, 2 figures, 9 tables. Verification code: https://github.com/poscle/AMSD-Number-Generator
Code: https://github.com/poscle/AMSD-Number-Generator
License: http://creativecommons.org/licenses/by/4.0/
The gist: Start with the number 2.
Terminology
Abstract
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 at least 9. Conventional induction cannot work, because a division that comes right after a completed interval 1,,P produces numbers already made. Instead we extend a completed interval 1,,P to 1,,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 at most N at most 33 we give explicit sequences, found by computer search.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality