A short note on integer complexity

Authors

  • Stefan Steinerberger Department of Mathematics, Yale University

DOI:

https://doi.org/10.11575/cdm.v9i1.62145

Abstract

Building on an earlier approach by Isbell and Guy, this short note gives a new, constructive upper bound on the smallest number of 1's needed in conjunction with arbitrarily many +, *, and parentheses to write an integer n for generic integers n.

Downloads

Published

2014-08-31

Issue

Section

Articles