Home
Class 12
MATHS
The number of arrangments of all digits ...

The number of arrangments of all digits of `12345` such that at least `3` digits will not come in its position is

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of finding the number of arrangements of the digits of `12345` such that at least `3` digits do not occupy their original positions, we will use the concept of derangements. Here's a step-by-step solution: ### Step 1: Understand the Problem We need to find arrangements where at least 3 digits are not in their original positions. This means we can have cases where exactly 3, exactly 4, or all 5 digits are not in their original positions. ### Step 2: Define Derangements A derangement is a permutation of a set where none of the elements appear in their original position. The formula for the number of derangements \( !n \) of \( n \) items is given by: \[ !n = n! \sum_{i=0}^{n} \frac{(-1)^i}{i!} \] ### Step 3: Calculate Derangements for Each Case #### Case 1: Exactly 3 Digits Not in Position 1. Choose 3 digits from 5: \( \binom{5}{3} = 10 \) 2. Derangement of 3 digits: \( !3 = 3! \left(1 - \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!}\right) = 6 \left(1 - 1 + 0.5 - \frac{1}{6}\right) = 6 \left(0.5 - \frac{1}{6}\right) = 6 \left(\frac{3}{6} - \frac{1}{6}\right) = 6 \cdot \frac{2}{6} = 2 \) 3. Total arrangements for this case: \( 10 \times 2 = 20 \) #### Case 2: Exactly 4 Digits Not in Position 1. Choose 4 digits from 5: \( \binom{5}{4} = 5 \) 2. Derangement of 4 digits: \( !4 = 4! \left(1 - \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!} + \frac{1}{4!}\right) = 24 \left(1 - 1 + 0.5 - \frac{1}{6} + \frac{1}{24}\right) = 24 \left(0.5 - \frac{1}{6} + \frac{1}{24}\right) \) - Calculate: \( 0.5 = \frac{12}{24}, \frac{1}{6} = \frac{4}{24}, \frac{1}{24} = \frac{1}{24} \) - So, \( !4 = 24 \left(\frac{12 - 4 + 1}{24}\right) = 24 \times \frac{9}{24} = 9 \) 3. Total arrangements for this case: \( 5 \times 9 = 45 \) #### Case 3: All 5 Digits Not in Position 1. Derangement of 5 digits: \( !5 = 5! \left(1 - \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!} + \frac{1}{4!} - \frac{1}{5!}\right) = 120 \left(1 - 1 + 0.5 - \frac{1}{6} + \frac{1}{24} - \frac{1}{120}\right) \) - Calculate: \( 0.5 - \frac{1}{6} + \frac{1}{24} - \frac{1}{120} = \frac{60 - 10 + 2 - 0.5}{120} = \frac{51.5}{120} = \frac{103}{240} \) - So, \( !5 = 120 \times \frac{44}{120} = 44 \) ### Step 4: Total Arrangements Now, we add the total arrangements from all cases: \[ \text{Total} = 20 + 45 + 44 = 109 \] ### Final Answer The number of arrangements of the digits of `12345` such that at least `3` digits do not come in their original position is **109**.

To solve the problem of finding the number of arrangements of the digits of `12345` such that at least `3` digits do not occupy their original positions, we will use the concept of derangements. Here's a step-by-step solution: ### Step 1: Understand the Problem We need to find arrangements where at least 3 digits are not in their original positions. This means we can have cases where exactly 3, exactly 4, or all 5 digits are not in their original positions. ### Step 2: Define Derangements A derangement is a permutation of a set where none of the elements appear in their original position. The formula for the number of derangements \( !n \) of \( n \) items is given by: \[ ...
Promotional Banner

Similar Questions

Explore conceptually related problems

Number of natural numbers between 100 & 1000 such that at least one of their digits is 6, is

Find the number of numbers of six digits that can be formd with the digits 1,2,3,4 if all the digits are to asppear in the same number at least once.

The number of four-digit numbers that can be formed by using the digits 1,2,3,4,5,6,7,8 and 9 such that the least digit used is 4 , when repetition of digits is allowed is

How many four digit numbers can be formed using digits 1, 2, 3, 4, 5 such that at least one of the number is respeated?

Find the number of all 6-digit natural numbers such that the sum of their digits is 10 and each of the digits 0,1,2,3 occurs at least once in them.

Let ' m ' denotes the number of four digit numbers such that the left most digit is odd, the second digit is even and all four digits are different and ' n ' denotes the number of four digit numbers such that left most digit is even, second digit is odd and all four digit are different. If m=nk, then k equals :

how many different nine digit numbers can be formed from the number 22 33 55 888 by rearranging its digits so that the odd digits occupy even positions:

What is the smallest 3-digit number with unique digits?

Let n denote the number of all n-digit positive integers formed by the digits 0, 1 or both such that no consecutive digits in them are 0. Let b_n = the number of such n-digit integers ending with digit 1 and c_n = the number of such n-digit integers ending with digit 0. The value of b_6 , is

Number of four digit numbers in which at least one digit occurs more than once, is :