Explore BrainMass
Share

# Discrete Math-Induction

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

A flagpole is n feet tall. On this flag pole we display flags of the following types: red flags that are 1 foot tall, blue flags that are 2 feet tall and green flags that are 2 feet tall. The sum of the heights is exactly n feet.

Prove that there are exactly [(2/3)*(2^n)] + [(1/3)*(-1)^n] ways to display the flags.

© BrainMass Inc. brainmass.com March 22, 2019, 12:38 am ad1c9bdddf
https://brainmass.com/math/recurrence-relation/discrete-math-induction-507485

#### Solution Preview

Let d_n denote the number of possible ways to display the flags on an n-foot tall flagpole. Now the flag on top may be red, green, or blue. The number of possible ways to display the flags with a red one on top is ...

#### Solution Summary

We derive by induction a formula for the number of ways flags of three different colors and two different heights can be displayed on a flagpole of a given fixed height.

\$2.19