Problem 6
A permutation of has property if for at least one . Prove that for every positive integer there are more permutations with property than without it.
Step 4 of 5: Truncate inclusion–exclusion
In plain words
Inclusion–exclusion needs only its first two layers for a useful lower bound.
Detailed analysis
The full inclusion–exclusion expression alternates with decreasing nonnegative terms, so truncating after pair intersections gives . Substituting Steps 2–3 yields .