1. (2.5 points) Find a recurrence relation for the number of ways to arrange three types...

Transcribed Image Text:

1. (2.5 points) Find a recurrence relation for the number of ways to arrange three types of flags on a flagpole n feet high: red flags (1 foot high), gold flags (1 foot high), and green flags (2 feet high). Don't solve the recurrence relation. 2. (2.5 points) Find a recurrence relation for the number of n-digit ternary sequences with no consecutive digits being equal. (A ternary sequence is a sequence all of whose elements are the digits 0, 1 or 2.) Don't solve for an. 1. (2.5 points) Find a recurrence relation for the number of ways to arrange three types of flags on a flagpole n feet high: red flags (1 foot high), gold flags (1 foot high), and green flags (2 feet high). Don't solve the recurrence relation. 2. (2.5 points) Find a recurrence relation for the number of n-digit ternary sequences with no consecutive digits being equal. (A ternary sequence is a sequence all of whose elements are the digits 0, 1 or 2.) Don't solve for an.

Answer rating: 100% (QA)

1 Assume Sn is the total number of configurations for the ... View the full answer