Number Series, Coding and DecodingMCQPYQ June 22Question 2028 of 217
All Questions

Find out the next term −6,13,28,59,?\displaystyle -6, 13, 28, 59, ?

Select Your Answer (Keyboard: A, B, C, D)
For any discrepancies in this question, email contact@cadada.in

Correct Answer

✅ Option a — 122

All Options:

  • A122
  • B114
  • C113
  • D112

Detailed Solution & Explanation

We are given the series: −6,13,28,59,?\displaystyle -6, 13, 28, 59, ?
**Discrepancy Note:**
The negative sign in front of the first term 6\displaystyle 6 is a typographical error in the question paper; the first term should be 6\displaystyle 6 instead of −6\displaystyle -6. Using 6\displaystyle 6, we get the series $6, 13, 28, 59, ?.<br>Let′sanalyzetherecurrencerelation:<br><spanclass="katex−display"><spanclass="katex"><spanclass="katex−mathml"><mathxmlns="http://www.w3.org/1998/Math/MathML"display="block"><semantics><mrow><msub><mi>x</mi><mi>n</mi></msub><mo>=</mo><mn>2</mn><msub><mi>x</mi><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msub><mo>+</mo><mostretchy="false">(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mostretchy="false">)</mo><mspacewidth="1em"/><mtext>for </mtext><mi>n</mi><mo>≥</mo><mn>2</mn></mrow><annotationencoding="application/x−tex">xn=2xn−1+(n−1)for n≥2</annotation></semantics></math></span><spanclass="katex−html"aria−hidden="true"><spanclass="base"><spanclass="strut"style="height:0.5806em;vertical−align:−0.15em;"></span><spanclass="mord"><spanclass="mordmathnormal">x</span><spanclass="msupsub"><spanclass="vlist−tvlist−t2"><spanclass="vlist−r"><spanclass="vlist"style="height:0.1514em;"><spanstyle="top:−2.55em;margin−left:0em;margin−right:0.05em;"><spanclass="pstrut"style="height:2.7em;"></span><spanclass="sizingreset−size6size3mtight"><spanclass="mordmathnormalmtight">n</span></span></span></span><spanclass="vlist−s">​</span></span><spanclass="vlist−r"><spanclass="vlist"style="height:0.15em;"><span></span></span></span></span></span></span><spanclass="mspace"style="margin−right:0.2778em;"></span><spanclass="mrel">=</span><spanclass="mspace"style="margin−right:0.2778em;"></span></span><spanclass="base"><spanclass="strut"style="height:0.8528em;vertical−align:−0.2083em;"></span><spanclass="mord">2</span><spanclass="mord"><spanclass="mordmathnormal">x</span><spanclass="msupsub"><spanclass="vlist−tvlist−t2"><spanclass="vlist−r"><spanclass="vlist"style="height:0.3011em;"><spanstyle="top:−2.55em;margin−left:0em;margin−right:0.05em;"><spanclass="pstrut"style="height:2.7em;"></span><spanclass="sizingreset−size6size3mtight"><spanclass="mordmtight"><spanclass="mordmathnormalmtight">n</span><spanclass="mbinmtight">−</span><spanclass="mordmtight">1</span></span></span></span></span><spanclass="vlist−s">​</span></span><spanclass="vlist−r"><spanclass="vlist"style="height:0.2083em;"><span></span></span></span></span></span></span><spanclass="mspace"style="margin−right:0.2222em;"></span><spanclass="mbin">+</span><spanclass="mspace"style="margin−right:0.2222em;"></span></span><spanclass="base"><spanclass="strut"style="height:1em;vertical−align:−0.25em;"></span><spanclass="mopen">(</span><spanclass="mordmathnormal">n</span><spanclass="mspace"style="margin−right:0.2222em;"></span><spanclass="mbin">−</span><spanclass="mspace"style="margin−right:0.2222em;"></span></span><spanclass="base"><spanclass="strut"style="height:1em;vertical−align:−0.25em;"></span><spanclass="mord">1</span><spanclass="mclose">)</span><spanclass="mspace"style="margin−right:1em;"></span><spanclass="mordtext"><spanclass="mord">for </span></span><spanclass="mordmathnormal">n</span><spanclass="mspace"style="margin−right:0.2778em;"></span><spanclass="mrel">≥</span><spanclass="mspace"style="margin−right:0.2778em;"></span></span><spanclass="base"><spanclass="strut"style="height:0.6444em;"></span><spanclass="mord">2</span></span></span></span></span><br>Let′sverify:<br>−\displaystyle .<br>Let's analyze the recurrence relation:<br><span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>x</mi><mi>n</mi></msub><mo>=</mo><mn>2</mn><msub><mi>x</mi><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msub><mo>+</mo><mo stretchy="false">(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo stretchy="false">)</mo><mspace width="1em"/><mtext>for </mtext><mi>n</mi><mo>≥</mo><mn>2</mn></mrow><annotation encoding="application/x-tex">x_n = 2 x_{n-1} + (n-1) \quad for \displaystyle \text{for } n ≥\displaystyle \ge 2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.5806em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal">x</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em;"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">n</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em;"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em;"></span></span><span class="base"><span class="strut" style="height:0.8528em;vertical-align:-0.2083em;"></span><span class="mord">2</span><span class="mord"><span class="mord mathnormal">x</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">n</span><span class="mbin mtight">−</span><span class="mord mtight">1</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2083em;"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em;"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em;"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mopen">(</span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.2222em;"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em;"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord">1</span><span class="mclose">)</span><span class="mspace" style="margin-right:1em;"></span><span class="mord text"><span class="mord">for </span></span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.2778em;"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em;"></span></span><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">2</span></span></span></span></span><br>Let's verify:<br>-x_1 = 6<br>−\displaystyle <br>-x_2 = 2(6) + 1 = 13<br>−\displaystyle <br>-x_3 = 2(13) + 2 = 28<br>−\displaystyle <br>-x_4 = 2(28) + 3 = 59$
Following this pattern, the next term is:
x5=2(59)+4=118+4=122x_5 = 2(59) + 4 = 118 + 4 = 122
Hence, **Option A** is the correct answer.

About This Chapter: Number Series, Coding and Decoding

Paper

Paper 3: Quantitative Aptitude

Weightage

5 Marks

Key Topics

Number series, Coding & Decoding, Odd man out

This chapter covers Number series, Coding & Decoding, Odd man out and is part of Paper 3: Quantitative Aptitude in the CA Foundation exam.

View Official ICAI Syllabus

Exam Strategy Tip

This topic carries 5 Marks weightage. Focus on understanding core concepts rather than memorizing.

Related Comparison Tables

More Questions from Number Series, Coding and Decoding

Ready to Master Number Series, Coding and Decoding?

Practice all 217 questions with instant feedback, earn XP, track your streaks, and ace your CA Foundation exam.

Start Practicing — It's Free