• DOI:10.1007/978-3-319-19225-3_5
Corpus ID: 38583739

Integer Complexity: Experimental and Analytical Results II

@inproceedings{Cernenoks2015IntegerCE,
  title={Integer Complexity: Experimental and Analytical Results II},
  author={Juris Cernenoks and Janis Iraids and Martins Opmanis and Rihards Opmanis and Karlis Podnieks},
  booktitle={DCFS},
  year={2015}
}

Juris Cernenoks, Janis Iraids, +2 authors Karlis Podnieks

Published in DCFS 2015

Computer Science, Mathematics

We consider representing of natural numbers by arithmetical expressions using ones, addition, multiplication and parentheses. The (integer) complexity of n -- denoted by ||n|| -- is defined as the number of ones in the shortest expressions representing n. We arrive here very soon at the problems that are easy to formulate, but (it seems) extremely hard to solve. In this paper we represent our attempts to explore the field by means of experimental mathematics. Having computed the values of ||n… CONTINUE READING

View PDF on ArXiv

Save to Library

Create Alert

Cite

Launch Research Feed