Integer complexity satisfies ||n|| ≤ C_avg log n + o(log n) implying lim sup ||n||/log n ≤ C_avg ≈ 3.236, plus the first nontrivial lower bound ||n|| ≥ 3.06 log_3 n for almost all n.
Amano,Integer complexity and mixed binary-ternary representation, Leibniz Int
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Upper and lower estimates for integer complexity
Integer complexity satisfies ||n|| ≤ C_avg log n + o(log n) implying lim sup ||n||/log n ≤ C_avg ≈ 3.236, plus the first nontrivial lower bound ||n|| ≥ 3.06 log_3 n for almost all n.