Permutations with At Least One Restriction

Permutations with At Least One Restriction

## Formula

If $$a$$ represents the total arrangements and $$b$$ represents arrangements violating the restriction:

$$\text{Required arrangements}=A-B$$

For multiple restrictions, use inclusion-exclusion:

$$N=N_0-\sum N_1+\sum N_2-\sum N_3+\cdots$$

## Usage

- Used when arrangements are subject to one or more restrictions and complementary counting is convenient.