Q.Find two numbers whose sum is 24 and whose product is as large as possible.
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Maximizing Product Given Sum
The Core Intuition
You have a fixed length of rope and want the largest rectangular garden. The perimeter is fixed, so the sum of length and width is constant — but you're asked about the product of two numbers whose sum is fixed. This is the classic "Maximizing Product Given Sum" problem, appearing in optimisation, inequality proofs, and why a square beats a rectangle for area.
Suppose two numbers add up to 10:
- 1 and 9 → product = 9
- 2 and 8 → product = 16
- 3 and 7 → product = 21
- 4 and 6 → product = 24
- 5 and 5 → product = 25
As the numbers get closer together, the product grows; the maximum is at equality. For a fixed sum, the product is maximised when the numbers are as balanced as possible.
This holds for any count of positive numbers. Three numbers summing to 30 give the maximum product when each is 10.
The Precise Statement
Maximizing Product Given Sum
For positive reals x1,…,xn with fixed sum S, the product x1x2⋯xn is maximised when all are equal:
x1=x2=⋯=xn=nS
This follows from the AM–GM inequality:
nx1+⋯+xn≥nx1⋯xn
with equality iff all xi are equal. Since the left side is fixed at S/n, the product is bounded above by (S/n)n, achieved exactly when all numbers are equal.
"Positive numbers" is crucial. If negatives are allowed, the product can be made arbitrarily large in magnitude (e.g. x=1000, y=−990: sum 10, product −990000). For non-negative numbers the result holds, but the maximum is zero if any number is zero.
Why This Matters for Exams
Three main forms:
- Direct: "Find two positive numbers whose sum is 20 with maximum product." → 10 and 10.
- Word problems: "100 m of fencing for a rectangular pen — maximise area." Length + width = 50, so a 25 m square is best.
- Inequality proofs: "For positive a,b with a+b=1, prove ab≤1/4." The two-number case.
A common mistake: applying this to perimeter problems without halving. If all four sides sum to a fixed value, length + width is half of it. Always check what is being summed.
--- …
Concept: For a fixed sum, the product of two numbers is maximized when the numbers are as close as possible (by AM–GM inequality).
Steps:
- Let the numbers be x and 24−x. Their product is P(x)=x(24−x)=24x−x2.
- This is a quadratic opening downward. Its maximum occurs at the vertex x=−2ab=−2(−1)24=12. …
For a fixed sum, the product of two numbers is maximised when the numbers are equal. Here, the two numbers are 12 and 12, giving the maximum product 144.
The idea is simple: if you have a fixed total to split into two parts, the product is largest when the parts are as balanced as possible. Why? Because the product x(24−x) is a quadratic that opens downward — its peak lies exactly at the midpoint of the sum.
Let’s work through it.
- Set up the problem. Let the two numbers be x and 24−x. Their product is
P=x(24−x)=24x−x2.
-
Recognise the shape.
P=−x2+24x is a quadratic in x with a negative coefficient on x2. That means its graph is an upside-down parabola — it has a maximum at its vertex, not a minimum.
-
Find the vertex.
For any quadratic ax2+bx+c, the vertex occurs at x=−2ab. Here a=−1, b=24, so
x=−2(−1)24=224=12.
So the product is maximised when x=12. The other number is 24−12=12.
- Compute the maximum product. Pmax=12×12=144. …
Method: Maximizing a Product for a Fixed Sum (Single-Variable Substitution)
This method handles the classic "two numbers with a fixed sum, maximize/minimize their product" family — including its geometric disguises like "fixed perimeter, maximize area."
Steps
Step 1: Name one unknown and express the other using the constraint
If the sum of two numbers is fixed at S, let one number be x; the constraint forces the other to be S−x. This turns a two-variable problem into a one-variable function.
Step 2: Write the quantity to optimize as a function of that one variable
P(x)=x(S−x)
Recognize this is a downward-opening quadratic — so it has a single maximum, not a minimum, at its vertex.
Step 3: Find the vertex using calculus or the vertex formula …
Common Mistakes
Mistake 1: Assuming very unequal numbers give a bigger product
Why it's wrong: intuition sometimes suggests that making one number very large and the other small should maximize the product — but the product of two numbers with a fixed sum is a downward parabola that peaks when the numbers are equal, and shrinks toward zero as they become unbalanced. Correct approach: trust the vertex/derivative calculation over the "bigger is better" instinct, and sanity-check with a quick numeric comparison (e.g. 1×23=23 versus 12×12=144).
Mistake 2: Forgetting to verify the critical point is a maximum, not a minimum …
- AP EAPCET 2026Set eng-2026-05-12-AN1 markMCQQ.If the maximum value of xα(24−x)β exists at x=9, then α:β= (A) 1:2 (B) 6:7 (C) 6:8 (D) 3:5
›Reveal solutionSolution
Maximizing xα(24−x)β by logarithmic differentiation and setting x=9 gives α:β=3:5.
Concept and Intuition
For products of powers like xα(a−x)β, logarithmic differentiation converts the product into a sum, making the derivative condition for a maximum a simple linear equation in x. The general result is that the maximum occurs at x=α+βaα — a weighted average of the endpoints.
Step-by-Step Solution
- Let f(x)=xα(24−x)β. Take logs: logf=αlogx+βlog(24−x).
- Differentiate: ff′=xα−24−xβ.
- At a maximum, f′=0 (and f=0 in the interior), so xα=24−xβ. …
- AP EAPCET 2021Set eng-2021-08-20-AN1 markMCQQ.Find the minimum value of 2x+3y when xy=6. (A) 9 (B) 12 (C) 8 (D) 6
›Reveal solutionSolution
A constrained-optimization problem solvable either by calculus or AM-GM. The minimum value is 12.
Concept and Intuition
With the constraint xy=6, we can express y in terms of x and reduce to a single-variable minimization, or recognize that AM-GM directly bounds 2x+3y below in terms of the fixed product xy.
Step-by-Step Solution
- From xy=6, y=x6 (with x>0 so that y>0 too, both positive since the product is positive).
- f(x)=2x+3y=2x+x18.
- f′(x)=2−x218. Setting f′(x)=0: x2=9⇒x=3.
- f′′(x)=x336>0 at x=3, so this is a minimum.
- f(3)=2(3)+318=6+6=12. …
- AP EAPCET 2021Set eng-2021-08-25-FN1 markMCQQ.The maximum area of a rectangle that can be formed with a fixed perimeter of 20 units is ______ sq. units (A) 30 (B) 25 (C) 20 (D) 15
›Reveal solutionSolution
Among all rectangles with a given perimeter, the square maximizes the enclosed area — a standard AM-GM / calculus optimization result.
Concept and Intuition
For a rectangle with sides x and y, perimeter 2(x+y)=20⇒x+y=10 is fixed, while area xy is to be maximized. By AM–GM, xy≤(2x+y)2, with equality when x=y — so the maximum-area rectangle for a fixed perimeter is always a square.
Step-by-Step Solution
- Perimeter constraint: 2(x+y)=20⇒x+y=10.
- Area A=xy=x(10−x)=10x−x2.
- dxdA=10−2x=0⇒x=5; then y=10−5=5 (a square).
- Maximum area A=5×5=25. …
- AP EAPCET 2023Set eng-2023-05-15-AN1 markMCQQ.If a line is moving between the coordinate axes such that the sum of the intercepts made by it on the coordinate axes is always 12, then the equation of that line which forms a triangle of maximum area with the coordinate axes is (A) 3x+y=9 (B) 5x+7y=35 (C) x+y=6 (D) 5x+y=10
›Reveal solutionSolution
For a fixed sum of intercepts, the triangle's area (proportional to their product) is maximized when the intercepts are equal — giving the symmetric line x+y=6.
Concept and Intuition
A line with x-intercept a and y-intercept b forms a right triangle with the axes of area 21ab. If a+b is fixed, then by AM–GM (or simple calculus), ab — and hence the area — is maximized when a=b.
Step-by-Step Solution
- Let intercepts be a,b with a+b=12. Area =21ab.
- Maximize ab subject to a+b=12: write b=12−a, so ab=a(12−a)=12a−a2. Differentiating: 12−2a=0⇒a=6, hence b=6 too (this also matches AM–GM equality condition).
- Maximum area =21(6)(6)=18.
- The corresponding line with intercepts (6,6) is 6x+6y=1⇒x+y=6. …
- AP EAPCET 2023Set eng-2023-05-17-FN1 markMCQQ.The maximum value of x4y4 when a2x4+b2y4=c6 is (A) 16a4b4c12 (B) 4a2b2c12 (C) (a+b)12c6 (D) a4+b4c6
›Reveal solutionSolution
This is an AM-GM/Lagrange optimisation: maximise x4y4 given a fixed weighted sum a2x4+b2y4=c6; the maximum of a product with fixed sum occurs when the two summands are equal.
Concept and Intuition
For two non-negative numbers with fixed sum S, their product is maximised when they're equal (a direct consequence of AM ≥ GM, with equality at equal terms). Here the "two numbers" are a2x4 and b2y4, whose sum is fixed at c6; their product is a2b2⋅x4y4, which is exactly a2b2 times the quantity we want to maximise.
Step-by-Step Solution (AM-GM)
- Let u=a2x4, v=b2y4, so u+v=c6 (fixed), and x4y4=a2b2uv.
- By AM-GM, uv is maximised when u=v=2c6, giving uvmax=(2c6)2=4c12.
- So x4y4max=a2b2c12/4=4a2b2c12.
Step-by-Step Solution (Lagrange, as a check)
- Maximise f=x4y4 subject to g=a2x4+b2y4−c6=0. ∇f=λ∇g gives 4x3y4=λ⋅4a2x3 and 4x4y3=λ⋅4b2y3, i.e. y4=λa2 and x4=λb2. …
- AP EAPCET 2024Set eng-2024-05-21-AN1 markMCQQ.If a2x4+b2y4=c6 then maximum value of xy= (A) 2abc3 (B) 2abc3 (C) abc3 (D) abc3
›Reveal solutionSolution
By AM–GM, a2x4+b2y4≥2abx2y2, giving maximum xy=2abc3.
Concept and Intuition
Instead of Lagrange multipliers, a constraint of the form (sum of two non-negative terms) = constant, with the two terms' product proportional to (xy)2, is a textbook AM–GM optimisation.
Step-by-Step Solution
- Given a2x4+b2y4=c6, with a2x4≥0, b2y4≥0.
- By AM–GM: a2x4+b2y4≥2a2x4⋅b2y4=2abx2y2.
- So c6≥2ab(xy)2⇒(xy)2≤2abc6. …
- AP EAPCET 2025Set eng-2025-05-23-FN1 markMCQQ.P and Q are the ends of a diameter of the circle x2+y2=a2(a>21). s and t are the lengths of the perpendiculars drawn from P and Q onto the line x+y=1 respectively. When the product st is maximum, the greater value among s, t is (A) a+2 (B) a+21 (C) a−21 (D) a−2
›Reveal solutionSolution
This tests optimisation of a product of two perpendicular distances from opposite ends of a diameter to a fixed line; the maximum occurs when the diameter is aligned with the direction that pushes the endpoints as far as possible from the line, and the larger distance is a+21.
Concept and Intuition
P and Q are opposite ends of a diameter of the circle centred at the origin, so if P=(acosθ,asinθ) then Q=(−acosθ,−asinθ). The perpendicular distance of a point (x0,y0) from the line x+y−1=0 is 2∣x0+y0−1∣. Writing u=a(cosθ+sinθ), we get s=2∣u−1∣ (from P) and t=2∣u+1∣ (from Q), and u sweeps the interval [−a2,a2] as θ varies.
Step-by-Step Solution
- st=2∣u−1∣∣u+1∣=2∣u2−1∣.
- As a function of u, ∣u2−1∣ equals 1−u2 for ∣u∣≤1 (decreasing away from u=0) and u2−1 for ∣u∣≥1 (increasing as ∣u∣ grows). So on the allowed range u∈[−a2,a2], the candidates for the maximum are the interior point u=0 and the two boundary values u=±a2. …
- AP EAPCET 2024Set eng-2024-05-20-FN1 markMCQQ.If x, y are two positive integers such that x+y=20 and the maximum value of x3y is k at x=α,y=β then α2β2k= (A) βα+αβ (B) βα−αβ (C) βα (D) αβα+β
›Reveal solutionSolution
A constrained-optimization (AM-GM-style) maximization problem; the algebraic simplification of the answer ratio is the real point, not just finding the maximum.
Concept and Intuition
With x+y fixed, maximizing x3y is a standard single-variable calculus optimization after substitution. The twist is recognizing that k/(α2β2) simplifies algebraically to α/β once you know k=α3β, without needing the numeric value of k at all.
Step-by-Step Solution
- Let f(x)=x3(20−x)=20x3−x4 for 0<x<20.
- f′(x)=60x2−4x3=4x2(15−x). Setting f′(x)=0 (and x=0) gives x=15.
- Check it's a maximum: f′′(x)=120x−12x2; at x=15, f′′=120(15)−12(225)=1800−2700=−900<0, confirming a maximum.
- So α=15, β=20−15=5, and k=f(15)=α3β. …
- AP EAPCET 2022Set eng-2022-07-06-FN1 markMCQQ.Let x, y, z be real numbers and x≥y≥z≥12π. If x+y+z=2π, then the minimum value of cosx.siny.cosz is (A) 21 (B) 41 (C) 61 (D) 81
›Reveal solutionSolution
Minimizing cosxsinycosz over the constrained triangle-of-angles region occurs at a boundary vertex — the answer is (D) 81.
Concept and Intuition
With x+y+z fixed and an ordering constraint x≥y≥z≥π/12, the feasible set of (x,y,z) is a compact 2-dimensional region (a triangle in the plane x+y+z=π/2). A smooth function on such a region attains its extreme values either at an interior critical point or on the boundary (vertices/edges). Checking shows there's no valid interior critical point here, so we examine the three vertices of the region.
Step-by-Step Solution
- The three vertices of the region (obtained by making two of the inequality constraints tight together with the sum constraint) are:
- x=y=z=π/6 (all equal),
- x=y=245π, z=π/12,
- x=π/3, y=z=π/12.
- Evaluate f=cosxsinycosz at each: at (π/6,π/6,π/6), f=23⋅21⋅23=83. At (245π,245π,π/12), f≈0.467. At (π/3,π/12,π/12): cos60∘=21, and sin15∘cos15∘=21sin30∘=41, so f=21⋅41=81. …
- The three vertices of the region (obtained by making two of the inequality constraints tight together with the sum constraint) are:
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.