Source: wikibot/integer-complexity
= Integer complexity
{wiki=Integer_complexity}
Integer complexity is a concept in number theory that refers to the minimum number of ones needed to express a positive integer \\( n \\) using just addition, multiplication, and parentheses. The complexity of an integer is denoted as \\( C(n) \\). For example: - The integer \\( 1 \\) has a complexity of \\( C(1) = 1 \\) because it can be represented as simply using one "1".