1 2 1 1
1 1 1 2 2 1
3 1 2 2 1 1
? ? ? ? ? ? ? ?
Each line describes the previous line (how many of each symbol there were). After 13112221,
1113213211. I can't see there being any characters but 1,2,3 in any of the later lines, and therefore also any character repeating more than 3 times in a line (ex.1 1 1 1). Also, in the long run, "1" to have most frequent appearance of the 3 numbers.
you can't solve something unless there is a problem. you might as well have said:
"bear, racecar, 7,???".
While I agree with matticus, I think both bel and Esd have devined what Dazzlex intended. And, of course, it has nothing to do with mathematics.
And yet, this thread is still sitting in the Number Theory section.
There are some interesting questions about the 'say what you see' sequence. See the work of Conway (its inventor) for more. And it is maths, Halls, though not necessarily number theory.
I don't think you have understood what Conway is saying.
Really? I don't? So the fact that JH Conway (a mathematician in a maths department; this doesn't automatically make it maths, of course - has Conway been quoted as saying 'and of course this is completely unrelated to the entirety of mathematics') has done some interesting mathematicalwork on this isn't sufficient for it to be maths? And Conway's constant isn't an interesting thing? What on earth does something have to be to be considered maths, then Halls? Perhaps be in a tedious book on calculus taught to engineers?
Exercise: prove that nearly all say what you see sequences (or look and say) have the ratio digits of consecutive numbers converges to a constant, further show it is algebraic, and find its minimal polynomial.
so close, it was actually badger.
I saw this puzzle on the last page of the book titled "mathematical mysteries:the beauty and mathematics of numbers" by Calvin C Clawson. I broke my head over it for awhile. And eventually couldn't resist the temptation to check the solution. Though the solution was there, plain and bare, there was not a description for how he arrived at the given solution.
Im glad i saw it on this thread today.
could it be??
1 3 1 1 1 2 1
No Bel and Esd got the right answer: "one 3 one 1 two 2's and two 1's" is the description of the previous term. The answer is this description in "shorthand", i.e., "13112221". See the posts by Matt Grime for more background on this type of sequence.
By the way, in general, this is called (decimal) run length encoding. While it may not have direct applications to most of number theory, algebra, or combinatorics (though clearly some) and likely no useful connections to any other field of mathematics, it is a very commonly used compression method (precisely because it is extremely simple) for fairly regular strings of words. Thus, it is both studied and used by computer scientists.
You have a base set, a set of words, and a subset of the natural numbers (could this be generalized to an ordered groupoid? I'm not sure) that you use to count them with.
In some cases, the encoding of your string isn't going to be unique, in some cases it is.
For instance, let's say your words are A, B, and C, and you're using the numbers 1-99
Then the string AAAAAAABBCCCCCBBBAAAA encodes to 7A2B5C3B4A, which is significantly shorter than the length of the original string. The nice thing about this encoded string is that when you look at each symbol you know immediately whether it's a word or a number by its position, so you can expand it very easily.
Let's say your words are instead 0:A 1:B 2:AB 3:AAB 4:AAAB
Then the string BAAABBAABAAAAABAABABBAAA encodes to 111411133023121130, though clearly this is not unique.
Furthermore, you can allow a lot of really weird things with your words, like letter that means "erase the previous symbol if one exists" or something like that.
The sequence that this topic was started about of course uses the the numbers 0-9 as words and the numbers 1-9 as counters. The interesting thing is that it's done in such a way so that you can keep applying the code to the result.
There are a lot of interesting problems with this type of encoding. For instance, given a set, finite number of words, a set bound on your counters, and a set of strings, how can you find the optimal set of words to encode the set, and how given such an encoding, how can you find the optimal encoding of each string?
It's also fairly easy to show (I have not done this. I have not even done more than heard this topic in passing, but the result is intuitive, and I've heard that it's not too difficult to show) that if the words need to be stored along with the encoding of the sets, that if an optimal set of words can always be found, encoding a second time cannot decrease the total number of symbols needed to store the encoding of the entire set of strings along with the words
Err... anyway, my point is that, yes, this is real math
Cool. I think I understand this sequence now. thanks
Well done to everyone who understood the problem. I saw it in a book and it startled me at first but after a while it just looked so simple, so I just had to share it :)
mathematical mysteries:the beauty and mathematics of numbers" by Calvin C Clawson
This is deductive reasoning right? Is the answer 13112221?
This is the general pattern that I see, is that right?:
x x x x x x x 1
x x x x x x 1 1
x x x x x x 2 1
x x x x 1 2 1 1
x x 1 1 1 2 2 1
x x 3 1 2 2 1 1
1 3 1 1 2 2 2 1
1 3 3 1 1 2 1 1
1 3 1 1 1 2 2 1
3 3 3 1 2 2 1 1
Separate names with a comma.