This repository contains two complete Jupyter Notebook projects that apply core concepts from Calculus AB to solve and analyze real-world problems:
-
Newton’s Law of Cooling – The Potato Problem
📄 File:Potato_Problem_Project.ipynb
-
Optimization Project: Minimizing a Sum of Squares
📄 File:Minimize_Sum_Square.ipynb
Each project uses symbolic calculus, Python code, and visualizations to explain and solve the problem step-by-step.
This project explores Newton’s Law of Cooling through the lens of a famous AP Calculus FRQ often referred to as the “Potato Problem.” We model the internal temperature of a potato cooling in a room and apply key calculus concepts—rates of change, differential equations, approximations, and error analysis.
Through step-by-step analysis, we answer conceptual and computational questions using symbolic math, Python code, and visualizations.
- Define the differential equation for
$H'(t)$ (implicit and explicit forms) - Solve
$H'(t) = -\frac{1}{4}(H - 27)$ with initial condition$H(0) = 91$ - Derive the solution:
$H(t) = 27 + 64e^{-t/4}$ - Use tangent lines and linear approximation at
$t=0$ - Determine concavity and under/overestimation using
$H''(t)$ - Plot the second derivative to confirm concavity is always positive
- Identify no inflection points (always concave up)
- Define and compare:
- Unnormalized accumulation function:
$\Delta H(t) = 64(e^{-t/4} - 1)$ - Normalized accumulation:
$F(t) = 1 - e^{-t/4}$
- Unnormalized accumulation function:
- Determine when
$H(t) = 27.01$ using inverse exponential - Compute:
- Average value of
$H(t)$ over$[0, 35.06]$ - Average rate of change over same interval
- Compare and explain difference between average value and average rate
- Average value of
- Create 1st to 5th order Taylor Polynomials
- Evaluate error of each approximation
- Define acceptable error threshold (e.g. 1°C)
- Determine where error exceeds tolerance
- Discuss the role of curvature in approximation quality
-
Optimize cooling strategy: Minimize time by maximizing
$k$ in$H(t) = 27 + 64e^{-kt}$
What is the smallest possible sum of squares of two numbers, given that their product is -16?
This classic problem explores:
- Function minimization under constraint
- Symbolic math and substitution
- Derivative-based critical point analysis
- Visualization of functions and their slopes
Minimize:
Substitute to reduce to one variable:
Use calculus to:
- Find critical points
- Test using
$S'(x)$ and$S''(x)$
- SymPy: symbolic derivatives and solving
- Pandas: slope sign charts
-
Matplotlib: visualize
$S(x)$ ,$S'(x)$ ,$S''(x)$ -
Inset plots: zoom on minima near
$x=\pm 4$
- Minimum sum of squares is
$S(x) = 32$ - Occurs at
$x = 4 \Rightarrow y = -4$ and$x = -4 \Rightarrow y = 4$
Open the notebook file Minimize_Sum_Square.ipynb
and run cells step by step.
- Use substitution to minimize multivariable functions
- Apply first and second derivative tests
- Visualize and interpret critical points
- Understand discontinuity issues (e.g.
$x = 0$ is undefined)
Both projects are presented with clean, readable code and include plots, markdown explanations, and conclusions to illustrate each mathematical result. Great for anyone studying calculus or seeking practical applications of differential equations and optimization.