Nate Cartagena April 3, 2009 Math Experimentations See-Say Sequence There are many numbers that follow observable

patterns. The patterns that these numbers follow are called sequences, since a sequence is just an ordered set of quantities. Sequences can be very interesting and many times very useful, since they can estimate numbers accurately as well as demonstrate the way that a real action in the world might behave. An interesting sequence of numbers, which we will call the See-Say Sequence, is a sequence that is not defined by a function as many sequences are, but rather it is created from an algorithm. The first term is arbitrarily chosen. Then the next term is given by reading the previous term aloud, digit by digit. If there are consecutive digits then it is read as the quantity of the digit in a row. If there is only one digit and the following digit is different, then it is read as one [given digit], followed by whatever may come after. The sequence can start with any number, but depending on the first term there may be some different patterns that emerge. For claritys sake, lets work on developing a sequence starting with the number 1. We choose one.......................................................... First term There is 1 one, therefore....................................... Second term There are 2 ones, therefore....................................Third term There is 1 two, and 1 one, therefore......................Fourth term The sequence would continue this pattern................Fifth term Sixth term Seventh term Eighth term Ninth term Tenth term 1 11 21 1,211 111,221 312,211 13,112,221 1,113,213,211 31,131,211,131,221 13,211,311,123,113,112,211

From this, we see the sequence that would be created starting with the number 1 and the very specific way that it would expand. The above demonstrates the unique way that the sequence beginning with 1 would grow. Let us now explore some properties of this curious sequence. Theorem 1: There can never be a digit in any term that is greater than 3 if the sequences first term is 1. [Discussion: We know that there can never be a digit in any term that is greater than 3. This is because of the nature of how this sequence is created. Consider how a 4 would enter the sequence; there would have to be a term that contained a sequence numbers of 1,111; 2,222; or 3,333, which would yield 41, 42, or 43, respectively. None of these numbers can enter a sequence starting with 1.] We obviously need at least 4 digits to create a four, so lets consider four consecutive digits in a given term, . Assume that is the quantity of and is the quantity of from the previous term, then there should

only be one digit for the quantity of if = . So we see that if are written correctly, then under the given assumption. The other possibility is that we assume that there are 1, 2 or 3 of , many of , and many of 1, 2 or 3. It is immediately clear that , because if = then there would just be some quantity of and no reason for the or . By this we see that there can never be four digits of the same number in a row, so a sequence will never contain a number greater than three, (unless the original term was greater than 3). Continuing, there are many more ideas about how the See-Say Sequence behaves. Corollary 1.1: There will never be more than 3 twos or ones in a row in any digit of the sequence beginning with 1. By theorem 1, there can never be a number greater than 3, therefore this implies that there will never be more than 3 twos or 3 ones in a row, because 4 or more twos or 4 or more ones in a row would bring a 4 into the sequence. Corollary 1.2: If the first term of a sequence does not contain any digit greater than 3 or a part of the first term does not have more than three (such that the quantity ends in a last digit greater than 3) of any digit in a row, then there will never be a digit greater than three. By the characteristics of this sequence, digits greater than three can only enter the sequence one of two ways, which are [1]a number greater than 3 is chosen in the first term or [2]more than 3 of any digit in a row are chosen as the first term, which would cause the second term to have a number greater than three. The reason for [1] is by extension of theorem 1, and the reasoning for [2] is formed in the Discussion of theorem 1. Since the assumptions of corollary 1.2 insist both conditions [1] and [2] are negative, then it is obvious that there will never be a digit greater than three any where in the continuation of these sequences. Corollary 1.3: If a digit greater than 3 enters the sequence, it was in the first or second term and there will not be another digit greater than 3. By corollary 1.2 we see that there can never be a digit greater than three unless it entered by reasons [1] or [2] of corollary 1.2. This is to say that the number enter as one of the two following: The sequence started with a number like 7, which would yield 17, and 1117, and 3117 and so on and so forth. Or The sequence started with a number like

