Aset of blocks contains blocks of heights 1, 2, and 4 centimeters. imagine constructing towers by piling blocks of different heights directly on top of one another. (a tower of height 6 cm could be obtained using six 1 cm blocks, three 2 cm blocks, one 2 cm block with one 4 cm block on top, one 4 cm block with one 2 cm block on top, and so forth.) let t, be the number of ways to construct a tower of height n cm using blocks from the set. (assume an unlimited supply of blocks of each size.) find a recurrence relation for t,, t2, t3, : for each integer, n 2 5, tn = need ? read it talk to a tutor save progress submit answer

hi,

i'm 75% sure the answer is 1,1 to both lines.

have a great day

5y

step-by-step explanation:

step-by-step explanation:

descending order means to order the polynomials from the term with the largest exponent to the term with the smallest exponent.  

therefore, the correct answer is d.  

(b) 240

step-by-step explanation:

first, we use the pythagorean formula using the given side lengths to find x. then we use x to find the side lengths. then we add the side lengths to find the perimeter.

pythagorean theorem formula:

a^2 + b^2 = c^2

(x - 20)^2 + (x - 40)^2 = x^2

x^2 - 40x + 400 + x^2 - 80x + 1600 = x^2

x^2 -120x + 2000 = 0

(x - 100)(x - 20) = 0

x - 100 = 0 or x - 20 = 0

x = 100 or x = 20

we see that the solution x = 20 must be discarded because it will give a negative side length and a side length of 0. the only valid solution is x = 100.

perimeter = sum of the lengths of the sides

perimeter = x + x - 20 + x - 40

perimeter = 3x - 60

replace x with 100.

perimeter = 3(100) - 60

perimeter = 300 - 60

perimeter = 240