Thread: Surface Area Problem.

In a beehive, each cell is a regular hexagonal prism, open at one end with a trihedral angle at the other end. It is believed that bees form their cells in such a way as to minimize the surface area for a given volume, thus using the least amount of wax in each cell construction. Examination of these cells has shown that the measure of the apex angle theta is amazingly consistent. Based on the geometry of the cell it can be shown that the surface area S is given by

S=6sh-(3/2)s^2*cot(theta)+[(3s^2*(3)^.5)/2]*csc(theta)

where s, the length of the sides of the hexagon, and h, the height, are constants.

a) Calculate ds/d(theta)

b) What angle should the bees prefer?

c) Determine the minimum surface area of the cell in terms of s and h.

a) Differentiate with regards to .
b) Find the angle that gives the smallest surface area (use the result from a).
c) Use the result from b.

Originally Posted by wair

a) Calculate ds/d(theta)

do you mean ?

I'm sorry I mean dS

Mondreus do I need to do implicit differentiation ?

No. S is the function and s is simply a constant.

Oh i see thank you

OK so for part a I get, dS/d(theta) = (3/2)s^2 * csc^2(theta) - [(3s^2)(3)^.5]/2*csc(theta)cot(theta). can someone confirm if this is right ?

For part B would I set my derivative to zero and find the min like any max min problem ? And then for part C it says find the minimum surface are in terms of s and h, but my derivative doesn't have an h.

I will check a) if you post the original problem and your solution in LaTeX code. Your approach to b) is correct. As for c), it is clearly stated that s and h are constants, so you simply exchange for the angle you found in b) (in the S function).

That looks correct. You can also check your answer here: webMathematica Explorations: Step-by-Step Derivatives

Ok that's good. One more question, for part c I'm assuming I plug in the value of theta that I get into the original surface area function because there is no h term in my derivative. correct ?

Yes. It's a standard minimization problem.