STATEMENT: A line of length $p$ is to be cut up into $4$ parts and put together as a rectangle. Show that the area of the rectangle will be a maximum
if each of its sides is equal to $1/4p$.
PROBLEM: Method #2 down here solves it. My intuition is correct ?
PDF of book is here, page 107.
Method #1: Dividing into 4 equal parts. Area A = $p^2/16$ . Area will be maximum or minimum when derivatives is equal to zero. $$\frac{dA}{dp} = \frac p8 \iff \frac p8 = 0 \iff p = 0$$. That is minimum I guess but we have to find the maximum
Method #2: Since it is a rectangle, area $A$ of rectangle with length $L$ and width $W$, is $L\cdot W$. lets say $L = 0.19p$ and $W = 0.31p$ (because circumference of rectangle is equal to the length of the rope $\iff 2L + 2W = P$ which means $2\cdot 0.19 + 2\cdot 0.31 = 0.38 + 0.62 = 1.0$. Hence our estimation of this length is correct. $$A = 0.19p * 0.31p = 0.0589p^2$$
$$\frac{dA}{dP} = 2 \cdot 0.0589 \cdot p \iff 2 \cdot (fractional) \cdot p \iff 2p \cdot (fraction) $$
Hence $A$ is $2p$ multiplied by some $fraction$ (rational or irrational). $2p$ is kind of constant but this $fraction$ will vary for different pieces of lengths of rope. Hence $A$ will be maximum when $fraction$ will be maximum and maximum value it can have is $1$, which means $L$ and $W$ are equal because:
$$ 1 = 2L + 2W = 2\cdot \frac P4 + 2\cdot \frac P4 \iff $$. Hence $P/4$ wi give maximum area of rectangle.
Best Answer
The question clearly asks the equivalent:
Your solutions make no sense because you have tried to maximize the area function evaluated for a particular choice of cut. More to the point, you are differentiating with respect to a value that is fixed but unknown, the length $p$ of the line segment, and this is not what is allowed to vary in the question. What is allowed to vary is the length of the first cut for a given length of segment. The result is a "solution" that uses the machinery of differential calculus without actually demonstrating any understanding of what the computations mean or how they relate to finding a solution to the problem.
A proper solution proceeds as follows. Here, we are told that the length of the line segment is some value $p$. For such a segment, there are many ways to partition the segment so as to form a rectangle--some will result in long and narrow rectangles, and some will result in rectangles that are more square-like. Intuitively, we can see that if we select a partition for which one of the two parallel sides is small, then the other pair of sides must be long.
Moreover, a little thought should reveal that the sum of the length and width of any rectangle thus formed from the line segment must always be half the total length of the segment; i.e., if the rectangle has length $l$ and width $w$, then $$l + w = p/2.$$ This is because the total perimeter of the rectangle is $p$, being formed by the entire segment, yet the perimeter in terms of its length and width is $2l + 2w$.
It follows from the above that for a given $p$, say if we choose a positive width $w$ not exceeding $p/2$, the entire rectangle is uniquely determined, for we then have $$l = p/2 - w.$$ The resulting area of such a rectangle, in terms of the width, is the function $$A(w) = lw = (p/2 - w)w.$$ Again, we are not interested in the area as a function of $p$, because we seek to maximize $A$ among all line segments of some fixed length $p$ forming perimeters of rectangles of variable width $w$.
Then by differentiation of $A$ with respect to $w$ and identifying the critical points, we can see when the area attains a maximum: $$0 = \frac{dA}{dw} = p/2 - 2w$$ implies $w = p/4$, thus $l = p/2 - w = p/4$, and the rectangle has equal width and length--it is a square. This completes the proof.
Your second solution, as far as I am able to tell, introduces arbitrary numbers and is as nonsensical as the first.