SAT Math Practice Question #25505 - SATify | SATify
#25505
functions
recursion
Calculus
hard
120 sec
For each x in [0,1] define f(x)=∣2x−1∣. Let f[2](x)=f(f(x)), and f[n+1](x)=f[n](f(x)) for each integer n≥2. For how many values of x in [0,1] is f[2000](x)=21?