# Nakafa Framework: LLM
URL: /en/subject/high-school/10/mathematics/quadratic-function/quadratic-function-minimum-area
Source: https://raw.githubusercontent.com/nakafaai/nakafa.com/refs/heads/main/packages/contents/subject/high-school/10/mathematics/quadratic-function/quadratic-function-minimum-area/en.mdx
Output docs content for large language models.
---
export const metadata = {
    title: "Determining Minimum Area",
    description: "Minimize areas and costs using quadratic functions with practical examples, efficient solutions, and business applications. Master cost optimization techniques.",
    authors: [{ name: "Nabil Akbarazzima Fatih" }],
    date: "04/19/2025",
    subject: "Quadratic Functions",
};
## What is Minimum Area?
Besides finding the largest value, quadratic functions can also be used to find the _smallest_ value (minimum). When might we need to find the minimum area? For example, when we have limited materials but need to make something with a certain area, and we want to use as little material as possible.
## Getting to Know Quadratic Functions Again
Remember, quadratic functions can look like a smile ( when ) or a frown ( when ).
Now, if we want to find the _smallest_ value (minimum), we use the smile-shaped function, so the value of  is positive ().
The general form remains the same:
(, , and  are numbers, ).
## How to Find the Lowest Point (Valley)
The smallest value is at the lowest point of the smiling graph. This point is also called the vertex (but it's at the bottom).
The formula to find it is exactly the same as finding the highest point!
To find the _position_ of the valley (the  value):
To find the _smallest value_ (the  or  value):
Or use the discriminant shortcut formula:
where .
## Example to Understand
Let's say we have a 40 cm long wire. We want to cut this wire into two parts. The first part will be formed into a square, and the second part will also be formed into a square. What should the cuts be so that the _total area_ of both squares is as small as possible (minimum)?
1.  **Name Things:** Let's say the side of the first square is  cm, and the side of the second square is  cm.
2.  **Wire Length Relationship:**
    - Wire for the first square: Perimeter is  cm.
    - Wire for the second square: Perimeter is  cm.
    - Total wire length:
      
      Simplify (divide by 4):
      
      This means:
      
3.  **Total Area Formula:** The total area of both squares is .
    
    Replace  with :
    
      
      
      
    
4.  **Quadratic Function Form:** We now have .
    This is a quadratic function with , , . Since  is positive, the graph is a smile, so there is a minimum value.
5.  **Find Side x for Minimum Area:** Use the formula :
    
    So, the side of the first square must be 5 cm for the sum of areas to be minimal.
6.  **Find Side y and Minimum Area:**
    - Side of the second square:  cm.
    - Minimum Total Area: Plug  into :
      
      The minimum total area is .
7.  **Conclusion:** For the total area of both squares to be minimal (), the wire must be cut so that both squares have the same side length, which is . (This means the wire is cut into two equal parts,  and ).
## Where Is It Used?
### Business & Economics
**Example:**
The production cost of  units of goods (in thousands of rupiah) is . How many units should be produced to minimize the cost?
- Cost function:  (). , so there is a minimum.
- Number of units for minimum cost:  units.
- Minimum cost:  thousand rupiah (or Rp 200,000).
## Exercise
The sum of two positive numbers is 16. Determine these two numbers so that the sum of their squares is minimum, and calculate the minimum sum of squares!
### Answer Key
1.  Let the first number be , the second number be . ().
2.  Relationship: . So .
3.  Sum of Squares: .
    
      
      
      
    
4.  Sum of Squares Function: .
    (). Since , there is a minimum value.
5.  Value of  for minimum sum of squares:
    .
6.  Value of :
    .
7.  Minimum Sum of Squares:
    .
Therefore, the two numbers are 8 and 8 for the sum of their squares to be minimum (which is 128).