Derivations of formulas and their connections

Total circular arrangements are (7!), and the adjacent block occurs in (2\cdot6!) ways. In exams handle circular not-adjacent by complement.

The circular arrangement of (7) couple-blocks is (6!), and each block has (2) internal orders. In exams use blocks minus one factorial for circular block count.

Seat the men in a circle in (5!) ways, then place the women in the (6) gaps in (6!) ways. In exams do not add a starting factor (2) in circular alternation.

In a bracelet, rotations and reflections are considered the same. In exams use (\frac{(n-1)!}{2}) for bracelet count.

When the last digit is fixed as (0), the remaining (4) places use ordered selection from (8) non-zero digits. In exams the zero-last case removes the leading restriction.

There are (4) choices for the last digit, (7) remaining non-zero choices for the first digit, and then (3) places are filled. In exams separate zero and non-zero even cases.

Choose exactly (2) odd positions, then multiply choices of odd and even digits. In exams choose positions first in exactly-type digit questions.

Every symbol appearing is an onto condition, so missing symbols are removed by inclusion-exclusion. In exams treat at least once as onto mapping.

First choose (3) symbols, then form onto strings on (7) positions. In exams use choose set plus onto count for exactly distinct symbols.

Choose the repeated symbol, choose the remaining (r-2) distinct symbols, then arrange the multiset. In exams fix the repeated item first for exactly one repeat.

This is the multinomial count of dividing (n) brackets into sizes (p,q,r,s). In exams treat exponents as group sizes.

The powers sum to (9), and the coefficient comes from the multinomial form. In exams use a repeated-arrangement style denominator in multinomial terms.

There are two disjoint cases to form (x^2). In exams make exponent-sum cases for polynomial expansion coefficients.

Case (1): choose one (x^2), case (2): choose two (x)'s. In exams add all cases that produce the same power.

The cube roots of unity filter is used to separate modulo (3) classes. In exams distinguish (3)-step coefficient sums from even-odd sums.

This ratio shows the direction of increase and decrease in consecutive binomial coefficients. In exams compare the ratio with (1) to locate the peak.

The ratio (\frac{n-r}{r+1}>1) must hold. In exams compare consecutive ratios with (1) for monotonicity.

Unequal equal-combination indices are complementary. In exams set the sum of lower indices equal to the upper index.

Complementary indices give (2r-1+r+8=24), so (r=6). In exams check same-index and complement cases separately in equal combinations.

({}^{n}P_4=(n-3){}^{n}P_3), so (n-3=12). In exams apply the consecutive permutation relation directly.

From (\frac{n-r}{r+1}=\frac{3}{4}), we get (4n-4r=3r+3). In exams cross-multiply ratio equations.

The ratio is (\frac{{}^{n}C_r}{{}^{n}C_{r-1}}=\frac{n-r+1}{r}). In exams keep the direction of consecutive combination ratios correct.

The complement of at least (2) special is (0) special or exactly (1) special. In exams subtract all unwanted cases in the complement.

Case (1): both are included, case (2): both are excluded. In exams split paired restrictions into two disjoint cases.

Subtract selections containing both (A,B) from total selections. In exams complement is the shortest route for not-together selection.