- #1
SSequence
- 562
- 97
Not a question as such, but an interesting notion that I came upon (maybe some other people would find it interesting too). It seems to have been introduced in 1950's and seems a good amount of work has been done on it.
For example:
12=(1+1+1)*(1+1+1+1)
So the complexity of 12 is 7 since it can be represented by a minimum of seven 1's in an arithmetic expression (that only uses 1's). Similarly:
6=(1+1+1)*(1+1)
So the complexity of 6 is 5 since it can be represented by a minimum of five 1's in an arithmetic expression (that only uses 1's).
============================
I don't know how well this notion is known. I guess it would depend on interest/knowledge of specific area (e.g. someone with interest/knowledge of combinatorics would have more likely heard of it).
For example:
12=(1+1+1)*(1+1+1+1)
So the complexity of 12 is 7 since it can be represented by a minimum of seven 1's in an arithmetic expression (that only uses 1's). Similarly:
6=(1+1+1)*(1+1)
So the complexity of 6 is 5 since it can be represented by a minimum of five 1's in an arithmetic expression (that only uses 1's).
============================
I don't know how well this notion is known. I guess it would depend on interest/knowledge of specific area (e.g. someone with interest/knowledge of combinatorics would have more likely heard of it).