Step-by-step derivation
S001 · implies
Before
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 dependencies
Rule: source_ordered_fields_without_JS · Uses: G001
S002 · implies
Before
source roles = [53, 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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S001
S003 · implies
Before
source roles = [53, 2]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S002
S004 · implies
Before
source roles = [53, 3]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S003
S005 · implies
Before
source roles = [53, 4]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S004
S006 · implies
Before
source roles = [53, 5]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S005
S007 · implies
Before
source roles = [53, 6]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S006
S008 · implies
Before
source roles = [53, 7]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S007
S009 · implies
Before
source roles = [53, 8]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S008
S010 · implies
Before
source roles = [53, 9]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S009
S011 · implies
Before
source roles = [53, 10]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S010
S012 · implies
Before
source roles = [53, 11]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S011
S013 · implies
Before
source roles = [53, 12]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S012
S014 · implies
Before
source roles = [53, 13]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S013
S015 · implies
Before
source roles = [53, 14]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S014
S016 · implies
Before
source roles = [53, 15]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S015
S017 · implies
Before
source roles = [53, 16]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S016
S018 · implies
Before
source roles = [53, 17]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S017
S019 · implies
Before
source roles = [53, 18]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S018
S020 · implies
Before
source roles = [53, 19]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S019
S021 · implies
Before
source roles = [53, 20]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S020
S022 · implies
Before
source roles = [53, 21]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S021
S023 · implies
Before
source roles = [53, 22]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S022
S024 · implies
Before
source roles = [53, 23]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S023
S025 · implies
Before
source roles = [53, 24]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S024
S026 · implies
Before
source roles = [53, 25]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S025
S027 · implies
Before
source roles = [53, 26]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S026
S028 · implies
Before
source roles = [53, 27]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S027
S029 · implies
Before
source roles = [53, 28]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S028
S030 · implies
Before
source roles = [53, 29]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S029
S031 · implies
Before
source roles = [53, 30]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S030
S032 · implies
Before
source roles = [53, 31]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S031
S033 · implies
Before
source roles = [53, 32]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S032
S034 · implies
Before
source roles = [53, 33]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S033
S035 · implies
Before
source roles = [53, 34]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S034
S036 · implies
Before
source roles = [53, 35]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S035
S037 · implies
Before
source roles = [53, 36]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S036
S038 · implies
Before
source roles = [53, 37]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S037
S039 · implies
Before
source roles = [53, 38]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S038
S040 · implies
Before
source roles = [53, 39]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S039
S041 · implies
Before
source roles = [53, 40]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S040
S042 · implies
Before
source roles = [53, 41]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S041
S043 · implies
Before
source roles = [53, 42]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S042
S044 · implies
Before
source roles = [53, 43]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S043
S045 · implies
Before
source roles = [53, 44]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S044
S046 · implies
Before
source roles = [53, 45]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S045
S047 · implies
Before
source roles = [53, 46]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S046
S048 · implies
Before
source roles = [53, 47]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S047
S049 · implies
Before
source roles = [53, 48]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S048
S050 · implies
Before
source roles = [53, 49]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S049
S051 · implies
Before
source roles = [53, 50]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S050
S052 · implies
Before
source roles = [53, 51]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S051
S053 · implies
Before
source roles = [53, 52]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S052
S054 · calculation
Before
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S053
S055 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S054
S056 · calculation
Before
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S055
S057 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S056
S058 · calculation
Before
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S057
S059 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S058
S060 · calculation
Before
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S059
S061 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S060
S062 · calculation
Before
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S061
S063 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 5, 24, 120]
After
derived = [2, 14, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S062
S064 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 := mul(14, 6)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 84
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S063
S065 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 6, 14, 84]
After
derived = [1, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S064
S066 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 := mul(31, 7)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 217
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S065
S067 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 7, 31, 217]
After
derived = [4, 5, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S066
S068 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 := mul(5, 8)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 40
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S067
S069 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 8, 5, 40]
After
derived = [0, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S068
S070 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 := mul(40, 9)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S069
S071 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 9, 40, 360]
After
derived = [6, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S070
S072 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 := mul(42, 10)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 420
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S071
S073 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 10, 42, 420]
After
derived = [7, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S072
S074 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 := mul(49, 11)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 539
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S073
S075 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 11, 49, 539]
After
derived = [10, 9, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S074
S076 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 := mul(9, 12)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S075
S077 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 12, 9, 108]
After
derived = [2, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S076
S078 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 := mul(2, 13)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 26
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S077
S079 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 13, 2, 26]
After
derived = [0, 26, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S078
S080 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 := mul(26, 14)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 364
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S079
S081 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 14, 26, 364]
After
derived = [6, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S080
S082 · calculation
Before
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S081
S083 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 15, 46, 690]
After
derived = [13, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S082
S084 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 := mul(1, 16)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 16
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S083
S085 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 16, 1, 16]
After
derived = [0, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S084
S086 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(16, 17)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 272
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S085
S087 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 17, 16, 272]
After
derived = [5, 7, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S086
S088 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 := mul(7, 18)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 126
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S087
S089 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 18, 7, 126]
After
derived = [2, 20, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S088
S090 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 := mul(20, 19)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 = 380
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S089
S091 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 19, 20, 380]
After
derived = [7, 9, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S090
S092 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(9, 20)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 180
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S091
S093 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 20, 9, 180]
After
derived = [3, 21, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S092
S094 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(21, 21)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 441
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S093
S095 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 21, 21, 441]
After
derived = [8, 17, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S094
S096 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 := mul(17, 22)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 = 374
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S095
S097 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 22, 17, 374]
After
derived = [7, 3, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S096
S098 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 := mul(3, 23)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 = 69
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S097
S099 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 23, 3, 69]
After
derived = [1, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S098
S100 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 := mul(16, 24)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 = 384
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S099
S101 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 24, 16, 384]
After
derived = [7, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S100
S102 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 := mul(13, 25)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 = 325
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S101
S103 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 25, 13, 325]
After
derived = [6, 7, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S102
S104 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 := mul(7, 26)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 = 182
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S103
S105 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 26, 7, 182]
After
derived = [3, 23, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S104
S106 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 := mul(23, 27)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 = 621
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S105
S107 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 27, 23, 621]
After
derived = [11, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S106
S108 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 := mul(38, 28)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 = 1064
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S107
S109 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 28, 38, 1064]
After
derived = [20, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S108
S110 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 := mul(4, 29)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 = 116
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S109
S111 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 29, 4, 116]
After
derived = [2, 10, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S110
S112 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 := mul(10, 30)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 = 300
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S111
S113 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 30, 10, 300]
After
derived = [5, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S112
S114 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 := mul(35, 31)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 = 1085
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S113
S115 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 31, 35, 1085]
After
derived = [20, 25, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S114
S116 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 := mul(25, 32)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 = 800
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S115
S117 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 32, 25, 800]
After
derived = [15, 5, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S116
S118 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 := mul(5, 33)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 = 165
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S117
S119 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 33, 5, 165]
After
derived = [3, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S118
S120 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 := mul(6, 34)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 = 204
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S119
S121 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 34, 6, 204]
After
derived = [3, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S120
S122 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 := mul(45, 35)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 = 1575
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S121
S123 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 35, 45, 1575]
After
derived = [29, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S122
S124 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 := mul(38, 36)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 = 1368
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S123
S125 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 36, 38, 1368]
After
derived = [25, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S124
S126 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 := mul(43, 37)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 = 1591
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S125
S127 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 37, 43, 1591]
After
derived = [30, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S126
S128 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 := mul(1, 38)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 = 38
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S127
S129 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 38, 1, 38]
After
derived = [0, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S128
S130 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 := mul(38, 39)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 = 1482
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S129
S131 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 39, 38, 1482]
After
derived = [27, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S130
S132 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 := mul(51, 40)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 = 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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S131
S133 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 40, 51, 2040]
After
derived = [38, 26, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S132
S134 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 := mul(26, 41)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 = 1066
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S133
S135 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 41, 26, 1066]
After
derived = [20, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S134
S136 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 := mul(6, 42)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 = 252
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S135
S137 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 42, 6, 252]
After
derived = [4, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S136
S138 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 := mul(40, 43)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 = 1720
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S137
S139 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 43, 40, 1720]
After
derived = [32, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S138
S140 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 := mul(24, 44)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 = 1056
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S139
S141 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 44, 24, 1056]
After
derived = [19, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S140
S142 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 := mul(49, 45)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 = 2205
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S141
S143 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 45, 49, 2205]
After
derived = [41, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S142
S144 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 := mul(32, 46)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 = 1472
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S143
S145 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 46, 32, 1472]
After
derived = [27, 41, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S144
S146 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 := mul(41, 47)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 = 1927
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S145
S147 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 47, 41, 1927]
After
derived = [36, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S146
S148 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 := mul(19, 48)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 = 912
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S147
S149 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 48, 19, 912]
After
derived = [17, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S148
S150 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 := mul(11, 49)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 = 539
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S149
S151 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 49, 11, 539]
After
derived = [10, 9, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S150
S152 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 := mul(9, 50)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 = 450
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S151
S153 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 50, 9, 450]
After
derived = [8, 26, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S152
S154 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 := mul(26, 51)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 = 1326
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S153
S155 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 51, 26, 1326]
After
derived = [25, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S154
S156 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 := mul(1, 52)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 = 52
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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S155
S157 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 53, 52, 1, 52]
After
derived = [0, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S156
S158 · implies
Before
source roles = [53, [[1, 1], [2, 27], [3, 18], [4, 40], [5, 32], [6, 9], [7, 38], [8, 20], [9, 6], [10, 16], [11, 29], [12, 31], [13, 49], [14, 19], [15, 46], [16, 10], [17, 25], [18, 3], [19, 14], [20, 8], [21, 48], [22, 41], [23, 30], [24, 42], [25, 17], [26, 51], [27, 2], [28, 36], [29, 11], [30, 23], [31, 12], [32, 5], [33, 45], [34, 39], [35, 50], [36, 28], [37, 43], [38, 7], [39, 34], [40, 4], [41, 22], [42, 24], [43, 37], [44, 47], [45, 33], [46, 15], [47, 44], [48, 21], [49, 13], [50, 35], [51, 26], [52, 52]]]
After
derived = [[1, 52], [[2, 27, 1], [3, 18, 1], [4, 40, 1], [5, 32, 1], [6, 9, 1], [7, 38, 1], [8, 20, 1], [10, 16, 1], [11, 29, 1], [12, 31, 1], [13, 49, 1], [14, 19, 1], [15, 46, 1], [17, 25, 1], [21, 48, 1], [22, 41, 1], [23, 30, 1], [24, 42, 1], [26, 51, 1], [28, 36, 1], [33, 45, 1], [34, 39, 1], [35, 50, 1], [37, 43, 1], [44, 47, 1]], 52, 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 dependencies
Rule: Wilson_GENERAL_inverse_pairing_and_p2_exception · Uses: G001, S157
Result
(53, [[1, 1], [2, 27], [3, 18], [4, 40], [5, 32], [6, 9], [7, 38], [8, 20], [9, 6], [10, 16], [11, 29], [12, 31], [13, 49], [14, 19], [15, 46], [16, 10], [17, 25], [18, 3], [19, 14], [20, 8], [21, 48], [22, 41], [23, 30], [24, 42], [25, 17], [26, 51], [27, 2], [28, 36], [29, 11], [30, 23], [31, 12], [32, 5], [33, 45], [34, 39], [35, 50], [36, 28], [37, 43], [38, 7], [39, 34], [40, 4], [41, 22], [42, 24], [43, 37], [44, 47], [45, 33], [46, 15], [47, 44], [48, 21], [49, 13], [50, 35], [51, 26], [52, 52]], [1, 52], [[2, 27, 1], [3, 18, 1], [4, 40, 1], [5, 32, 1], [6, 9, 1], [7, 38, 1], [8, 20, 1], [10, 16, 1], [11, 29, 1], [12, 31, 1], [13, 49, 1], [14, 19, 1], [15, 46, 1], [17, 25, 1], [21, 48, 1], [22, 41, 1], [23, 30, 1], [24, 42, 1], [26, 51, 1], [28, 36, 1], [33, 45, 1], [34, 39, 1], [35, 50, 1], [37, 43, 1], [44, 47, 1]], self_inverse_residues_1_and_p_minus_1, 52, Yes)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.