Purchase Solution

general rule

Not what you're looking for?

Ask Custom Question

Let a(subn) equal the number of ternary strings of length n made up of 0s,1s,and 2s, such that the substrings 00,01,10, and 11 never occur.
Prove that a(subn)= a(subn-1) + 2a(subn-2), (n>=2) with a(sub 0)=1 and a(sub1)=3 Then find a formula for a(sub n)

Purchase this Solution

Solution Summary

Assess the empty string.

Purchase this Solution


Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts