2023 A1
A problem with gratuitous use of the chain and product rules.
Problem Setup
For a positive integer \(n\), let
Find the smallest \(n\) such that \(|f_n''(0)| > 2023\).
Solution
We can first attempt to generalize the first derivative of:
using the product rule:
This simplifies to:
Repeating this process, we achieve a series of \(f_{n}(x)\) similar terms with one \(- k \sin(kx)\) term replacing the respective cosine term:
As the first derivative of \(f_{n}(x)\) is a collection of terms similar in form to \(f_{n}(x)\) itself, finding the second derivative is like finding the first derivative repeatedly:
First term of \(f_{n}'(x)\):
Taking the derivative:
By a similar analysis, the second derivative of the second term is:
\[ \left(-2\cos(x)\sin(2x)\cos(3x)\ldots\cos(nx)\right)' \]
\[ = -2 \left[-\sin(x)\sin(2x)\ldots\cos(nx) + 2\cos(x)\cos(2x)\ldots\cos(nx) - \ldots - n\cos(x)\sin(2x)\ldots\sin(nx)\right]. \]
Thus, the general form of \(f_{n}''(x)\) looks like:
Evaluating \(f_{n}''(0)\) becomes straightforward since \(f_{n}(0) = (\cos 0)^n = 1\) and every sine term vanishes. Therefore:
Finishing the Problem
There are two approaches:
1.) The Clever Way:
According to Kedlaya’s solution, the sum \(\left| f_n''(0) \right|\) simplifies to:
Using this formula, finding the smallest \(n\) such that \(\left| f_n''(0) \right| > 2023\) is straightforward.
2.) The Way I Found \(n\):
I expanded the series term by term until reaching the required value. I won't bore you with the simple multiplication and addition. We find:
Therefore, the solution to the problem is \(n = 18\). \(\square\)