111,111,111,111,1111, which would yield 151, and 111511, and 311521 and so on. It is obvious from the two examples that a number greater than three could enter in the first or second term. But the reason another number greater than three will not enter after second term is because neither reason [1] or [2] could be satisfied after. Therefore, we can conclude that if a number greater than three enters a sequence, then it entered in the first or second term, and no more digits thereafter will have more digits greater than three in comparison to the second term. Theorem 2: The sequence starting with one can have a maximum of one term that has an odd number of digits, and that term is the first term. Our first term has an odd number of terms and it was chosen this way. Since this sequence works by grouping quantities of numbers in a row with the label of the number that was grouped (this is to say many of or many of ), then it is obvious that terms can only be made up of these two digit sub-parts. Therefore, every term after the first must have an even number of terms. Corollary 2.1: A sequence starting with any number can have a maximum of two terms that have an odd number of digits, and those terms must be the first two. Since a first term could have an odd number of digits, since it is chosen, then this term obviously has the potential to have an odd number of digits. Also, since the first term could have enough consecutive terms that the quantity reaches an even number of digits, then these quantity digits could force a sequence to have two odd terms. For example, if we started with the number 11,111,111,111 we see that we have 11 ones and the next term would be 111. The number after that would be 31. We see that the first two terms had an odd number of digits, but by the third term of the sequence a term that would have to follow the many of or many of model that forces single digit quantities labeling single digits. Therefore by theorem 2, we see that after those maximum of two odd terms that there will be no more terms with an odd number of digits. Theorem 3: There are never more than 2 threes in a row in a sequence whose first term is 1. To prove this, lets consider how 3s can be grouped together. Lets assume that we have a term that has 3 threes in a row, followed by 3 ones. [1] [2] We have which would yield 333,111 3331.

This example would work similarly with the threes followed by 3 twos. More importantly it shows that we can get 3 threes in a row, given that we have 3 threes already and we are given those threes followed by 3 ones or twos , but how would we get that term in [1]. By theorem 2, the term in [1] could be valid since it has an even number of digits, but what would the term before it have been. [a] We have 333,111.

To figure out what would have been before it, we need to use the idea of pairing and reverse engineer the sequence. This means that the term [a] implies 3 threes, 3 ones and 1 one came before it. This is to say. [b] Term [a] implies came before it. 33311111

Term [b] is impossible because there are 5 ones in a row which contradicts theorem 1. The other case allowable by theorem 2 is that 333,111 is part of a larger term, in the form 3,331,11. Right away that terms is impossible because it contradicts how this sequence works, since it implies that there were threes followed by 3 threes. Since the example is similar to any other way that 3 threes can be in a row, then by exhaustion we have that there can never be more that 2 threes in a row, for the sequence beginning with 1. Corollary 3.1: After the first two terms of any sequence, there can never be more than 2 threes in a row for any sequence. [Discussion: The reason that corollary 3.1 holds is the reasoning used in theorem 3. In that logic, we realized that to get 3 threes in a row, then we must have 3 threes in a row followed by 3 of any other digit. Therefore there could be two terms that have 3 threes in a row, but they would have to be the first two terms, because there is no way to 3 threes in a row otherwise.] Consider we have 333,777 then that would yield 3337. The next term: 3317. It is easy to see from that example and reasoning from theorem 3 that after the first two terms that a sequence would no longer have more than two threes in a row and would have to follow theorem 3 from there after and corollary 3.1 is proven. Theorem 4: The See-Say Sequence beginning with 1 is strictly increasing from term to term. The base case is proven on page one since all of the first ten terms hold. To approach all terms after that, lets consider the number of digits from term to term.

