MathDB
Function Recurrence

Source:

April 2, 2013
function

Problem Statement

The function ff is given by the table
x12345f(x)41352\begin{array}{|c||c|c|c|c|c|}\hline x & 1 & 2 & 3 & 4 & 5 \\ \hline f(x) & 4 & 1 & 3 & 5 & 2 \\ \hline \end{array}
If u0=4u_0=4 and un+1=f(un)u_{n+1}=f(u_n) for n0n\geq 0, find u2002u_{2002}.
<spanclass=latexbold>(A)</span>1<spanclass=latexbold>(B)</span>2<spanclass=latexbold>(C)</span>3<spanclass=latexbold>(D)</span>4<spanclass=latexbold>(E)</span>5<span class='latex-bold'>(A) </span>1\qquad<span class='latex-bold'>(B) </span>2\qquad<span class='latex-bold'>(C) </span>3\qquad<span class='latex-bold'>(D) </span>4\qquad<span class='latex-bold'>(E) </span>5