A)find a recurrence relation for the number of ternary strings of length n that do not contain two consecutive 0s. b) what are the initial conditions? c) how many ternary strings of length six do not contain two consecutive 0s?

Denote by the number of ternary strings of length n

Step-by-step explanation:

a) Let be a ternary string of length n. If , then S can be decomposed as where is a ternary string of length n-1 with no consecutive zeros. In this case, there are choices for therefore the number of strings S which last is digit 1 is . Similarly, the number of ternary strings S with is . We conclude that the number of strings S whose last digit is 1 or 2 is

Now, if , then or because S does not have consecutive zeroes. Then or where is a ternary string of length n-2 with no consecutive zeros. Thus, the number of such strings S is equal to the number of strings P whose last digit is 1 or 2 is . Applying the same reasoning from before, this number is equal to  .

Any string S has its last digit equal to 0,1 or 2 then by the sum rule, .

b) 0,1,2 are the strings of length 1 with no consecutive zeroes. Then . The corresponding strings of length 2 are 01,02,10,11,12,20,21,22, thus .

c) This follows froma applying the recurrence relation repeatdly. .

i need a picure

step-by-step explanation:

part a

answer: a reasonable domain is where n is a real number. so n can be between 0 and 10. both endpoints are included.

work shown:

n is the number of days after the experiment starts. the smallest n can be is n = 0 which means that 0 days have gone by, and we're at the start. to find out how large n should be, then replace f(n) with 16.13 and solve for n. use logarithms to isolate the exponent.

f(n) = 12*(1.03)^n

16.13 = 12*(1.03)^n

16.13/12 = (1.03)^n

1.34416666666667 = (1.03)^n

(1.03)^n = 1.34416666666667

log[ (1.03)^n ] = log[ 1.34416666666667 ]

n*log[ 1.03 ] = log[ 1.34416666666667 ]

n = log[ 1.34416666666667 ]/log[ 1.03 ]

n = 10.0062999823929

this rounds to n = 10 which is fairly close but not 100% perfect. so this is the largest n can be.

note: if you plug n = 10 into f(n), you'll get roughly 16.127 which rounds to 16.13 (this comes up again in part c)

=====================================

part b

answer: the y intercept is 12. it represents the starting height of the plant in cm.

work shown:

plug n = 0 into the f(n) function. simplify

f(n) = 12*(1.03)^n

f(0) = 12*(1.03)^0

f(0) = 12*(1)

f(0) = 12

on day n = 0, aka the starting point, the height f(n) is 12 cm

=====================================

part c

answer: the average rate of change is approximately 0.43061036458991 (round however you need to). this represents the average growth rate from day n = 3 to day n = 10. so the plant grew roughly 0.43 cm per day during this timespan, assuming you round to 2 decimal places.

work shown:

compute f(3)

f(n) = 12*(1.03)^n

f(3) = 12*(1.03)^3

f(3) = 13.112724 < we'll use this later

compute f(10)

f(n) = 12*(1.03)^n

f(10) = 12*(1.03)^10

f(10) = 16.1269965521294 < we'll use this later

now use the formula below with a = 3 and b = 10

aroc = average rate of change

aroc = [ f(b) - f(a) ]/[ b - a ]

aroc = [ f(10) - f(3) ]/[ 10 - 3 ]

aroc = (16.1269965521294 - 13.112724)/(10 - 3)

aroc = 3.0142725521294/7

aroc = 0.43061036458991

round this however you need to

note: the plant grew approximately 3.01 cm over 7 days, so roughly 0.43 cm per day is the average growth rate (if you were to round to 2 decimal places).