Solution:
Answer: 6n1
Let fn(x1,x2,…,xn) denote the n-variable version of the function. We will prove that fn(5,…,5)=6n1 by induction.
The base case was done in the two previous problems. Suppose we know that fn−1(5,5,…,5)=6n−11. Let g(x1,…,xn−1)=3fn(x1,…,xn−1,3). We have that g is linear in x1,…,xn−1 and g(x1,…,xn−1)=x1⋯xn−11 for all x1,…,xn−1∈{3,4}.
By the inductive hypothesis, we have g(5,…,5)=6n−11=fn−1(5,…,5). Therefore, fn(5,…,5,3)=3fn−1(5,…,5). Similarly, fn(5,…,5,4)=4fn−1(5,…,5).
fn(5,5,…,5,5)=2fn(5,5,…,5,4)−fn(5,5,…,5,3)=2⋅4fn−1(5,…,5)−3fn−1(5,…,5)=21fn−1(5,5,…,5)−31fn−1(5,5,…,5)=61fn−1(5,5,…,5)=6⋅6n−11=6n1
and this proves our conjecture by induction.