Derivations of formulas and their connections

This is the derangement of (5) objects and (D_5=44). In exams treat letters-envelope mismatch as a derangement pattern.

First choose the (k) correctly seated people, then derange the remaining (n-k). In exams use choose fixed plus derange rest for exactly fixed points.

Rotations are duplicates in the linear count (n!). In exams divide rotational overcount by (n) in circular arrangements.

In a bracelet, mirror images are considered the same. In exams divide the circular count by (2) when reflection is the same.

The block of three people and the remaining (5) people form (6) circular objects, giving (5!) arrangements. In exams use one less factorial for circular block objects.

Subtract adjacent block arrangements of (A,B) from total circular arrangements. In exams handle circular not-adjacent by complement.

First seat men in a circle in ((n-1)!) ways, then place women in gaps in (n!) ways. In exams fix one group first for circular alternation.

Only (1) of the (k!) relative orders of the special objects is allowed. In exams divide total arrangements by (k!) for fixed relative order.

Each of the two independent relative-order restrictions halves the count. In exams divide by (2^k) for independent before-after pairs.

In an even number, (0) may be the unit digit but cannot be the leading digit. In exams keep zero cases separate in digit problems.

The last digit can be (0) or (5), and (0) changes the first-digit restriction. In exams make unit-digit cases for divisibility by (5).

Choose the even positions, then each has (3) even choices and the rest have (4) odd choices. In exams choose positions first in exactly conditions.

Subtract all-distinct strings from total repetition-allowed strings. In exams solve at least repeat by the no-repeat complement.

First choose (s) symbols, then map the (r) positions onto those (s) symbols. In exams use the onto idea for exactly distinct symbols.

It is the multinomial count of choosing (a) from (p) brackets, (b) from (q), and (c) from (r). In exams treat multinomial coefficients like repeated arrangements.

The exponents sum to (8), and the coefficient comes from the multinomial form. In exams treat powers as group sizes.

On adding, odd-index terms cancel out. In exams use (x=1) and (x=-1) together for even-odd binomial sums.

The roots of unity filter separates indices modulo (3). In exams recognize that such sums differ from the usual even-odd method.

Factorial cancellation in consecutive combinations gives this ratio. In exams use adjacent ratios instead of calculating long values.

Near the maximum, the sequence transitions from increasing to decreasing. In exams locate the binomial coefficient peak by ratios.

For even (n), the middle index is single. In exams identify the central term by symmetry and ratio.

For odd (n), the two central complementary indices give equal maxima. In exams remember two middle terms in the odd case.

Unequal equal-combination indices are complementary, so (3r-1+r+5=20). In exams set the sum of lower indices equal to the upper index.

({}^{n}P_3=(n-2){}^{n}P_2), so (n-2=10). In exams solve quickly using consecutive permutation relations.

The ratio (\frac{n-r}{r+1}=\frac{2}{3}) gives (3n-3r=2r+2). In exams cross-multiply consecutive combination ratios.