# Question 27793: All Nonzero Prime Residues Pair with Inverses, with a Special p=2 Case [Return to catalogue page 139](https://ocme.evemisslab.com/en/questions/page/139/) [← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261015-advance-20261118-r04-wilson-theorem-foundations/#q-20261015-advance-20261118-r04-wilson-theorem-0043) This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth. R0054-27793 · q-20261015-advance-20261118-r04-wilson-theorem-0043 ## Original question and givens Use prime modulus p=61. Give (p, all_inverse_pairs, self_inverse_residues, distinct_cancelling_pairs, self_inverse_scope, factorial_residue, Wilson_congruence). - G001 — Use prime modulus p=61. Give (p, all_inverse_pairs, self_inverse_residues, distinct_cancelling_pairs, self_inverse_scope, factorial_residue, Wilson_congruence). ## Definition and scope Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate. - [mko-wilson-theorem](https://ocme.evemisslab.com/en/mko/mko-wilson-theorem/) ## Step-by-step derivation S001 · impliesBefore source roles = [wilson-prime-inverse-pairing] After derived = [[p, all_inverse_pairs, self_inverse_residues, distinct_cancelling_pairs, self_inverse_scope, factorial_residue, Wilson_congruence]] Conditions: none List the complete operation/mode field order without JavaScript or answer-shape inference;Boolean,string,null and an unclaimed result remain distinct. Step identifiers and dependenciesRule: source_ordered_fields_without_JS · Uses: G001 S002 · impliesBefore source roles = [61, 1] After derived = [1, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S001 S003 · impliesBefore source roles = [61, 2] After derived = [31, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S002 S004 · impliesBefore source roles = [61, 3] After derived = [41, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S003 S005 · impliesBefore source roles = [61, 4] After derived = [46, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S004 S006 · impliesBefore source roles = [61, 5] After derived = [49, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S005 S007 · impliesBefore source roles = [61, 6] After derived = [51, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S006 S008 · impliesBefore source roles = [61, 7] After derived = [35, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S007 S009 · impliesBefore source roles = [61, 8] After derived = [23, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S008 S010 · impliesBefore source roles = [61, 9] After derived = [34, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S009 S011 · impliesBefore source roles = [61, 10] After derived = [55, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S010 S012 · impliesBefore source roles = [61, 11] After derived = [50, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S011 S013 · impliesBefore source roles = [61, 12] After derived = [56, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S012 S014 · impliesBefore source roles = [61, 13] After derived = [47, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S013 S015 · impliesBefore source roles = [61, 14] After derived = [48, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S014 S016 · impliesBefore source roles = [61, 15] After derived = [57, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S015 S017 · impliesBefore source roles = [61, 16] After derived = [42, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S016 S018 · impliesBefore source roles = [61, 17] After derived = [18, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S017 S019 · impliesBefore source roles = [61, 18] After derived = [17, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S018 S020 · impliesBefore source roles = [61, 19] After derived = [45, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S019 S021 · impliesBefore source roles = [61, 20] After derived = [58, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S020 S022 · impliesBefore source roles = [61, 21] After derived = [32, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S021 S023 · impliesBefore source roles = [61, 22] After derived = [25, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S022 S024 · impliesBefore source roles = [61, 23] After derived = [8, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S023 S025 · impliesBefore source roles = [61, 24] After derived = [28, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S024 S026 · impliesBefore source roles = [61, 25] After derived = [22, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S025 S027 · impliesBefore source roles = [61, 26] After derived = [54, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S026 S028 · impliesBefore source roles = [61, 27] After derived = [52, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S027 S029 · impliesBefore source roles = [61, 28] After derived = [24, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S028 S030 · impliesBefore source roles = [61, 29] After derived = [40, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S029 S031 · impliesBefore source roles = [61, 30] After derived = [59, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S030 S032 · impliesBefore source roles = [61, 31] After derived = [2, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S031 S033 · impliesBefore source roles = [61, 32] After derived = [21, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S032 S034 · impliesBefore source roles = [61, 33] After derived = [37, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S033 S035 · impliesBefore source roles = [61, 34] After derived = [9, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S034 S036 · impliesBefore source roles = [61, 35] After derived = [7, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S035 S037 · impliesBefore source roles = [61, 36] After derived = [39, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S036 S038 · impliesBefore source roles = [61, 37] After derived = [33, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S037 S039 · impliesBefore source roles = [61, 38] After derived = [53, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S038 S040 · impliesBefore source roles = [61, 39] After derived = [36, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S039 S041 · impliesBefore source roles = [61, 40] After derived = [29, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S040 S042 · impliesBefore source roles = [61, 41] After derived = [3, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S041 S043 · impliesBefore source roles = [61, 42] After derived = [16, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S042 S044 · impliesBefore source roles = [61, 43] After derived = [44, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S043 S045 · impliesBefore source roles = [61, 44] After derived = [43, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S044 S046 · impliesBefore source roles = [61, 45] After derived = [19, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S045 S047 · impliesBefore source roles = [61, 46] After derived = [4, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S046 S048 · impliesBefore source roles = [61, 47] After derived = [13, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S047 S049 · impliesBefore source roles = [61, 48] After derived = [14, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S048 S050 · impliesBefore source roles = [61, 49] After derived = [5, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S049 S051 · impliesBefore source roles = [61, 50] After derived = [11, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S050 S052 · impliesBefore source roles = [61, 51] After derived = [6, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S051 S053 · impliesBefore source roles = [61, 52] After derived = [27, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S052 S054 · impliesBefore source roles = [61, 53] After derived = [38, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S053 S055 · impliesBefore source roles = [61, 54] After derived = [26, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S054 S056 · impliesBefore source roles = [61, 55] After derived = [10, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S055 S057 · impliesBefore source roles = [61, 56] After derived = [12, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S056 S058 · impliesBefore source roles = [61, 57] After derived = [15, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S057 S059 · impliesBefore source roles = [61, 58] After derived = [20, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S058 S060 · impliesBefore source roles = [61, 59] After derived = [30, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S059 S061 · impliesBefore source roles = [61, 60] After derived = [60, 1] Conditions: none Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a. Step identifiers and dependenciesRule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S060 S062 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product1 := mul(1, 1) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product1 = 1 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S061 S063 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 1, 1, 1] After derived = [0, 1, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S062 S064 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product2 := mul(1, 2) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product2 = 2 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S063 S065 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 2, 1, 2] After derived = [0, 2, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S064 S066 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product3 := mul(2, 3) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product3 = 6 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S065 S067 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 3, 2, 6] After derived = [0, 6, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S066 S068 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product4 := mul(6, 4) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product4 = 24 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S067 S069 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 4, 6, 24] After derived = [0, 24, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S068 S070 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product5 := mul(24, 5) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product5 = 120 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S069 S071 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 5, 24, 120] After derived = [1, 59, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S070 S072 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 := mul(59, 6) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 354 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S071 S073 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 6, 59, 354] After derived = [5, 49, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S072 S074 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 := mul(49, 7) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 343 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S073 S075 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 7, 49, 343] After derived = [5, 38, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S074 S076 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 := mul(38, 8) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 304 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S075 S077 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 8, 38, 304] After derived = [4, 60, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S076 S078 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 := mul(60, 9) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 540 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S077 S079 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 9, 60, 540] After derived = [8, 52, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S078 S080 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 := mul(52, 10) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 520 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S079 S081 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 10, 52, 520] After derived = [8, 32, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S080 S082 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 := mul(32, 11) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 352 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S081 S083 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 11, 32, 352] After derived = [5, 47, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S082 S084 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 := mul(47, 12) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 564 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S083 S085 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 12, 47, 564] After derived = [9, 15, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S084 S086 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 := mul(15, 13) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 195 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S085 S087 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 13, 15, 195] After derived = [3, 12, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S086 S088 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 := mul(12, 14) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 168 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S087 S089 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 14, 12, 168] After derived = [2, 46, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S088 S090 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 := mul(46, 15) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 = 690 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S089 S091 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 15, 46, 690] After derived = [11, 19, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S090 S092 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 := mul(19, 16) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 304 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S091 S093 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 16, 19, 304] After derived = [4, 60, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S092 S094 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(60, 17) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 1020 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S093 S095 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 17, 60, 1020] After derived = [16, 44, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S094 S096 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 := mul(44, 18) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 792 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S095 S097 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 18, 44, 792] After derived = [12, 60, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S096 S098 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 := mul(60, 19) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 = 1140 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S097 S099 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 19, 60, 1140] After derived = [18, 42, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S098 S100 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(42, 20) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 840 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S099 S101 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 20, 42, 840] After derived = [13, 47, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S100 S102 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(47, 21) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 987 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S101 S103 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 21, 47, 987] After derived = [16, 11, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S102 S104 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 := mul(11, 22) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 = 242 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S103 S105 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 22, 11, 242] After derived = [3, 59, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S104 S106 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 := mul(59, 23) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 = 1357 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S105 S107 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 23, 59, 1357] After derived = [22, 15, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S106 S108 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 := mul(15, 24) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 = 360 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S107 S109 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 24, 15, 360] After derived = [5, 55, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S108 S110 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 := mul(55, 25) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 = 1375 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S109 S111 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 25, 55, 1375] After derived = [22, 33, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S110 S112 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 := mul(33, 26) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 = 858 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S111 S113 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 26, 33, 858] After derived = [14, 4, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S112 S114 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 := mul(4, 27) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 = 108 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S113 S115 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 27, 4, 108] After derived = [1, 47, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S114 S116 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 := mul(47, 28) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 = 1316 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S115 S117 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 28, 47, 1316] After derived = [21, 35, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S116 S118 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 := mul(35, 29) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 = 1015 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S117 S119 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 29, 35, 1015] After derived = [16, 39, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S118 S120 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 := mul(39, 30) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 = 1170 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S119 S121 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 30, 39, 1170] After derived = [19, 11, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S120 S122 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 := mul(11, 31) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 = 341 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S121 S123 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 31, 11, 341] After derived = [5, 36, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S122 S124 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 := mul(36, 32) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 = 1152 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S123 S125 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 32, 36, 1152] After derived = [18, 54, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S124 S126 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 := mul(54, 33) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 = 1782 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S125 S127 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 33, 54, 1782] After derived = [29, 13, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S126 S128 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 := mul(13, 34) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 = 442 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S127 S129 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 34, 13, 442] After derived = [7, 15, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S128 S130 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 := mul(15, 35) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 = 525 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S129 S131 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 35, 15, 525] After derived = [8, 37, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S130 S132 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 := mul(37, 36) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 = 1332 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S131 S133 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 36, 37, 1332] After derived = [21, 51, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S132 S134 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 := mul(51, 37) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 = 1887 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S133 S135 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 37, 51, 1887] After derived = [30, 57, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S134 S136 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 := mul(57, 38) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 = 2166 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S135 S137 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 38, 57, 2166] After derived = [35, 31, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S136 S138 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 := mul(31, 39) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 = 1209 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S137 S139 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 39, 31, 1209] After derived = [19, 50, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S138 S140 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 := mul(50, 40) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 = 2000 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S139 S141 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 40, 50, 2000] After derived = [32, 48, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S140 S142 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 := mul(48, 41) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 = 1968 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S141 S143 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 41, 48, 1968] After derived = [32, 16, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S142 S144 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 := mul(16, 42) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 = 672 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S143 S145 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 42, 16, 672] After derived = [11, 1, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S144 S146 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 := mul(1, 43) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 = 43 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S145 S147 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 43, 1, 43] After derived = [0, 43, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S146 S148 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 := mul(43, 44) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 = 1892 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S147 S149 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 44, 43, 1892] After derived = [31, 1, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S148 S150 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 := mul(1, 45) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 = 45 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S149 S151 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 45, 1, 45] After derived = [0, 45, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S150 S152 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 := mul(45, 46) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 = 2070 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S151 S153 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 46, 45, 2070] After derived = [33, 57, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S152 S154 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 := mul(57, 47) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 = 2679 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S153 S155 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 47, 57, 2679] After derived = [43, 56, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S154 S156 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 := mul(56, 48) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 = 2688 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S155 S157 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 48, 56, 2688] After derived = [44, 4, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S156 S158 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 := mul(4, 49) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 = 196 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S157 S159 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 49, 4, 196] After derived = [3, 13, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S158 S160 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 := mul(13, 50) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 = 650 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S159 S161 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 50, 13, 650] After derived = [10, 40, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S160 S162 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 := mul(40, 51) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 = 2040 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S161 S163 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 51, 40, 2040] After derived = [33, 27, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S162 S164 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 := mul(27, 52) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 = 1404 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S163 S165 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 52, 27, 1404] After derived = [23, 1, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S164 S166 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 := mul(1, 53) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 = 53 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S165 S167 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 53, 1, 53] After derived = [0, 53, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S166 S168 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 := mul(53, 54) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 = 2862 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S167 S169 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 54, 53, 2862] After derived = [46, 56, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S168 S170 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 := mul(56, 55) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 = 3080 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S169 S171 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 55, 56, 3080] After derived = [50, 30, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S170 S172 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 := mul(30, 56) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 = 1680 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S171 S173 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 56, 30, 1680] After derived = [27, 33, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S172 S174 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 := mul(33, 57) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 = 1881 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S173 S175 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 57, 33, 1881] After derived = [30, 51, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S174 S176 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 := mul(51, 58) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 = 2958 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S175 S177 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 58, 51, 2958] After derived = [48, 30, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S176 S178 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 := mul(30, 59) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 = 1770 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S177 S179 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 59, 30, 1770] After derived = [29, 1, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S178 S180 · calculationBefore Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 := mul(1, 60) After Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 = 60 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S179 S181 · impliesBefore source roles = [Wilson ORIGINAL prime factorial, 61, 60, 1, 60] After derived = [0, 60, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S180 S182 · impliesBefore source roles = [61, [[1, 1], [2, 31], [3, 41], [4, 46], [5, 49], [6, 51], [7, 35], [8, 23], [9, 34], [10, 55], [11, 50], [12, 56], [13, 47], [14, 48], [15, 57], [16, 42], [17, 18], [18, 17], [19, 45], [20, 58], [21, 32], [22, 25], [23, 8], [24, 28], [25, 22], [26, 54], [27, 52], [28, 24], [29, 40], [30, 59], [31, 2], [32, 21], [33, 37], [34, 9], [35, 7], [36, 39], [37, 33], [38, 53], [39, 36], [40, 29], [41, 3], [42, 16], [43, 44], [44, 43], [45, 19], [46, 4], [47, 13], [48, 14], [49, 5], [50, 11], [51, 6], [52, 27], [53, 38], [54, 26], [55, 10], [56, 12], [57, 15], [58, 20], [59, 30], [60, 60]]] After derived = [[1, 60], [[2, 31, 1], [3, 41, 1], [4, 46, 1], [5, 49, 1], [6, 51, 1], [7, 35, 1], [8, 23, 1], [9, 34, 1], [10, 55, 1], [11, 50, 1], [12, 56, 1], [13, 47, 1], [14, 48, 1], [15, 57, 1], [16, 42, 1], [17, 18, 1], [19, 45, 1], [20, 58, 1], [21, 32, 1], [22, 25, 1], [24, 28, 1], [26, 54, 1], [27, 52, 1], [29, 40, 1], [30, 59, 1], [33, 37, 1], [36, 39, 1], [38, 53, 1], [43, 44, 1]], 60, Yes] Conditions: none Nonself inverse pairs multiply to1.A self-inverse satisfies(r-1)(r+1)=0 modulo a prime,so is±1.For p>2 their product is-1;at p2 only the single1=-1 remains.This general teaching argument does not turn the finite table/program into a Lean proof. Step identifiers and dependenciesRule: Wilson_GENERAL_inverse_pairing_and_p2_exception · Uses: G001, S181 ## Reverse checks - S182 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S181 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S180 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 with exact rational arithmetic, not rounded decimals. - S179 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S178 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 with exact rational arithmetic, not rounded decimals. - S177 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S176 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 with exact rational arithmetic, not rounded decimals. - S175 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S174 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 with exact rational arithmetic, not rounded decimals. - S173 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S172 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 with exact rational arithmetic, not rounded decimals. - S171 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S170 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 with exact rational arithmetic, not rounded decimals. - S169 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S168 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 with exact rational arithmetic, not rounded decimals. - S167 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S166 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 with exact rational arithmetic, not rounded decimals. - S165 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S164 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 with exact rational arithmetic, not rounded decimals. - S163 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S162 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 with exact rational arithmetic, not rounded decimals. - S161 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S160 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 with exact rational arithmetic, not rounded decimals. - S159 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S158 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 with exact rational arithmetic, not rounded decimals. - S157 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S156 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 with exact rational arithmetic, not rounded decimals. - S155 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S154 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 with exact rational arithmetic, not rounded decimals. - S153 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S152 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 with exact rational arithmetic, not rounded decimals. - S151 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S150 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 with exact rational arithmetic, not rounded decimals. - S149 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S148 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 with exact rational arithmetic, not rounded decimals. - S147 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S146 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 with exact rational arithmetic, not rounded decimals. - S145 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S144 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 with exact rational arithmetic, not rounded decimals. - S143 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S142 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 with exact rational arithmetic, not rounded decimals. - S141 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S140 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 with exact rational arithmetic, not rounded decimals. - S139 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S138 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 with exact rational arithmetic, not rounded decimals. - S137 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S136 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 with exact rational arithmetic, not rounded decimals. - S135 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S134 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 with exact rational arithmetic, not rounded decimals. - S133 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S132 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 with exact rational arithmetic, not rounded decimals. - S131 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S130 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 with exact rational arithmetic, not rounded decimals. - S129 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S128 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 with exact rational arithmetic, not rounded decimals. - S127 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S126 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 with exact rational arithmetic, not rounded decimals. - S125 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S124 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 with exact rational arithmetic, not rounded decimals. - S123 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S122 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 with exact rational arithmetic, not rounded decimals. - S121 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S120 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 with exact rational arithmetic, not rounded decimals. - S119 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S118 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 with exact rational arithmetic, not rounded decimals. - S117 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S116 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 with exact rational arithmetic, not rounded decimals. - S115 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S114 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 with exact rational arithmetic, not rounded decimals. - S113 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S112 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 with exact rational arithmetic, not rounded decimals. - S111 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S110 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 with exact rational arithmetic, not rounded decimals. - S109 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S108 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 with exact rational arithmetic, not rounded decimals. - S107 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S106 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 with exact rational arithmetic, not rounded decimals. - S105 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S104 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 with exact rational arithmetic, not rounded decimals. - S103 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S102 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 with exact rational arithmetic, not rounded decimals. - S101 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S100 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 with exact rational arithmetic, not rounded decimals. - S099 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S098 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 with exact rational arithmetic, not rounded decimals. - S097 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S096 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 with exact rational arithmetic, not rounded decimals. - S095 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S094 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 with exact rational arithmetic, not rounded decimals. - S093 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S092 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 with exact rational arithmetic, not rounded decimals. - S091 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S090 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 with exact rational arithmetic, not rounded decimals. - S089 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S088 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 with exact rational arithmetic, not rounded decimals. - S087 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S086 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 with exact rational arithmetic, not rounded decimals. - S085 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S084 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 with exact rational arithmetic, not rounded decimals. - S083 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S082 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 with exact rational arithmetic, not rounded decimals. - S081 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S080 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 with exact rational arithmetic, not rounded decimals. - S079 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S078 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 with exact rational arithmetic, not rounded decimals. - S077 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S076 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 with exact rational arithmetic, not rounded decimals. - S075 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S074 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 with exact rational arithmetic, not rounded decimals. - S073 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S072 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 with exact rational arithmetic, not rounded decimals. - S071 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S070 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product5 with exact rational arithmetic, not rounded decimals. - S069 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S068 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product4 with exact rational arithmetic, not rounded decimals. - S067 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S066 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product3 with exact rational arithmetic, not rounded decimals. - S065 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S064 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product2 with exact rational arithmetic, not rounded decimals. - S063 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S062 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product1 with exact rational arithmetic, not rounded decimals. - S061 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S060 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S059 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S058 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S057 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S056 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S055 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S054 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S053 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S052 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S051 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S050 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S049 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S048 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S047 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S046 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S045 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S044 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S043 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S042 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S041 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S040 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S039 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S038 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S037 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S036 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S035 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S034 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S033 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S032 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S031 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S030 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S029 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S028 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S027 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S026 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S025 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S024 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S023 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S022 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S021 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S020 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S019 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S018 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S017 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S016 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S015 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S014 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S013 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S012 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S011 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S010 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S009 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S008 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S007 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S006 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S005 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S004 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S003 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S002 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S001 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. ## Result (61, [[1, 1], [2, 31], [3, 41], [4, 46], [5, 49], [6, 51], [7, 35], [8, 23], [9, 34], [10, 55], [11, 50], [12, 56], [13, 47], [14, 48], [15, 57], [16, 42], [17, 18], [18, 17], [19, 45], [20, 58], [21, 32], [22, 25], [23, 8], [24, 28], [25, 22], [26, 54], [27, 52], [28, 24], [29, 40], [30, 59], [31, 2], [32, 21], [33, 37], [34, 9], [35, 7], [36, 39], [37, 33], [38, 53], [39, 36], [40, 29], [41, 3], [42, 16], [43, 44], [44, 43], [45, 19], [46, 4], [47, 13], [48, 14], [49, 5], [50, 11], [51, 6], [52, 27], [53, 38], [54, 26], [55, 10], [56, 12], [57, 15], [58, 20], [59, 30], [60, 60]], [1, 60], [[2, 31, 1], [3, 41, 1], [4, 46, 1], [5, 49, 1], [6, 51, 1], [7, 35, 1], [8, 23, 1], [9, 34, 1], [10, 55, 1], [11, 50, 1], [12, 56, 1], [13, 47, 1], [14, 48, 1], [15, 57, 1], [16, 42, 1], [17, 18, 1], [19, 45, 1], [20, 58, 1], [21, 32, 1], [22, 25, 1], [24, 28, 1], [26, 54, 1], [27, 52, 1], [29, 40, 1], [30, 59, 1], [33, 37, 1], [36, 39, 1], [38, 53, 1], [43, 44, 1]], self_inverse_residues_1_and_p_minus_1, 60, Yes) The full substitutions and premise checks give the original answer; source identity,format and status are unchanged. ## 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. Source hashes and review receipts - input commit: 0f7be61e2c22317a4075561dc822c87d881a50db - original question SHA-256: fd37945115ea2b8850f3711fe9df9e4ef05538e70d2ead96e27014e13f81dfde - candidate record SHA-256: 4844347c5f1358d2c744c32a25edb51a564b464eae323e2a78d4f15e95243d9b - semantic review receipt SHA-256: 0a76d8e93c08bb16998a0483f3dfc0504f269fc3e1982e6cd868cab0a2856d54 - question-first witness SHA-256: 09127b736c225714dfa0b7ceb0e6a6e66df27438b480cad8217d3c2f99ce9437 - Lean: NOT_RUN · human review: NOT_PERFORMED [Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261015-advance-20261118-r04-wilson-theorem-0043.json)