Jump to content

Integer complexity

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 18:21, 21 September 2015 (Possibly this is not worth keeping, but the "dictionary" objection is not valid, since obviously much could be said about this beyond a definition.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The integer complexity of an integer is smallest number of ones that can be used to represent an it using ones and any number of additions, multiplications, and parentheses.[1]

It is On-Line Encyclopedia of Integer Sequences number A005520.[2]


  1. ^ http://mathworld.wolfram.com/IntegerComplexity.html
  2. ^ http://oeis.org/A005520
Retrieved from "https://en.wikipedia.org/w/index.php?title=Integer_complexity&oldid=682125921"