Muft Shiksha™ एक 100% Free Education Portal है 🇮🇳, जिसका उद्देश्य Class 9–12 के हर विद्यार्थी तक High-Quality Education को पूरी तरह मुफ्त पहुँचाना है। 🇮🇳 हम मानते हैं कि अच्छी शिक्षा किसी student की आर्थिक स्थिति पर निर्भर नहीं होनी चाहिए। 🇮🇳 हर विद्यार्थी को वही Quality Study Material, MCQs, Quizzes, Exam Preparation, Concept-Based Learning और Bilingual Support मिलना चाहिए, जो आमतौर पर महंगी Coaching या Premium Platforms में मिलता है। Muft Shiksha™ 🇮🇳 इसी सोच के साथ बनाया गया है
In Class 9 Mathematics, the topic Recursive Rule in Sequences and Progressions explains how a sequence can be defined by giving one or more starting terms and a rule that uses earlier terms to find the next one. Students learn to read and write such rules, generate sequence terms step by step, recognize patterns, and check whether a rule correctly describes a sequence. The topic also connects recursive descriptions with familiar arithmetic and geometric progressions, helping students understand how terms change and how sequence patterns can be represented mathematically.
TOPIC PRACTICE
Quiz this set
Up to 8 questions from this page. Select your focus, then start.
Medium · Level 53 · sequences,geometric-progression,recursive-rule,Recursive rule,Sequences and Progressions,Mathematics,Class 9 MCQView options
(3, 6, 12, 24)
(3, −6, 12, −24)
(3, −2, 4, −8)
(−3, 6, −12, 24)
Question 1ExpertLevel 46
If (c_1=3) and (c_n=c_{n-1}+n(n-1)), which statement is correct?
Correct answer: C
In a recursive rule, each new term is obtained from the preceding term. For n=2, c_2=c_1+2(2-1)=3+2=5. Then, for n=3, c_3=c_2+3(3-1)=5+6=11. Hence, option C is correct. In option B, c_2 is correct, but c_3 is calculated incorrectly because 6 must be added. Exam tip: substitute the value of n separately at every step and use the previous term carefully.
If (g_1=2) and (g_n=2g_{n-1}+1), what is (g_5:g_4)?
Correct answer: D
Using the recursive rule successively, we get g_2=5, g_3=11, g_4=23, and g_5=47. Therefore, g_5:g_4=47:23, so (47:23) is correct. In (46:23), the second term is correct but the first term is off by 1. Exam tip: calculate the terms in order up to the required position and do not reverse the ratio.
If (h_1=3), (h_2=8), and (h_n=2h_{n-1}-h_{n-2}+2n), what is the value of (h_5)?
Correct answer: C
Apply the recursive rule step by step: \(h_3=2(8)-3+2(3)=19\). Next, \(h_4=2(19)-8+2(4)=38\), and \(h_5=2(38)-19+2(5)=67\). Therefore, the correct answer is \(67\). A value such as \(63\) can result from using the wrong value of \(n\) in \(2n\) or mishandling the subtraction of \(h_{n-2}\). Exam tip: substitute the value of \(n\) separately at every step.
If (p_1=2) and (p_n=p_{n-1}+n^2+n+1), what is the value of (p_5)?
Correct answer: B
In the recursive rule, substitute the current value of n at each step. Thus, p_2=2+(2^2+2+1)=9, p_3=9+13=22, p_4=22+21=43, and p_5=43+31=74. Therefore, the correct answer is 74. A value such as 68 can result from an incorrect term calculation. Exam tip: to move from p_1 to p_5, add the terms corresponding only to n=2,3,4,5.
If a₁ = 3 and r = −2, what are the first four terms?
Correct answer: B
The governing concept is the recursive rule of a geometric progression: each new term equals the preceding term multiplied by the common ratio. Start with a₁ = 3. Then a₂ = 3 × (−2) = −6, a₃ = −6 × (−2) = 12, and a₄ = 12 × (−2) = −24. Thus the first four terms are (3, −6, 12, −24), making option B correct. The negative ratio explains the alternating signs, while the magnitude doubles at each step. Option A incorrectly uses a positive ratio of 2. Option C treats the ratio as though it were the second term, and option D changes the given first term from 3 to −3. The recursive calculation confirms every entry.
Google Analytics helps us understand site usage. Google may send limited cookie-free signals before your choice. The Live Visitors widget operates independently of this analytics choice; see the privacy policy for its provider and fallback details. Essential site features work without analytics cookies. You can change your choice later in Privacy choices. Privacy policy