Jump to content

Integer complexity

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by J Steed Huang (talk | contribs) at 23:16, 20 July 2015 (basic concept in number theory). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Integer Complexity is defined as the least numbers of ones that can be used to represent an integer using ones and any number of additions, multiplications and parentheses.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Integer_complexity&oldid=672345212"