The number of different 5 digit numbers greater than 50000 that can be formed using the digits 0, 1, 2, 3, 4, 5, 6, 7, such that the sum of their first and last digits should not be more than 8, is (1) 4608 (2) 5720 (3) 5719 (4) 4607

### Related Formula textTotal Words = sum textPermutations of each selection partition distribution case$$\text{Total Words} = \sum \text{Permutations of each selection partition distribution case}$$ ### Core Logic The word MATHS has 5 distinct letters: {M, A, T, H, S}. We need to form 6-letter words such that any chosen letter appears geq 2$\geq 2$ \times. We analyze combinations by structural frequency cases. ### Case 1: Single letter used 6 \times Format: a a a a a a$a a a a a a$ Choose 1 letter out of 5: binom51 = 5$\binom{5}{1} = 5$ words. ### Case 2: Two distinct letters used Subcase 2a: One letter 4 \times, another 2 \times (aaaa bb$aaaa bb$) textWords = binom52 times left( frac6!4! 2! times 2! right) = 10 times (15 times 2) = 300$$\text{Words} = \binom{5}{2} \times \left( \frac{6!}{4! 2!} \times 2! \right) = 10 \times (15 \times 2) = 300$$ Subcase 2b: Both letters used 3 \times each (aaa bbb$aaa bbb$) textWords = binom52 times frac6!3! 3! = 10 times 20 = 200$$\text{Words} = \binom{5}{2} \times \frac{6!}{3! 3!} = 10 \times 20 = 200$$ Total for Case 2 = 300 + 200 = 500$= 300 + 200 = 500$ words. ### Case 3: Three distinct letters used Format: Each letter appears exactly 2 \times (aa bb cc$aa bb cc$) textWords = binom53 times frac6!2! 2! 2! = 10 times 90 = 900text words.$$\text{Words} = \binom{5}{3} \times \frac{6!}{2! 2! 2!} = 10 \times 90 = 900\text{ words.}$$ ### Step 1: Calculate Total Words textTotal Words = 5 + 500 + 900 = 1405$$\text{Total Words} = 5 + 500 + 900 = 1405$$ ### Pattern Recognition When constraints enforce frequencies geq 2$\geq 2$, organize calculations strictly by number of distinct letters to cover all possibilities without overcounting. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 11 Mathematics: Permutations and Combinations

### Related Formula The number of ways to distribute m$m$ distinct items into k$k$ indistinguishable groups is given by the sum of Stirling numbers of the second kind: sum_r=1^k S(m, r)$$\sum_{r=1}^{k} S(m, r)$$ ### Core Logic Since the offices are **indistinguishable**, we look at partitions of the number 5$5$ into at most 4$4$ parts. Let's analyze each case based on distribution patterns: ### Step 1: Calculate Case Combinations - **Case 1: 5, 0, 0, 0$5, 0, 0, 0$** All employees in one office: frac5!5! = 1 text way$\frac{5!}{5!} = 1 \text{ way}$ - **Case 2: 4, 1, 0, 0$4, 1, 0, 0$** Four employees in one office, one in another: frac5!4!1! = 5 text ways$\frac{5!}{4!1!} = 5 \text{ ways}$ - **Case 3: 3, 2, 0, 0$3, 2, 0, 0$** Three employees in one office, two in another: frac5!3!2! = 10 text ways$\frac{5!}{3!2!} = 10 \text{ ways}$ - **Case 4: 3, 1, 1, 0$3, 1, 1, 0$** Three in one, and one each in two other offices. Since the two single-person offices are identical: frac5!3!1!1! cdot 2! = 10 text ways $$\frac{5!}{3!1!1! \cdot 2!} = 10 \text{ ways} $$ - **Case 5: 2, 2, 1, 0$2, 2, 1, 0$** Two groups of two, and one group of one. Since the two two-person offices are identical: frac5!2!2!1! cdot 2! = 15 text ways $$\frac{5!}{2!2!1! \cdot 2!} = 15 \text{ ways} $$ - **Case 6: 2, 1, 1, 1$2, 1, 1, 1$** One group of two, three groups of one. Since the three single-person offices are identical: frac5!2!(1!)^3 cdot 3! = 10 text ways $$\frac{5!}{2!(1!)^{3} \cdot 3!} = 10 \text{ ways} $$ ### Step 2: Total Sum Summing all these distinct non-overlapping partition groups: textTotal ways n = 1 + 5 + 10 + 10 + 15 + 10 = 51 $$\text{Total ways } n = 1 + 5 + 10 + 10 + 15 + 10 = 51 $$ ### Pattern Recognition Sees: Distinct items placed into identical/indistinguishable containers. Trap: When dividing items into groups of equal sizes (like two groups of 2$2$ or three groups of 1$1$), you must divide by the factorial of the frequency of those groups (2!$2!$ and 3!$3!$) to avoid overcounting permutations. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 11 Mathematics: Permutations and Combinations

