Mathematics · Permutations and Combinations
Let A be a set containing n elements. A subset P of A is chosen, and the set A is reconstructed by replacing the elements of P. A subset Q of A is chosen again. The number of ways of choosing P and Q such that Q contains exactly one element more than P is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12nCn+1
- 22nCn+2
- 32nCn
- 42nCn-1✓
Correct answer
2nCn-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 Permutations and Combinations MCQs →Want more practice questions on Permutations and Combinations?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Permutations and Combinations