Jump to content

Integer complexity

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Noyster (talk | contribs) at 13:26, 25 September 2015 (ce, expand refs). 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 the smallest number of ones that can be used to represent it using ones and any number of additions, multiplications, and parentheses.[1]

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

Notes and references

  1. ^ Weisstein, Eric W. "Integer Complexity." From MathWorld--A Wolfram Web Resource.
  2. ^ Entry A005520 in On-Line Encyclopedia of Integer Sequences, The OEIS Foundation Inc.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Integer_complexity&oldid=682704955"