### Related Formula For a linear equation x + 2y = k$x + 2y = k$, where x, y ge 0$x, y \ge 0$ are non-negative integers, the number of distinct integral pairs (x,y)$(x,y)$ is equal to the number of possible non-negative values that y$y$ can take, which is given by: leftlfloor frack2 rightrfloor + 1$$\left\lfloor \frac{k}{2} \right\rfloor + 1$$ ### Core Logic We need to find the number of non-negative integer solutions to: x + 2y + 3z = 42$$x + 2y + 3z = 42$$ Rearranging the equation to analyze values branch-by-branch based on z$z$: x + 2y = 42 - 3z$$x + 2y = 42 - 3z$$ Since x, y ge 0$x, y \ge 0$, the maximum value z$z$ can attain corresponds to x=0, y=0$x=0, y=0$, so 3z le 42 implies z le 14$3z \le 42 \implies z \le 14$. ### Step 1: Enumerate Values across all z configurations Let's count the possible solutions for each integer value of z$z$ from 0$0$ to 14$14$: - z = 0 implies x + 2y = 42 implies lfloor 42/2 rfloor + 1 = 22 text solutions$z = 0 \implies x + 2y = 42 \implies \lfloor 42/2 \rfloor + 1 = 22 \text{ solutions}$ - z = 1 implies x + 2y = 39 implies lfloor 39/2 rfloor + 1 = 20 text solutions$z = 1 \implies x + 2y = 39 \implies \lfloor 39/2 \rfloor + 1 = 20 \text{ solutions}$ - z = 2 implies x + 2y = 36 implies lfloor 36/2 rfloor + 1 = 19 text solutions$z = 2 \implies x + 2y = 36 \implies \lfloor 36/2 \rfloor + 1 = 19 \text{ solutions}$ - z = 3 implies x + 2y = 33 implies lfloor 33/2 rfloor + 1 = 17 text solutions$z = 3 \implies x + 2y = 33 \implies \lfloor 33/2 \rfloor + 1 = 17 \text{ solutions}$ - z = 4 implies x + 2y = 30 implies lfloor 30/2 rfloor + 1 = 16 text solutions$z = 4 \implies x + 2y = 30 \implies \lfloor 30/2 \rfloor + 1 = 16 \text{ solutions}$ - z = 5 implies x + 2y = 27 implies lfloor 27/2 rfloor + 1 = 14 text solutions$z = 5 \implies x + 2y = 27 \implies \lfloor 27/2 \rfloor + 1 = 14 \text{ solutions}$ - z = 6 implies x + 2y = 24 implies lfloor 24/2 rfloor + 1 = 13 text solutions$z = 6 \implies x + 2y = 24 \implies \lfloor 24/2 \rfloor + 1 = 13 \text{ solutions}$ - z = 7 implies x + 2y = 21 implies lfloor 21/2 rfloor + 1 = 11 text solutions$z = 7 \implies x + 2y = 21 \implies \lfloor 21/2 \rfloor + 1 = 11 \text{ solutions}$ - z = 8 implies x + 2y = 18 implies lfloor 18/2 rfloor + 1 = 10 text solutions$z = 8 \implies x + 2y = 18 \implies \lfloor 18/2 \rfloor + 1 = 10 \text{ solutions}$ - z = 9 implies x + 2y = 15 implies lfloor 15/2 rfloor + 1 = 8 text solutions$z = 9 \implies x + 2y = 15 \implies \lfloor 15/2 \rfloor + 1 = 8 \text{ solutions}$ - z = 10 implies x + 2y = 12 implies lfloor 12/2 rfloor + 1 = 7 text solutions$z = 10 \implies x + 2y = 12 \implies \lfloor 12/2 \rfloor + 1 = 7 \text{ solutions}$ - z = 11 implies x + 2y = 9 implies lfloor 9/2 rfloor + 1 = 5 text solutions$z = 11 \implies x + 2y = 9 \implies \lfloor 9/2 \rfloor + 1 = 5 \text{ solutions}$ - z = 12 implies x + 2y = 6 implies lfloor 6/2 rfloor + 1 = 4 text solutions$z = 12 \implies x + 2y = 6 \implies \lfloor 6/2 \rfloor + 1 = 4 \text{ solutions}$ - z = 13 implies x + 2y = 3 implies lfloor 3/2 rfloor + 1 = 2 text solutions$z = 13 \implies x + 2y = 3 \implies \lfloor 3/2 \rfloor + 1 = 2 \text{ solutions}$ - z = 14 implies x + 2y = 0 implies lfloor 0/2 rfloor + 1 = 1 text solution$z = 14 \implies x + 2y = 0 \implies \lfloor 0/2 \rfloor + 1 = 1 \text{ solution}$ ### Step 2: Total Sum Computation Summing all the calculated distribution counts: textTotal solutions = 22 + 20 + 19 + 17 + 16 + 14 + 13 + 11 + 10 + 8 + 7 + 5 + 4 + 2 + 1 = 169$$\text{Total solutions} = 22 + 20 + 19 + 17 + 16 + 14 + 13 + 11 + 10 + 8 + 7 + 5 + 4 + 2 + 1 = 169$$ ### Pattern Recognition Sees: Linear multi-variable diophantine solution constraints. Shortcut: Grouping into alternating arithmetic sequences can expedite the total calculation step instead of adding each discrete integer row manually. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 11 Mathematics: Permutations and Combinations

### Related Formula Since both the objects (books) and the containers (shelves) are identical, this problem is equivalent to finding the number of partitions of the integer 8$8$ into at most 4$4$ parts. ### Core Logic Let us systematically list out all the possible distributions based on the number of empty shelves: 1. **3 Shelves empty:** * (8, 0, 0, 0) rightarrow 1text way$(8, 0, 0, 0) \rightarrow 1\text{ way}$ 2. **2 Shelves empty:** * (7, 1, 0, 0)$(7, 1, 0, 0)$ * (6, 2, 0, 0)$(6, 2, 0, 0)$ * (5, 3, 0, 0)$(5, 3, 0, 0)$ * (4, 4, 0, 0) rightarrow 4text ways$(4, 4, 0, 0) \rightarrow 4\text{ ways}$ 3. **1 Shelf empty:** * (6, 1, 1, 0)$(6, 1, 1, 0)$ * (5, 2, 1, 0)$(5, 2, 1, 0)$ * (4, 3, 1, 0)$(4, 3, 1, 0)$ * (4, 2, 2, 0)$(4, 2, 2, 0)$ * (3, 3, 2, 0) rightarrow 5text ways$(3, 3, 2, 0) \rightarrow 5\text{ ways}$ 4. **0 Shelves empty:** * (5, 1, 1, 1)$(5, 1, 1, 1)$ * (4, 2, 1, 1)$(4, 2, 1, 1)$ * (3, 3, 1, 1)$(3, 3, 1, 1)$ * (3, 2, 2, 1)$(3, 2, 2, 1)$ * (2, 2, 2, 2) rightarrow 5text ways$(2, 2, 2, 2) \rightarrow 5\text{ ways}$ ### Step 1: Total Computations Summing all these cases together: textTotal ways = 1 + 4 + 5 + 5 = 15text ways$$\text{Total ways} = 1 + 4 + 5 + 5 = 15\text{ ways}$$ ### Pattern Recognition Be very careful to identify if containers/objects are identical or distinct. Identical into identical means simple partition of integers. Listing them in descending order ensures no partition is missed or duplicated. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 11 Mathematics: Permutations and Combinations

### Related Formula textPermutations of n text objects with p text identical elements = fracn!p!$$\text{Permutations of } n \text{ objects with } p \text{ identical elements } = \frac{n!}{p!}$$ ### Core Logic Alphabetize the letters in the word "GTWENTY": E, G, N, T, T, W, Y. We calculate the number of permutations that alphabetically precede "GTWENTY" by exhaustively scanning dictionary prefixes. ### Step 1: Calculate Block Combinations 1. Words starting with 'E': Remaining letters {G, N, T, T, W, Y}. We have 6 letters with 'T' repeating twice. Permutations = frac6!2! = frac7202 = 360$\frac{6!}{2!} = \frac{720}{2} = 360$. 2. Words starting with 'G': This locks the first letter. Next alphabetical letter is 'E'. - Starting with 'GE': Remaining {N, T, T, W, Y}. 5 letters, 'T' repeating. Permutations = frac5!2! = frac1202 = 60$\frac{5!}{2!} = \frac{120}{2} = 60$. - Starting with 'GN': Remaining {E, T, T, W, Y}. 5 letters, 'T' repeating. Permutations = frac5!2! = 60$\frac{5!}{2!} = 60$. - Starting with 'GT': This locks the second letter as well. We iterate through the remaining sorted pool {E, N, T, W, Y}. -- Starting with 'GTE': Remaining {N, T, W, Y}. No repetitions. Permutations = 4! = 24$4! = 24$. -- Starting with 'GTN': Remaining {E, T, W, Y}. No repetitions. Permutations = 4! = 24$4! = 24$. -- Starting with 'GTT': Remaining {E, N, W, Y}. No repetitions. Permutations = 4! = 24$4! = 24$. -- Starting with 'GTW': This locks the third letter. Iterate through {E, N, T, Y}. ### Step 2: Trace Remaining Exact String We are now tracking the prefix 'GTW'. The remaining letters alphabetically are E, N, T, Y. The target word is precisely built out of these letters in exact alphabetical order: E, then N, then T, then Y. This means "GTWENTY" is the very first word in the 'GTW' block. So, it adds exactly 1 to the count. ### Step 3: Sum the Permutations Total serial number = 360 + 60 + 60 + 24 + 24 + 24 + 1 = 553$360 + 60 + 60 + 24 + 24 + 24 + 1 = 553$. ### Pattern Recognition When calculating dictionary rank with repeating letters, remember to divide by p!$p!$ only when the repeating letter is roaming freely in the available blanks. If a repeating letter is 'locked' as the current prefix, it no longer acts as a repeater for the remaining slots. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 11 Mathematics: Permutations and Combinations