Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Let $$\{ {a_n}\} _{n = 0}^\infty $$ be a sequence such that $${a_0} = {a_1} = 0$$ and $${a_{n + 2}} = 2{a_{n + 1}} - {a_n} + 1$$ for all n $$\ge$$ 0. Then, $$\sum\limits_{n = 2}^\infty {{{{a_n}} \over {{7^n}}}} $$ is equal to:
Step 1: The recurrence gives $a_{n+2}-2a_{n+1}+a_n=1$ with $a_0=a_1=0$, hence $a_n=\binom n2$.
Step 2: Therefore the sum is $\sum_{n=2}^{\infty}\binom n2(1/7)^n$. For $|x|<1$, $\sum_{n\ge2}\binom n2x^n=x^2/(1-x)^3$.
Step 3: At $x=1/7$ this is $(1/49)/(6/7)^3=7/216$, option B (key 2).
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.