Maths Olympiad Prep

Library / /405 of 520

Algebra Difficulty 6.0 AIME, harder Find the answer

Let f0(x)=x,f1(x)=f0(x)1,f2(x)=f1(x)2,fn(x)=fn1(x)nf_{0}(x)=|x|, \quad f_{1}(x)=\left|f_{0}(x)-1\right|, \quad f_{2}(x)=\left|f_{1}(x)-2\right|, \quad \ldots f_{n}(x)=\left|f_{n-1}(x)-n\right|. The graph of the function fn(x)f_{n}(x) intersects the xx-axis at exactly two points. What is the area of the region enclosed by this function curve and the xx-axis?

A number or a short expression. Spacing and $ signs are ignored.

Solution

Let the sought area be tnt_{n}. For the values n=0,1,2n=0,1,2, plotting the function fnf_{n} (Figure 1), we can see that t0=0t_{0}=0, t1=1t_{1}=1, t2=7t_{2}=7, and with the notation an=n(n+1)/2a_{n}=n(n+1) / 2, the following statement is true for n=0,1,2n=0,1,2:

 if xan, then fn(x)=xan if an<x<an, then 0<fn(x)n if anx, then fn(x)=xan \begin{array}{ll} \text { if } & x \leq-a_{n}, \quad \text { then } \quad f_{n}(x)=-x-a_{n} \\ \text { if } & -a_{n}<x<a_{n}, \quad \text { then } \quad 0<f_{n}(x) \leq n \\ \text { if } & a_{n} \leq x, \quad \text { then } \quad f_{n}(x)=x-a_{n} \end{array}

!

Since anan1=na_{n}-a_{n-1}=n and fn(x)=fn1(x)nf_{n}(x)=\left|f_{n-1}(x)-n\right|, if statement (1) is true for (n1)(n-1), then it is also true for nn (Figure 2). Therefore, by the principle of mathematical induction, (1) holds for all nn. Based on Figure 2, the area tnt_{n} is obtained by subtracting the area of the region bounded by the curve of the function fnf_{n} between points EE and FF and the segment EFEF from the area of the trapezoid ADFEA D F E. This is nothing more than the reflection of the curve of fn1f_{n-1} between points BB and CC over the line y=n/2y=n / 2, so the area to be subtracted is exactly tn1t_{n-1}. The area of the trapezoid is

BEAD+EF2=n(an+an1)=n3 B E \frac{A D+E F}{2}=n\left(a_{n}+a_{n-1}\right)=n^{3}

thus tn=n3tn1t_{n}=n^{3}-t_{n-1}. Writing this relationship for nn replaced by (n1),(n2),(n-1),(n-2), \ldots and adding them with alternating signs, we get that for even nn,

tn=n3(n1)3+(n2)3++2313 t_{n}=n^{3}-(n-1)^{3}+(n-2)^{3}+\ldots+2^{3}-1^{3}

and for odd nn,

tn=n3(n1)3+(n2)3+23+13 t_{n}=n^{3}-(n-1)^{3}+(n-2)^{3}+\ldots-2^{3}+1^{3}

since t0=0t_{0}=0. This solves the problem.

Remark. For tnt_{n}, not only the expressions in (2) and (3), but also a closed form can be given. For this, we start from the following identity:

8n3=[4n3+6n21]+[4(n1)3+6(n1)21] 8 n^{3}=\left[4 n^{3}+6 n^{2}-1\right]+\left[4(n-1)^{3}+6(n-1)^{2}-1\right]

Comparing this with the relationship 8n3=8tn+8tn18 n^{3}=8 t_{n}+8 t_{n-1}, we get that the sum of consecutive terms of the sequence 8tn[4n3+6n21](n=0,1,2,)8 t_{n}-\left[4 n^{3}+6 n^{2}-1\right](n=0,1,2, \ldots) is 0, and since the value of the expression 8tn4n3+6n218 t_{n}-4 n^{3}+6 n^{2}-1 is +1 for n=0n=0, the terms of the sequence alternate between +1 and -1. From this, we get that 8tn[4n3+6n21]=(1)n8 t_{n}-\left[4 n^{3}+6 n^{2}-1\right]=(-1)^{n}, so

tn=4n3+6n21+(1)n8 t_{n}=\frac{4 n^{3}+6 n^{2}-1+(-1)^{n}}{8}

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.