SAT Math Practice Question #23706 - SATify | SATify
#23706
recursion
functions
modular arithmetic
Recurrence Relations
hard
120 sec
For every positive integer n, let mod5(n) be the remainder obtained when n is divided by 5. Define a function h:0,1,2,3,…×0,1,2,3,4→0,1,2,3,4 recursively as follows: h(i,j)=⎩⎨⎧mod5(j+3)h(i−1,0)h(i−1,h(i,j−1))if i=0 and 0≤j≤4,if i≥1 and j=0,if i≥1 and 1≤j≤4.
What is h(2020,3)?