Mathematics · Combinatorics - Derangements
Consider the following statements regarding combinatorial permutations: Statement 1: In combinatorics, a derangement is defined as a permutation of a set where no element appears in its original position. Statement 2: The formula for the number of derangements of n objects is given by n![1 + 11! + 12! + ... + 1n!]. Which of the following is correct?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Both statements are true.
- 2Statement 1 is true, but Statement 2 is false.✓
- 3Statement 1 is false, but Statement 2 is true.
- 4Both statements are false.
Correct answer
Statement 1 is true, but Statement 2 is false.
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 - Derangements MCQs →Want more practice questions on Combinatorics - Derangements?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Combinatorics - Derangements