Mathematics · Recurrence Relations
The solution to the recurrence relation: P(n) = 1, for n = 1 P(n) = n-1∑k=1 P(k)P(n-k), for n ≥ 2 is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n2)
- 2O(n4)
- 3Ω(n3)
- 4Ω(2n)✓
Correct answer
Ω(2n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Recurrence Relations MCQs →Want more practice questions on Recurrence Relations?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Recurrence Relations