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_{\mathrm{n}} > $$ be a sequence such that $$a_{1}+a_{2}+\ldots+a_{n}=\frac{n^{2}+3 n}{(n+1)(n+2)}$$. If $$28 \sum_\limits{k=1}^{10} \frac{1}{a_{k}}=p_{1} p_{2} p_{3} \ldots p_{m}$$, where $$\mathrm{p}_{1}, \mathrm{p}_{2}, \ldots ., \mathrm{p}_{\mathrm{m}}$$ are the first $$\mathrm{m}$$ prime numbers, then $$\mathrm{m}$$ is equal to
Step 1: Since Sₙ=1−2/[(n+1)(n+2)], differencing gives aₙ=4/[n(n+1)(n+2)].
Step 2: Thus Σₖ₌₁¹⁰1/aₖ=(1/4)Σk(k+1)(k+2)=17160/16=1072.5.
Step 3: Multiplying by 28 gives 30030=2·3·5·7·11·13, the product of the first six primes. Hence m=6, option C.
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.