Integer Complexity: Experimental and Analytical Results

Details Integer Complexity: Experimental and Analytical Results Integer Complexity: Experimental and Analytical Results

2012-03-29

arxiv.org/abs/1203.6462v1

Mathematics

Number Theory

26 pages, 4 figures (included), submitted to Scientific Papers, University of Latvia (http://www.lu.lv/apgads/izdevumi/lu-raks

Scientific paper

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|| up to 10^12 we present our observations. One of them (if true) implies that there is an infinite number of Sophie Germain primes, and even that there is an infinite number of Cunningham chains of length 4 (at least). We prove also some analytical results about integer complexity.

Affiliated with

Also associated with

No associations

Rating

Integer Complexity: Experimental and Analytical Results does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Integer Complexity: Experimental and Analytical Results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integer Complexity: Experimental and Analytical Results will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57346