The number of permutations, of the digits 1, 2, 3, ..., 7 without repetition, which neither contain the string 153 nor the string 2467, is _______.
We need the number of permutations of 1-7 that contain neither "153" nor "2467" as substrings. The total number of permutations is .
Counting those containing "153", we treat "153" as a single block, giving 5 objects to arrange: [153], 2, 4, 6, 7, so . Counting those containing "2467", we treat "2467" as a single block, giving 4 objects: 1, [2467], 3, 5, so .
When both "153" and "2467" are present, the two blocks use all 7 digits, and arranging the blocks [153] and [2467] gives . By inclusion-exclusion, , so the number of permutations without these substrings is .
The answer is 4898.
Tagged Arrangements with restrictions. Machine-assigned, so read it as a strong shortlist rather than a verdict.