Critical Points Calculator
Calculate critical points instantly with our math tool. Shows detailed work, formulas used, and multiple solution methods.
Calculator
Adjust values & calculateValue Table
| x | f(x) | f'(x) | f''(x) |
|---|---|---|---|
| -2.00 | -52.0000 | 45.0000 | -24.0000 |
| -1.60 | -35.8560 | 35.8800 | -21.6000 |
| -1.20 | -23.1680 | 27.7200 | -19.2000 |
| -0.80 | -13.5520 | 20.5200 | -16.8000 |
| -0.40 | -6.6240 | 14.2800 | -14.4000 |
| -0.00 | -2.0000 | 9.0000 | -12.0000 |
| 0.40 | 0.7040 | 4.6800 | -9.6000 |
| 0.80 | 1.8720 | 1.3200 | -7.2000 |
| 1.20 | 1.8880 | -1.0800 | -4.8000 |
| 1.60 | 1.1360 | -2.5200 | -2.4000 |
| 2.00 | 0.0000 | -3.0000 | 0.0000 |
| 2.40 | -1.1360 | -2.5200 | 2.4000 |
| 2.80 | -1.8880 | -1.0800 | 4.8000 |
| 3.20 | -1.8720 | 1.3200 | 7.2000 |
| 3.60 | -0.7040 | 4.6800 | 9.6000 |
| 4.00 | 2.0000 | 9.0000 | 12.0000 |
| 4.40 | 6.6240 | 14.2800 | 14.4000 |
| 4.80 | 13.5520 | 20.5200 | 16.8000 |
| 5.20 | 23.1680 | 27.7200 | 19.2000 |
| 5.60 | 35.8560 | 35.8800 | 21.6000 |
| 6.00 | 52.0000 | 45.0000 | 24.0000 |
Formula
Critical points occur where the first derivative equals zero. The second derivative test classifies them: positive second derivative means local minimum (concave up), negative means local maximum (concave down). For cubic f(x) = ax^3 + bx^2 + cx + d, the inflection point is at x = -b/(3a).
Last reviewed: December 2025
Worked Examples
Example 1: Profit Maximization
Example 2: No Real Critical Points
Background & Theory
The Critical Points Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Critical Points Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
Formula
f'(x) = 0 to find critical points | f''(x) test: > 0 = min, < 0 = max
Critical points occur where the first derivative equals zero. The second derivative test classifies them: positive second derivative means local minimum (concave up), negative means local maximum (concave down). For cubic f(x) = ax^3 + bx^2 + cx + d, the inflection point is at x = -b/(3a).
Worked Examples
Example 1: Profit Maximization
Problem: Find the critical points of f(x) = x^3 - 6x^2 + 9x - 2 and classify them.
Solution: f(x) = x^3 - 6x^2 + 9x - 2\nf'(x) = 3x^2 - 12x + 9 = 3(x^2 - 4x + 3) = 3(x-1)(x-3)\nCritical points: x = 1 and x = 3\nf''(x) = 6x - 12\nf''(1) = 6(1) - 12 = -6 < 0 => Local Maximum at (1, 2)\nf''(3) = 6(3) - 12 = 6 > 0 => Local Minimum at (3, -2)\nInflection point: x = -(-6)/(3*1) = 2, f(2) = 0
Result: Local Max at (1, 2) | Local Min at (3, -2) | Inflection at (2, 0)
Example 2: No Real Critical Points
Problem: Analyze f(x) = x^3 + 3x + 5 for critical points.
Solution: f(x) = x^3 + 3x + 5\nf'(x) = 3x^2 + 3\nSetting f'(x) = 0: 3x^2 + 3 = 0 => x^2 = -1\nDiscriminant = 0 - 4(3)(3) = -36 < 0\nNo real solutions, so no critical points\nSince f'(x) = 3x^2 + 3 > 0 for all real x, function is always increasing\nInflection point: x = 0, f(0) = 5
Result: No critical points | Monotonically increasing | Inflection at (0, 5)
Frequently Asked Questions
What are critical points of a function?
Critical points are x-values where the first derivative of a function equals zero or is undefined. At these points, the function may have a local maximum, local minimum, or neither (a saddle point or inflection point). To find them, compute the derivative f'(x), set it equal to zero, and solve for x. Critical points represent locations where the function changes direction or flattens momentarily. They are fundamental to optimization problems in calculus, engineering, economics, and data science. Every continuous function on a closed interval attains its absolute maximum and minimum at either critical points or endpoints.
How does the second derivative test classify critical points?
The second derivative test evaluates f''(x) at each critical point to determine its nature. If f''(x) > 0, the function is concave up (bowl-shaped) at that point, indicating a local minimum. If f''(x) < 0, the function is concave down (hill-shaped), indicating a local maximum. If f''(x) = 0, the test is inconclusive and you must use other methods like the first derivative test or higher-order derivatives. For example, if f'(3) = 0 and f''(3) = 4, then x = 3 is a local minimum because the positive second derivative confirms upward curvature. This test is faster than the first derivative test but fails when the second derivative is zero.
How do I find critical points of a cubic function?
For a cubic function f(x) = ax^3 + bx^2 + cx + d, the derivative is f'(x) = 3ax^2 + 2bx + c. Setting this quadratic equal to zero and using the quadratic formula gives x = (-2b plus or minus sqrt(4b^2 - 12ac)) / (6a). The discriminant 4b^2 - 12ac determines the number of critical points: if positive, there are two critical points; if zero, one repeated critical point; if negative, no real critical points (the function is monotonically increasing or decreasing). When two critical points exist, one is a local maximum and the other is a local minimum for any non-zero leading coefficient.
What does the first derivative test tell us about critical points?
The first derivative test examines the sign of f'(x) on either side of a critical point. If f'(x) changes from positive to negative, the critical point is a local maximum because the function goes from increasing to decreasing. If f'(x) changes from negative to positive, it is a local minimum because the function goes from decreasing to increasing. If f'(x) does not change sign (positive on both sides or negative on both sides), the critical point is neither a maximum nor a minimum. This test always works, unlike the second derivative test which fails when f''(x) = 0. The first derivative test also provides information about the functions behavior in intervals between critical points.
How are critical points used in optimization problems?
Optimization problems seek to maximize or minimize some quantity, and critical points identify the candidates. The typical process is: formulate the objective function, find its derivative, set the derivative to zero to find critical points, then classify each using the second derivative test or first derivative test. In business, finding the production level that maximizes profit involves setting the marginal profit (derivative of profit function) to zero. In engineering, minimizing material usage for a given volume requires finding critical points of the surface area function. In machine learning, gradient descent algorithms iteratively seek critical points of loss functions to find optimal model parameters.
What happens when a polynomial has no real critical points?
When the discriminant of the derivative equation is negative, the polynomial has no real critical points. For a cubic function, this means the derivative (a quadratic) has no real roots, so the function is monotonically increasing (if the leading coefficient is positive) or monotonically decreasing (if negative). The function still has an inflection point where concavity changes, but no local maxima or minima exist. This occurs when 4b^2 - 12ac < 0, or equivalently b^2 < 3ac. For example, f(x) = x^3 + x has derivative 3x^2 + 1, which is always positive. The function always increases and passes through each y-value exactly once.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy