We are given the functional equation f(x+y)=f(x)f(y) for all natural numbers x,y.
First, put y=1. We obtain f(x+1)=f(x)f(1). Let us denote c=f(1) for convenience.
Now we prove by induction that f(n)=cn for every natural number n.
Base case: for n=1 we have f(1)=c=c1, which is true.
Induction step: assume f(k)=ck for some k∈N. Then
f(k+1)=f(k)f(1)=ckc=ck+1,
so the formula holds for k+1 as well. Hence by mathematical induction f(n)=cn for all n∈N.
Next, the question supplies the infinite series condition
∑x=1∞f(x)=2.
Substituting f(x)=cx, this series becomes
∑x=1∞cx=2.
We recall the standard formula for the sum of an infinite geometric progression with first term a and common ratio r, where ∣r∣<1:
∑n=0∞arn=1−ra.
In our sum the first term is c and the common ratio is also c, so
∑x=1∞cx=1−cc=2.
We now solve this simple linear equation for c:
1−cc=2⟹c=2(1−c)
⟹c=2−2c
⟹3c=2
⟹c=32.
Because c=32 satisfies ∣c∣<1, the derivation is consistent. Therefore
f(n)=(32)n.
We can now compute the required ratio. First,
f(2)=(32)2=94,
and
f(4)=(32)4=8116.
Hence
f(2)f(4)=948116=8116×49=94.
Hence, the correct answer is Option 4.