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.
Consider the sequence $$a_{1}, a_{2}, a_{3}, \ldots$$ such that $$a_{1}=1, a_{2}=2$$ and $$a_{n+2}=\frac{2}{a_{n+1}}+a_{n}$$ for $$\mathrm{n}=1,2,3, \ldots .$$ If $$\left(\frac{\mathrm{a}_{1}+\frac{1}{\mathrm{a}_{2}}}{\mathrm{a}_{3}}\right) \cdot\left(\frac{\mathrm{a}_{2}+\frac{1}{\mathrm{a}_{3}}}{\mathrm{a}_{4}}\right) \cdot\left(\frac{\mathrm{a}_{3}+\frac{1}{\mathrm{a}_{4}}}{\mathrm{a}_{5}}\right) \ldots\left(\frac{\mathrm{a}_{30}+\frac{1}{\mathrm{a}_{31}}}{\mathrm{a}_{32}}\right)=2^{\alpha}\left({ }^{61} \mathrm{C}_{31}\right)$$, then $$\alpha$$ is equal to :
Step 1: Multiply the recurrence by $a_{n+1}$: $a_{n+1}a_{n+2}=a_na_{n+1}+2$. Since $a_1a_2=2$, induction gives $a_na_{n+1}=2n$.
Step 2: Each factor becomes $(a_na_{n+1}+1)/(a_{n+1}a_{n+2})=(2n+1)/(2n+2)$. The product for $n=1$ to 30 is $(3/4)(5/6)\cdots(61/62)$.
Step 3: This equals $2^{-60}\binom{61}{31}$, so $\alpha=-60$, option C (key 3).
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.