Given: f:{1,2,3,4}→{a∈Z:∣a∣≤8} satisfying f(n)+n1f(n+1)=1 for all n∈{1,2,3}.
From the recurrence relation, we express all values in terms of f(1):
For n=1: f(1)+f(2)=1⟹f(2)=1−f(1)
For n=2: f(2)+21f(3)=1⟹f(3)=2(1−f(2))=2(1−(1−f(1)))=2f(1)
For n=3: f(3)+31f(4)=1⟹f(4)=3(1−f(3))=3(1−2f(1))=3−6f(1)
All function values must be integers with ∣f(i)∣≤8. Since f(1) is an integer, we need:
- ∣f(1)∣≤8
- ∣1−f(1)∣≤8⟹−7≤f(1)≤9
- ∣2f(1)∣≤8⟹−4≤f(1)≤4
- ∣3−6f(1)∣≤8⟹−65≤f(1)≤611
The most restrictive constraint gives f(1)∈{0,1} (integers in [−0.83,1.83]).
The two valid functions are:
- f(1)=0: f=(0,1,0,3)
- f(1)=1: f=(1,0,2,−3)
The number of such functions is 2.
Therefore, the correct answer is Option D: 2.