Gretchen has a set of blocks of heights 1, 2, and 4-centimeters. Imagine stacking the blocks one on top of the other to make a tower of height n centimeters. For example, a tower of height 6 centimeters could be made by stacking 6 1-cm blocks, 3 2-cm blocks, a 4-cm block on top of a 2- cm block, a 2-cm block on top of a 4-cm block, etc. (Order in the stack matters, think of the blocks of different heights as different colors and the stack looks different if two different color blocks are switched.) Let me be the number of ways to construct a tower of height n centimeters. Find a recursive formula for nB and try to find a formula that only depends on n.

=++

Step-by-step explanation:

=multiple ways to climb a tower

When n = 1,

tower= 1 cm  

= 1

When n = 2,

tower =2 cm   

= 2

When n = 3,

tower = 3 cm

it can be build if we use three 1 cm blocks

= 3

When n = 4,

tower= 4 cm

it can be build if we use four 1 cm blocks

= 6

When n > 5

tower height > 4 cm

so we can use 1 cm, 2 cm and 4 cm blocks

so in that case if our last move is 1 cm block then will be

n —1 cm

if our last move is 2 cm block then will be

n —2 cm

if our last move is 4 cm block then will be

n —4 cm

=++

domain is all the x values included in the

0 ≤ x ≤ 2

range is all the y values of the graph

-2 ≤ y ≤ 2

***keep in mind that there are different ways to show domain and range

hope this !

~just a girl in love with shawn mendes