Problem 1 tells us that a rectangular piece of cardboard of dimensions is used to make an open-top box by cutting out a small square of side from each corner and bending up the sides. If , then the volume of the box is . Starting from this initial guess of , the problem asks us to use Newton’s method to find a value of for which the box has volume 100, accurate to 3 significant figures.

To solve the problem, first we observe that for any , the volume of the box is , as a quick diagram would indicate. We want to solve the equation

using Newton’s method. Since the method is designed to solve equations of the form , we take . In the method, we begin with an initial guess and then compute further guesses by means of the formula

In the case that concerns us, and (using the product rule) .

The file below was produced using the software package Sage, which can be downloaded for free at the link. (As a side note, if you expect through your careers you will be doing a significant amount of non-trivial computations, it may be a reasonable investment of time to learn how to use one or two software packages. I like Sage personally, but of course there are many other alternatives, although not all are free.)

In the file, the value of each new guess is shown both exactly (as a fraction) and then numerically. As can be seen from the computations above, is a very reasonable approximation to the solution of .

Problem 2 tells us that the U.S. post office will accept a box for shipment only if the sum of the length and girth (distance around) is at most 108 in. We are asked to find the dimensions of the largest acceptable box with square front and back.

To solve this problem, we imagine a box with square front of side length , and width . We are told that . We are also asked to maximize the volume of the box. But the volume can be easily computed by the formula . Clearly, if we fix the value of and increase the value of , the volume increases. This means that we may as well suppose that . Then and

We need to optimize this volume subject to the restrictions that and . For this, we solve . We have

We have that iff or . Hence, we need to check the value of when , , and .

In the first and last cases, . In the second one, . It follows that this is the maximum volume, and it is achieved when inches, and inches.

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Thursday, November 11th, 2010 at 2:53 pm and is filed under 170: Calculus I. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

I thought about this question a while ago, while teaching a topics course. Since one can easily check that $${}|{\mathbb R}|=|{\mathcal P}({\mathbb N})|$$ by a direct construction that does not involve diagonalization, the question can be restated as: Is there a proof of Cantor's theorem that ${}|X|

First of all, note (as Monroe does in his question) that if $\mathbb P,\mathbb Q$ are ccc, then $\mathbb P\times\mathbb Q$ is $\mathfrak c^+$-cc, as an immediate consequence of the Erdős-Rado theorem $(2^{\aleph_0})^+\to(\aleph_1)^2_2$. (This is to say, if $\mathbb P$ and $\mathbb Q$ do not admit uncountable antichains, then any antichain in their product ha […]

The technique of almost disjoint forcing was introduced in MR0289291 (44 #6482). Jensen, R. B.; Solovay, R. M. Some applications of almost disjoint sets. In Mathematical Logic and Foundations of Set Theory (Proc. Internat. Colloq., Jerusalem, 1968), pp. 84–104, North-Holland, Amsterdam, 1970. Fix an almost disjoint family $X=(x_\alpha:\alpha

At the moment most of those decisions come from me, at least for computer science papers (those with a 68 class as primary). The practice of having proceedings and final versions of papers is not exclusive to computer science, but this is where it is most common. I've found more often than not that the journal version is significantly different from the […]

The answer is no in general. For instance, by what is essentially an argument of Sierpiński, if $(X,\Sigma,\nu)$ is a $\sigma$-finite continuous measure space, then no non-null subset of $X$ admits a $\nu\times\nu$-measurable well-ordering. The proof is almost verbatim the one here. It is consistent (assuming large cardinals) that there is an extension of Le […]

R. Solovay proved that the provably $\mathbf\Delta^1_2$ sets are Lebesgue measurable (and have the property of Baire). A set $A$ is provably $\mathbf\Delta^1_2$ iff there is a real $a$, a $\Sigma^1_2$ formula $\phi(x,y)$ and a $\Pi^1_2$ formula $\psi(x,y)$ such that $$A=\{t\mid \phi(t,a)\}=\{t\mid\psi(t,a)\},$$ and $\mathsf{ZFC}$ proves that $\phi$ and $\psi […]

A notion now considered standard of primitive recursive set function is introduced in MR0281602 (43 #7317). Jensen, Ronald B.; Karp, Carol. Primitive recursive set functions. In 1971 Axiomatic Set Thoory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967) pp. 143–176 Amer. Math. Soc., Providence, R.I. The concept is use […]

The power of a set is its cardinality. (As opposed to its power set, which is something else.) As you noticed in the comments, Kurepa trees are supposed to have countable levels, although just saying that a tree has size and height $\omega_1$ is not enough to conclude this, so the definition you quoted is incomplete as stated. Usually the convention is that […]

The key problem in the absence of the axiom of replacement is that there may be well-ordered sets $S$ that are too large in the sense that they are longer than any ordinal. In that case, the collection of ordinals isomorphic to an initial segment of $S$ would be the class of all ordinals, which is not a set. For example, with $\omega$ denoting as usual the f […]