
COMMENTS

A253057 considers the number of applications needed to collapse numbers. An alternative is to look at the number of times a plus sign needs to be inserted, disregarding the number of applications.
The sequence is believed to be infinite. Only five terms, a(1)a(5), were provided by Butler et al. (2016).
Butler et al. (2016) conjectured that collapsing each term x by simply inserting a plus sign in the "middle" of the decimal expansion and adding would require in the order of log (log x) plus signs.
a(5) reveals that all fivedigit and sixdigit numbers can be collapsed by inserting no more than four plus signs.
a(6) should contain at least 13 digits. After inserting a plus sign in the middle of numbers with 7, 8, 9 and 10 digits and performing the addition, the resulting sums must have at most 5, 5, 6 and 6 digits, respectively. Furthermore, after inserting a plus sign in the middle of any number with 11 or 12 digits and performing the addition, the result must be smaller or equal to, respectively, 1099998 and 1999998 < a(5). This means at most 4 plus signs would be required to collapse the result after the first application. It follows that all 7, 8, 9, 10, 11 and 12digit numbers can be collapsed using no more than 5 plus signs.  Simon Demers, Oct 30 2017 [Updated Nov 29 2017]
Between 10 and 10^71=9999999 inclusively, 270 numbers require only one plus sign, 175803 numbers require two plus signs, 5952451 numbers require three plus signs, 3866392 numbers require four plus signs, and 5074 numbers require five plus signs.  Simon Demers, Oct 29 2017
Conjecture: Digital root for terms a(n) > 0 is 1.  Simon Demers and J. Stauduhar, Nov 16 2017
Using bruteforce, no new term less than 10^9 was found.  J. Stauduhar, Nov 20 2017
Proof of claim that all a(n), n > 0, have digital root 1: Assume terms a(1) to a(n) all have digital root 1, but a(n+1) = x does not. Increment a(n) by one until we reach x. Insert one plus sign into x in the optimal way that guarantees that the result of the addition, y, requires exactly n more insertions of a plus sign to arrive at a single digit. Because y requires n insertions it cannot be less than a(n), otherwise we would have found y before a(n). Because x has digital root greater than 1, y cannot equal a(n). So y must be in the range a(n) < y < x, but we already checked these before arriving at x, so no such y can exist, therefore no such x can exist. Clearly, a(n+1) cannot have digital root 0. Since no a(n+1) = x with digital root 0 or 2 through 9 can exist, a(n+1) must have digital root 1. Q.E.D.  J. Stauduhar, Dec 08 2017


LINKS

Table of n, a(n) for n=0..6.
S. Butler, R. Graham and R. Stong, Inserting Plus Signs and Adding, The American Mathematical Monthly, 123(3), March 2016, 274279.
S. Demers, Minimum number of plus signs needed to collapse every integer 1..10^71=9999999. Calculated using bruteforce approach. Starting with i=1 and sequentially for each subsequent integer with d digits, all 2^(d1)1 possibilities to insert plus signs are considered in the first application. Then, lookup the minimum number of plus signs required to collapse each resulting integer after the first addition is performed. This dataset confirms a(1)=10, a(2)=19, a(3)=118, a(4)=3187, a(5)=3014173.
S. Demers, The smallest number that cannot be collapsed using fewer than 6 plus signs is 3003344034004, Amer. Math. Monthly, 126 (April 2019) 351.
