Premier bank is planning to have a new building constructed. they would like the length of the building to be 40 feet longer than its width. to fit their needs, each floor of the building will add 12 feet to the height of the building. the cost of the foundation of the building will be $10 per square foot. the cost for each successive floor of the building will be $35,000. they plan to spend $1,180,000 on construction. they would also like the perimeter of the building to be 3 times the height of the building. create a system of equations to model the situation above, and use it to determine how many of the solutions are viable.

Let L, W, F, H, P represent, respectively, the length, width, number of floors, height, and perimeter of the building. Here are some equations that model the given information.

We can rewrite these into a system of equations involving L, W, F.

Let's look first at the relation between the perimeter and height. The two versions of perimeter are equal to each other, so we have (after substituting for H) ...

... 3H = 2(L+W)

... 3(12F) = 2((W +40) +W) . . . . substitute for H and L

... 36F = 4W +80 . . . . . . . . . . . simplify

... 9F = W +20 . . . . . . . . . . . . . divide by 4

Now, we can look at the cost equations.

... 1180000 = 35000F + 10W(W+40) . . . . . substitute for the various cost terms and for L

... 118000 = 3500F +W² +40W . . . . . . . . . divide by 10

The two simplified equations in W and F are ...

You can solve the first for F and substitute for F in the second. Then you have a quadratic equation in W that can be solved by the usual methods. (Likely, the quadratic formula would be the best choice.) Here, we have elected to let a graphing calculator show the two solutions. One solution has negative dimensions, so is clearly infeasible.

There is one (nearly feasible) solution:

... W ≈ 180.788

... F ≈ 22.31

There is no combination of floor dimensions and integral numbers of floors that will match all of the problem requirements.

_____

A solution that comes about as close as possible is ...

its a little blurry tbh

step-by-step explanation: