Mathematics · Combinatorics
Using Pascal's identity recursively, C(2n + 2, n + 1) is equal to which of the following expressions?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1C(2n, n + 1) + C(2n, n) + C(2n, n - 1)
- 2C(2n, n + 1) + 2C(2n, n) + C(2n, n - 1)✓
- 3C(2n + 1, n + 1) + 2C(2n + 1, n) + C(2n + 1, n - 1)
- 4C(2n + 2, n + 1) + 2C(2n + 2, n) + C(2n + 2, n - 1)
Correct answer
C(2n, n + 1) + 2C(2n, n) + C(2n, n - 1)
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 Combinatorics MCQs →Want more practice questions on Combinatorics?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Combinatorics