Mathematics : asked on ximena68
 30.06.2021

How many bit strings of length 10 do not contain the substring 00? In other words, how many strings of length 10, consisting only of 1 and 0, in which there are no two consecutive zeros? (In response, write down only the number without spaces.)

. 0

Step-by-step answer

09.07.2023, solved by verified expert
Unlock the full answer

  144

Step-by-step explanation:

For a bitstring of length n, there are Fibonacci(n+2) strings containing no two consecutive zeros. This can be seen by constructing the strings starting with n=1.

1-bit strings: 1, 0 -- 2 strings not containing consecutive 0s

2-bit strings: 11, 10, 01 -- 3 strings not containing consecutive 0s

Note that we have added 1 to all the 1-bit strings, and added 0 only to the string ending in 1.

3-bit strings: 111, 110, 101, 011, 010 -- 5 strings not containing consecutive 0s

Note that these 5 strings consist of all (3) of the 2-bit strings with 1 appended, and all (1) of the 2-bit strings ending in 1 with 0 appended. The number that now end in 0 is the number previously ending in 1.

__

If (x, y) represents the numbers of n-bit strings ending in (0, 1), then the number of (n+1)-bit strings ending in (0, 1) is (y, x+y). That is, the recursive relation is ...

  How many bit strings of length 10 do not contain, №18010523, 30.06.2021 14:40

For n=1 to n=10, these pairs are ...

  (1, 1), (1, 2), (2, 3), (3, 5), (5, 8), (8, 13), (13, 21), (21, 34), (34, 55), (55, 89)

The sequence of b[n] values is ...

  2, 3, 5, 8, 13, 21, 34, 55, 89, 144

which are the n=3 to n=12 numbers from the Fibonacci sequence.

That is, there will be Fibonacci(12) = 144 10-bit strings with no consecutive 0s.

It is was helpful?

Faq

Mathematics
Step-by-step answer
P Answered by Specialist

  144

Step-by-step explanation:

For a bitstring of length n, there are Fibonacci(n+2) strings containing no two consecutive zeros. This can be seen by constructing the strings starting with n=1.

1-bit strings: 1, 0 -- 2 strings not containing consecutive 0s

2-bit strings: 11, 10, 01 -- 3 strings not containing consecutive 0s

Note that we have added 1 to all the 1-bit strings, and added 0 only to the string ending in 1.

3-bit strings: 111, 110, 101, 011, 010 -- 5 strings not containing consecutive 0s

Note that these 5 strings consist of all (3) of the 2-bit strings with 1 appended, and all (1) of the 2-bit strings ending in 1 with 0 appended. The number that now end in 0 is the number previously ending in 1.

__

If (x, y) represents the numbers of n-bit strings ending in (0, 1), then the number of (n+1)-bit strings ending in (0, 1) is (y, x+y). That is, the recursive relation is ...

  (x_1,y_1)=(1,1)\\(x_n,y_n)=(y_{n-1},\,x_{n-1}+y_{n-1})\\b_n=x_n+y_n\quad\text{number of n-bit strings without consecutive 0s}

For n=1 to n=10, these pairs are ...

  (1, 1), (1, 2), (2, 3), (3, 5), (5, 8), (8, 13), (13, 21), (21, 34), (34, 55), (55, 89)

The sequence of b[n] values is ...

  2, 3, 5, 8, 13, 21, 34, 55, 89, 144

which are the n=3 to n=12 numbers from the Fibonacci sequence.

That is, there will be Fibonacci(12) = 144 10-bit strings with no consecutive 0s.

Mathematics
Step-by-step answer
P Answered by PhD

SI=(P*R*T)/100

P=2000

R=1.5

T=6

SI=(2000*1.5*6)/100

=(2000*9)/100

=180

Neil will earn interest of 180

Mathematics
Step-by-step answer
P Answered by PhD

The solution is in the following image

The solution is in the following image
Mathematics
Step-by-step answer
P Answered by PhD

y=2x+15

where y=Value of coin

x=Age in years

Value of coin after 19 years=2*19+15

=$53

Therefore, Value after 19 years=$53

Mathematics
Step-by-step answer
P Answered by PhD
The answer is in the image 

The answer is in the image 

Mathematics
Step-by-step answer
P Answered by PhD

The answer is in the image 

The answer is in the image 
Mathematics
Step-by-step answer
P Answered by PhD

Here,

tip=18%of $32

tip=(18/100)*32

=0.18*32

=$5.76

Total payment=32+5.76=$37.76

Mathematics
Step-by-step answer
P Answered by PhD

Speed=Distance/time

Here,

distance=15m

time=1sec

speed=15/1=15m/sec

Distance=Speed*time

time=15min=15*60sec=900sec

Distance travelled in 15 min=15*900=13,500m

=13500/1000 km=13.5Km

Try asking the Studen AI a question.

It will provide an instant answer!

FREE