• :00Days
  • :00Hours
  • :00Mins
  • 00Seconds
A new era for learning is coming soonSign up for free
Log In Start studying!

Select your language

Suggested languages for you:
Answers without the blur. Sign up and see all textbooks for free! Illustration

Q15E

Expert-verified
Discrete Mathematics and its Applications
Found in: Page 511
Discrete Mathematics and its Applications

Discrete Mathematics and its Applications

Book edition 7th
Author(s) Kenneth H. Rosen
Pages 808 pages
ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Illustration

Short Answer

How many ternary strings of length six do not contain two consecutive 0'sor two consecutive 1's ?

There are 239 ternary strings of length six that do not contain two consecutive 0's or two consecutive 1's .

See the step by step solution

Step by Step Solution

Step 1: Given data

A string that contains only 0's, 1's and 2's is called a ternary string.

Step 2: Concept used of recurrence relation 

A recurrence relation is an equation that recursively defines a sequence where the next term is a function of the previous terms (Expressing Fn as some combination of Fi with i<n).

Step 3: Find the number of ternary strings

We will compute a2 through a6 using the recurrence relation:

a2=a1+2a0+2=3+2·1+2=7a3=a2+2a1+2a0+2=7+2·3+2·1+2=17a4=a3+2a2+2a1+2a0+2=17+2·7+2·3+2·1+2=41a5=a4+2a3+2a2+2a1+2a0+2=41+2·17+2·7+2·3+2·1+2=99a6=a5+2a4+2a3+2a2+2a1+2a0+2=99+2·41+2·17+2·7+2·3+2·1+2=239

Thus there are 239 ternary strings of length 6 that do not contain two consecutive 0's or two consecutive 1's.

Most popular questions for Math Textbooks

Icon

Want to see more solutions like these?

Sign up for free to discover our expert answers
Get Started - It’s free

Recommended explanations on Math Textbooks

94% of StudySmarter users get better grades.

Sign up for free
94% of StudySmarter users get better grades.