The only possible number groups that could decrease a terms number of digits are 222 (which yields 32) and 111 (which yields 31). These number groups, which we will call the triplets, could potentially be part of any term in the sequence beginning with one. It is easy to see that these numbers turn three digits into two in the following term, meaning that they decrease the number of digits by one. Also, there can be no triplets greater than the one composed of twos according to theorem 3. It is also important to note the duos, which are 2 ones, 2 twos, or 2 threes that yield 21, 22, and 23 respectively. The numbers that the duos yield have the same number of digits as the duos that created them, maintaining a status qou of the number of digits from one term to the next. The last type of number group is that where there are no similar consecutive digits. They are ones, twos, or threes followed by a different digit. They transform one digit into two from one term to the next and will be called doublers. From this observation, it is clear that if the quantity of triplets is equal to the quantity doublers, then it is obvious that a term will have the same number of digits as the previous. Continuing, since we are not dealing with the first term in this case, then by theorem 2 there must be an even number of digits in every term so if triplets are to completely compose a term then they must come in pairs of triplets to remain an even number. When setting up a term that has only triplets, there quickly arise many problems. [Theorem 5] For instance, 111,222,111, could never exist because it implies that the term before it consisted (from left to right) of 1 one, 1 two, 2 twos, etc. This is to say the previous term started with 1222, which should yield 1132. This does not match the beginning of the term above, therefore it is inconsistent and shows that these two triplets cannot be consecutive in this order. A term beginning with 222,111,222 could be proven inconsistent in a similar manner, which also implies that these two triplets cannot be consecutive in this order either. By exhaustion, triplets cannot be consecutive. Therefore, we can conclude that a term cannot consist of only triplets and there can be never be consecutive triplets. Also, it is impossible to compose a term that consists of only duos and triplets. We should notice that triplets cannot surround duos and still have the term be consistent. [Theorem 6] For instance, 11,122,111 could never exist because it implies that the term before it consisted (from left to right) of 1 one, 1 two, 2 ones, and 1 one. This is to say the previous term was 12111. This term should yield 111,231 which is not consistent with the term above, therefore it is inconsistent.

Similarly it could be shown that for the example, the digit of the triplet could be changed to two and/or the digit of the duo could be changed to one or three (as long it is not the same digit as the triplet) without changing the result of inconsistency. This is because 22,233,111 would also be inconsistent through a similar approach as the one used for 11,122,111. Also, there could be infinitely many duos in between the triplets without changing the result of inconsistency. This is because 11,122,[infinitely many duos],111 would prove inconsistent as the example above because the second digit of the last duo before the triplet would be the number that marks the quantity of the first digit of the last triplet. This is to say that the last four digits would break the rules for the sequence since quantities of the same number are given in a row. (Remember back to theorem 1s proof that if is the quantity of and is the quantity of from the previous term). [Discussion: It is trivial if the duos strung together make 4 or more of the same digit in a row or if the duo following or preceding either triplet is the same digit as the triplet, because these are obviously against the rules of how the See-Say Sequence would work for the sequence starting with the first term of 1.] Based on the facts, which will be called theorems 5 and 6, we can see that there must be doublers in every term and there must be at least as many doublers as triplets since the total number of digits has to even by theorem 2. This implies that every term must have at least the same number of digits as the term previous to it. Now: If a term starts with (a) doubler/s, then the following term will have to have more digits in it than the term previous, and the sequence will have increased. (If a term starts with doublers and there are at least as many doublers in between triplets, then this result was obvious.) If a term starts with a triplet then we know the smallest number that can be created will have the same number of digits. But since this term started with 3 twos or 3 ones, then the first digit of the new term will have to be bigger since it will be a 3 and the sequence will have again increased. If a term starts with (a) duo/s, then get past it/them until a doubler or triplet is found. From the previous two results the sequence will have to increase. Therefore, the See-Say Sequence beginning with 1 will be strictly increasing. Observation 4.1: Almost all See-Say sequences will be strictly increasing (will conform to theorem 4) by the latest after the first two transformations, with one exception. The sequences that take one or two terms to conform are a.) The first term of a sequence could be comprised of more triplets than doublers. Example: 3331 yields

3311 which yields 2321. This is increasing hereafter. b.) The first term of a sequence could be comprised of more consecutive digits in a row than there are doublers to compensate. Example: 11,111,111,111 yields 111 which yields 31. This is increasing hereafter.

c.) The first term of a sequence is comprised of only duos. Example: 2,233,113,322 yields 2,223,212,322. This is increasing hereafter.

d.) There is a possible first term that keeps a sequence constant number of digits regardless of the number of the term. This is the only non-conforming sequence. It will be addressed in theorem 8. By observations it has be noticed that after two transformations, terms will conform to theorem 4. [This is not a proof, but is worthwhile to note.] Theorem 5: In the sequence beginning with 1, there can never be any triplets in a row. This is proven in the proof for theorem 4. Theorem 6: In the sequence beginning with one, triplets cannot surround only duos. This is proven in the proof for theorem 4. Theorem 7: Any term in a given See-Say Sequence will have the same last digit. This theorem stems from the fact that each term is determined from left to right. Since the last digit is the rightmost digit, then it will always be the same and always will be preceded by the digit representing its previous quantity in a row, from term to term. Theorem 8: The sequence beginning with 22 will have every term be 22. Since 22 is the first term, then performing the procedure to determine the next term would yield 22. We can assume that the nth term will be 22 as well. Performing the procedure to determine the next term would again, yield 22. Therefore the (n+1)th term is 22 and every term would have to be 22. This is to say that no matter how many times we perform the procedure for determining the next term, that we will still have a result of 22.

Additional Observations: [1] A sequence whose first term is 1 will have a pattern of every third term in the sequence starting with a non-one digit. More specifically, every third term will start with 3, except for the third term which begins with 2. Referring back to the example given on page 1, it can be observed that the See-Say Sequence with a first term of 1, indeed, does follow [1] to at least the tenth term, but this observation may be un-provable. [2] The sequence that has a first term of 1 will never have a term that starts with 2 threes. If [1] were provable, then [2] would be its corollary. Since the sequence cant start with a 2 after the third term and there are no threes until after that point then it is clear that there should never be 2 threes at the beginning (or only 2 ones either). Conclusion: The See-Say Sequence is a sequence that is differs from many other sequences. It is not based on a function as many others are, but is rather a fusion of math and English. Hopefully its behavior has proven interesting and given any studier of its qualities some food for thought. Below is a concise table of its observed behaviors.

Summary of Theories, Corollaries, and Observations Name Th. 1 Cor. 1.1 Cor. 1.2 Cor. 1.3 Th. 2 Cor. 2.1 Th. 3 Cor. 3.1 Th. 4 Obs. 4.1 Th. 5 Th. 6 Th. 7 Th. 8 Obs. [1] Obs. [2] Description There can never be a digit in any term that is greater than 3 if the sequences first term is 1. There will never be more than 3 twos or ones in a row in any digit of the sequence beginning with 1. If the first term of a sequence does not contain any digit greater than three or a part of the first term does not have more than three (such that the quantity ends in a last digit greater than 3) of any digit in a row, then there will never be a digit greater than three. If a digit greater than 3 enters the sequence, it was in the first or second term and there will not be another digit greater than 3 Any given sequence can have a maximum of one term that has an odd number of digits, and that term must be the arbitrarily chosen first term. A sequence starting with any number can have a maximum of two terms that have an odd number of digits, and those terms must be the first two. There are never more than 2 threes in a row in a sequence whose first term is 1. After the first two terms of any sequence, there can never be more than 2 threes in a row for any sequence. The See-Say Sequence beginning with 1 is strictly increasing from term to term. Almost all See-Say sequences will be strictly increasing (will conform to theorem 4) by the latest after the first two transformations, with one exception. See above section about Obs. 4.1 for exceptions. In the sequence beginning with 1, there can never be any triplets in a row. In the sequence beginning with one, triplets cannot surround only duos. Any term in a given See-Say Sequence will have the same last digit The sequence beginning with 22 will have every term be 22. A sequence whose first term is 1 will have a pattern of every third term in the sequence starting with a non-one digit. More specifically, every third term will start with 3, except for the third term which begins with 2. The sequence that has a first term of 1 will never have a term that starts with 2 threes (or ones.