Analyzing the Setup
Welcome, future engineer! Today, we are not just solving a problem; we are peeling back the layers of a mathematical onion. Infinite series can look intimidating, like a chaotic mess of factorials and binomial coefficients, but beneath that complexity lies a profound, elegant order.
Decoding Series b
Imagine you are looking at the series b=1+1!1C0+1C1+2!2C0+2C1+2C2+…. At first glance, it looks like a nightmare of combinations. But pause and look at the pattern in the numerators.
They are sums of binomial coefficients. Recall the fundamental identity: ∑r=0nnCr=2n. Suddenly, the fog lifts!
The series transforms into:
Does this look familiar? It is the Maclaurin expansion of ex where x=2. Just like that, b=e2. We have conquered the first mountain.
The Challenge of Series a
Now, we face series a=1+3!2C2+4!3C2+5!4C2+…. This is the true test. We define the general term as Tn=(n+1)!nC2.
We know that nC2=2n(n−1). So, the general term becomes:
Here is where the 'algebraic surgery' begins. We need to force the numerator to look like the denominator. We rewrite n(n−1) as n(n+1)−2n.
The Algebraic Surgery
By splitting the fraction, we get:
Tn=2(n+1)!n(n+1)−2(n+1)!2n
The first part simplifies beautifully:
2(n+1)n(n−1)!n(n+1)=2(n−1)!1
The second part, (n+1)!n, requires one more trick: add and subtract 1 in the numerator to get (n+1)!(n+1)−1=n!1−(n+1)!1. Now, our series a is just a collection of standard exponential series terms.
The Grand Finale
We distribute the summation across these terms. We have a=1+21∑(n−1)!1−∑n!1+∑(n+1)!1.
By carefully evaluating these sums starting from n=2, we find:
a=1+21(e−1)−(e−2)+(e−25)
When the dust settles, the constants cancel, and we are left with a=2e.
Finally, we calculate the requested value:
a22b=(e/2)22(e2)=e2/42e2=8
You did it! You navigated the complexity and found the elegant truth. The final answer is 8. Keep this persistence; it is what defines a true JEE Advanced scholar.