Answer:
Step-by-step explanation:
Given that:
where;
the top vertex = (0,0,1) and the base vertices at (0, 0, 0), (1, 0, 0), (0, 1, 0), and (1, 1, 0)
As such , the region of the bounds of the pyramid is: (0 ≤ x ≤ 1-z, 0 ≤ y ≤ 1-z, 0 ≤ z ≤ 1)
2
let 'x' = number
x³ - x² = 2x
x³- x² - 2x = 0
x(x² - x - 2) = 0
x(x - 2)(x + 1) = 0
x = -1, 0, 2
the only positive solution is the number 2
The minimum number of Halle will have 15 stacks.
Answer: $4.20