Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
The number of permutations, of the digits 1, 2, 3, ..., 7 without repetition, which neither contain the string 153 nor the string 2467, is ___________.
Step 1: There are 7!=5040 permutations. Treating 153 as one block gives 5! arrangements containing that string; treating 2467 as one block gives 4!.
Step 2: If both strings occur, they are disjoint and form two blocks, which can be ordered in 2 ways. Inclusion-exclusion gives 5!+4!−2=142 permutations containing at least one forbidden string.
Step 3: Therefore neither string occurs in 5040−142=4898 permutations.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.