Skip to main content

2014 AMC 12A Problem 24

Problem 24 of 25HarderAlgebraCombinatorics

Let f0(x)=x+∣x−100∣f_0(x)=x+|x-100| −∣x+100∣,-|x+100|, and for n≥1,n\ge1, let fn(x)=∣fn−1(x)∣−1.f_n(x)=|f_{n-1}(x)|-1. For how many values of xx is f100(x)=0?f_{100}(x)=0?

Answer choices

Show solution

Solution

If fn−1(x)=±k,f_{n-1}(x)=\pm k, then fn(x)=k−1.f_n(x)=k-1. So if f0(x)=±kf_0(x)=\pm k for a nonnegative integer k,k, then fk(x)=0,f_k(x)=0, after which the sequence alternates 0,−1,0,…0,-1,0,\ldots Thus f100(x)=0f_{100}(x)=0 exactly when f0(x)=2kf_0(x)=2k for some integer −50≤k≤50.-50\le k\le50. Now f0(x)=x+∣x−100∣f_0(x)=x+|x-100| −∣x+100∣-|x+100| equals x+200x+200 for x<−100,x\lt-100, −x-x for −100≤x<100,-100\le x\lt100, and x−200x-200 for x≥100.x\ge100. Its graph is piecewise linear with turning points (−100,100)(-100,100) and (100,−100).(100,-100). A line y=2ky=2k meets this graph three times for −49≤k≤49-49\le k\le49 and twice for k=±50.k=\pm50. The total is 99⋅3+2⋅2=301.99\cdot3+2\cdot2=301. Thus, the correct answer is C.
AoPS wiki

Tagged: absolute value · recursion · counting intersections

More practice