Use integer n=20 with 0≤n≤50 and integer k=20 with 0≤k≤n. The coefficient setting has commutative multiplication. Give (n, k, coefficient, symmetric_coefficient, equal).
G001 — Use integer n=20 with 0≤n≤50 and integer k=20 with 0≤k≤n. The coefficient setting has commutative multiplication. Give (n, k, coefficient, symmetric_coefficient, equal).
Definition and scope
Integer counting with 0≤k≤n. C(n,k) counts k-position subsets; the complement bijection gives symmetry.
The values agree with the complement bijection; n=0 still has exactly the empty subset.
Step identifiers and dependencies
Rule: coefficient_symmetry · Uses: G001, S004
Reverse checks
S005 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
S004 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
S003 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
S002 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
S001 · premise_and_result_audit — Count coefficients in the integers first; do not invert possibly nonunit factorials in a general coefficient ring.
Result
(20, 20, 1, 1, Yes)
The full substitutions and premise audits recover the original answer, retaining its field order and verdict meanings.
This question review and source binding
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.