1 2 2 2 2 3

Prove that 1 2 2 2 2 3 2 n 1 2 n 1 for n 1 2 3.

1 2 2 2 2 3. In mathematics the kolakoski sequence sometimes also known as the oldenburger kolakoski sequence is an infinite sequence of symbols 1 2 that is the sequence of run lengths in its own run length encoding and the prototype for an infinite family of related sequences. A 1 1 1 1 2 2 2 2 3 3 4 5 5 output b 4 4 2 1 2 also i want to remove the duplicates from a. It is named after the recreational mathematician william kolakoski 1944 97 who described it in 1965 but subsequent. We know that x 1 3 x 3 3x 2 3x 1.

For n 1 the statement reduces to 2 2 22 1 3. Solutions to exercises on mathematical induction math 1210 instructor. A 1 2 3 4 5 how to solve the problem. If three geometric means are inserted between 5 and 40 what is positive geometric mean in solving problems involving rational algebraic equationshow we can solve this problem show your solution a lady just learned to drive it takes her.

You should sort the list before using groupby. 2 23 25 22n 1 2 22n 1 3 proof. Hi zamira i want to state the problem more precisely. New questions in math.

Putting x 1 2 n we get. Free math lessons and math homework help from basic math to algebra geometry and beyond. Students teachers parents and everyone can find solutions to their math problems instantly. 1 1 3 5 1 1 1 2 2 2 2 3 2 1 1 1 2 1 1 5 1 2 2 2 4 2 2 1 3 2 2 2 2 2 2 3 2 2 2 3 from psy 360 at st.

There are two steps in a proof by induction first you need to show that the result is true for the smallest value on n in this case n 1.