Upper Bounds on Integer Complexity

Joshua Zelinsky

Define $||n||$ to be the \emph{complexity} of $n$, which is the smallest number of $1$s needed to write $n$ using an arbitrary combination of addition and multiplication. John Self…