Minimum Sum with a Fixed Product Optimization Calculator
This minimum-sum fixed-product calculator finds the two positive real numbers whose product equals the value you provide and whose sum is as small as possible.
Run — free
It returns each optimal number and the minimum sum, using the exact equality condition behind the arithmetic-geometric mean inequality. The result is deterministic and immediate, making it useful for calculus optimization exercises, algebra checks, geometric design problems, and automated answer generation without relying on a numerical search or an arbitrary starting guess.
Set up the fixed-product optimization problem
Suppose two positive numbers are called x and y, and their fixed product is P. The constraint is xy = P, while the quantity to minimize is the sum S = x + y. Enter P in the product field; it must be a finite number strictly greater than zero because the problem specifically concerns two positive real numbers. The constraint lets you replace y with P/x, turning the sum into the one-variable function S(x) = x + P/x for x greater than zero. This form makes the tradeoff visible. Choosing x very small forces y to become very large, while choosing x very large makes x itself dominate the sum. Somewhere between those extremes lies a unique balance point. The calculator reports that point as first_number and second_number, followed by minimum_sum. The labels distinguish the requested quantities even though the two optimal values are equal. Units are not imposed by the service; if the product represents square meters, squared centimeters, or another compound unit, carry the corresponding base unit into each number and the sum. Only the mathematical scalar values are returned.
Why equal numbers produce the global minimum
There are two standard ways to justify the answer. With calculus, differentiate S(x) = x + P/x to obtain S'(x) = 1 - P/x squared. Setting the derivative equal to zero gives x squared = P, and positivity selects x = square root of P. Substitution into y = P/x gives the same positive square root for y. The second derivative, 2P/x cubed, is positive throughout the allowed domain, so this critical point is a strict minimum. The behavior near zero and toward infinity confirms that it is the global minimum rather than merely a local one. The arithmetic-geometric mean inequality provides an even shorter proof: for positive x and y, (x + y)/2 is at least the square root of xy. Because xy equals P, every allowed sum is at least 2 square root of P, and equality occurs exactly when x equals y. The calculator uses this closed-form equality condition directly. It does not sample candidates or iterate toward an approximation, so there is no search interval, convergence tolerance, or possibility of selecting the wrong local extremum.
Read the result and apply it correctly
For a product of 36, the optimal values are 6 and 6, and the minimum sum is 12. An unequal valid pair such as 4 and 9 still has product 36, but its sum is 13, which illustrates the penalty for moving away from equality. Products that are not perfect squares work the same way: both optimal values may be irrational and are represented with standard JavaScript floating-point arithmetic. The service deliberately does not round them, because a classroom interface may want four decimal places while a downstream calculation may need the full available precision. Round only when presenting the answer, and avoid feeding a prematurely rounded value back into a strict product check. The result applies over positive real numbers. If a problem restricts the choices to integers, imposes lower or upper bounds, uses negative numbers, or asks about three or more factors, its feasible set is different and this calculator is not the right solver. In geometry, the formula often appears when a rectangle has fixed area and perimeter must be minimized: equal side lengths produce the square. In calculus exercises, use the response to check your result, but still show the constraint, substitution, derivative or inequality, equality condition, and domain reasoning required by the written solution.
What you can do with it
Check a calculus optimization exercise
Verify the critical values and minimum sum after differentiating a fixed-product constraint by hand.
Design a minimum-perimeter rectangle
Use a fixed area as the product to confirm that equal side lengths minimize the sum of adjacent sides and therefore the perimeter.
Generate deterministic answer keys
Produce stable optimal values and minimum sums for positive-product exercises without running an iterative optimizer.
FAQ
What formula does the calculator use?
Each optimal number is the positive square root of the fixed product, and the minimum sum is twice that square root.
Why must the two optimal numbers be equal?
The arithmetic-geometric mean inequality reaches equality only when the two positive numbers are equal; calculus gives the same condition at the unique critical point.
Can the fixed product be zero or negative?
No. This capability is defined for two positive real numbers, so their product must be strictly greater than zero.
Does this solve the integer-only version?
No. It optimizes over positive real numbers. Integer restrictions can make the best feasible pair different when the product is not a perfect square.
How much does an API calculation cost?
Each API request costs $0.002. The identical deterministic calculation can also run free in your browser.
For developers — API access
Everything on this page is available programmatically. This section is for teams who want to wire it into their own systems; everyone else can just use the tool above.
API endpoint
Prefer to automate it? One authenticated POST creates the task; the result comes back by webhook or a signed link. The same capability also runs here on the web, by email and from Telegram — and soon from our app too.
Call it from your stack
curl -X POST https://api.kit.forhosting.com/calculus/optimization-min-sum-fixed-product \
-H "Authorization: Bearer $KIT_KEY" \
-H "Content-Type: application/json" \
-d '{"product":36}'const res = await fetch("https://api.kit.forhosting.com/calculus/optimization-min-sum-fixed-product", {
method: "POST",
headers: {
"Authorization": `Bearer ${process.env.KIT_KEY}`,
"Content-Type": "application/json"
},
body: JSON.stringify({
"product": 36
})
});
const { task_id } = await res.json();import os, requests
res = requests.post(
"https://api.kit.forhosting.com/calculus/optimization-min-sum-fixed-product",
headers={"Authorization": f"Bearer {os.environ['KIT_KEY']}"},
json={
"product": 36
},
)
task_id = res.json()["task_id"]<?php
$res = file_get_contents("https://api.kit.forhosting.com/calculus/optimization-min-sum-fixed-product", false, stream_context_create([
"http" => [
"method" => "POST",
"header" => "Authorization: Bearer " . getenv("KIT_KEY") . "\r\nContent-Type: application/json",
"content" => '{"product":36}',
],
]));
$task = json_decode($res, true);body := bytes.NewBufferString(`{"product":36}`)
req, _ := http.NewRequest("POST", "https://api.kit.forhosting.com/calculus/optimization-min-sum-fixed-product", body)
req.Header.Set("Authorization", "Bearer "+os.Getenv("KIT_KEY"))
req.Header.Set("Content-Type", "application/json")
res, _ := http.DefaultClient.Do(req)Example request
{
"product": 36
}Example response
{
"task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
"type": "calculus.optimization_min_sum_fixed_product",
"status": "queued",
"_links": {
"result": "/tasks/tsk_…/result"
}
}The API is asynchronous: the call returns a task_id immediately and the result arrives by webhook. Polling is capped at 1 req/s per task.
Pricing
Published price — no tokens, no invented credits. A failed task is never charged.
Errors
| HTTP | Code | Meaning |
|---|---|---|
401 | unauthorized | Missing or invalid API key. |
402 | insufficient_balance | Your balance doesn't cover the task price. |
404 | unknown_type | That task type doesn't exist. |
429 | rate_limited | Too many requests. Use the webhook instead of polling. |