Use exact modulus n=56 and integer a=2. First require n≥2 and normalize a modulo n into the canonical nonnegative residue, then require gcd(a,n)=1. The order is the least positive return exponent, not any return. Mode=noncoprime. Give (mode, n, a, normalized_residue_or_null, gcd_or_null, unit_qualified, power_rows_or_null, order_or_undefined, boundary).
G001 — Use exact modulus n=56 and integer a=2. First require n≥2 and normalize a modulo n into the canonical nonnegative residue, then require gcd(a,n)=1. The order is the least positive return exponent, not any return. Mode=noncoprime. Give (mode, n, a, normalized_residue_or_null, gcd_or_null, unit_qualified, power_rows_or_null, order_or_undefined, boundary).
Definition and scope
For n<2 or a noncoprime residue the order is undefined; residue 1 has order 1; normalize a negative representative into [0,n) first.
This rejects the domain qualification; it does not set an undefined order to1.
Step identifiers and dependencies
Rule: nonunit_order_boundary · Uses: G001, S003
Reverse checks
S004 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
S003 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
S002 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
S001 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
Result
(noncoprime, 56, 2, 2, 2, No, null, undefined, mode_specific_multiplicative_order_boundary)
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.