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 = [59, 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 = [59, 2]
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, S002
S004 · implies
Before
source roles = [59, 3]
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, S003
S005 · implies
Before
source roles = [59, 4]
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, S004
S006 · implies
Before
source roles = [59, 5]
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, S005
S007 · implies
Before
source roles = [59, 6]
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, S006
S008 · implies
Before
source roles = [59, 7]
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, S007
S009 · implies
Before
source roles = [59, 8]
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, S008
S010 · implies
Before
source roles = [59, 9]
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, S009
S011 · implies
Before
source roles = [59, 10]
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, S010
S012 · implies
Before
source roles = [59, 11]
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, S011
S013 · implies
Before
source roles = [59, 12]
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, S012
S014 · implies
Before
source roles = [59, 13]
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, S013
S015 · implies
Before
source roles = [59, 14]
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, S014
S016 · implies
Before
source roles = [59, 15]
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, S015
S017 · implies
Before
source roles = [59, 16]
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, S016
S018 · implies
Before
source roles = [59, 17]
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, S017
S019 · implies
Before
source roles = [59, 18]
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, S018
S020 · implies
Before
source roles = [59, 19]
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, S019
S021 · implies
Before
source roles = [59, 20]
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, S020
S022 · implies
Before
source roles = [59, 21]
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, S021
S023 · implies
Before
source roles = [59, 22]
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, S022
S024 · implies
Before
source roles = [59, 23]
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, S023
S025 · implies
Before
source roles = [59, 24]
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, S024
S026 · implies
Before
source roles = [59, 25]
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, S025
S027 · implies
Before
source roles = [59, 26]
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, S026
S028 · implies
Before
source roles = [59, 27]
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, S027
S029 · implies
Before
source roles = [59, 28]
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, S028
S030 · implies
Before
source roles = [59, 29]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S029
S031 · implies
Before
source roles = [59, 30]
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, S030
S032 · implies
Before
source roles = [59, 31]
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, S031
S033 · implies
Before
source roles = [59, 32]
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, S032
S034 · implies
Before
source roles = [59, 33]
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, S033
S035 · implies
Before
source roles = [59, 34]
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, S034
S036 · implies
Before
source roles = [59, 35]
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, S035
S037 · implies
Before
source roles = [59, 36]
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, S036
S038 · implies
Before
source roles = [59, 37]
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, S037
S039 · implies
Before
source roles = [59, 38]
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, S038
S040 · implies
Before
source roles = [59, 39]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S039
S041 · implies
Before
source roles = [59, 40]
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, S040
S042 · implies
Before
source roles = [59, 41]
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, S041
S043 · implies
Before
source roles = [59, 42]
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, S042
S044 · implies
Before
source roles = [59, 43]
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, S043
S045 · implies
Before
source roles = [59, 44]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S044
S046 · implies
Before
source roles = [59, 45]
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, S045
S047 · implies
Before
source roles = [59, 46]
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, S046
S048 · implies
Before
source roles = [59, 47]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S047
S049 · implies
Before
source roles = [59, 48]
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, S048
S050 · implies
Before
source roles = [59, 49]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S049
S051 · implies
Before
source roles = [59, 50]
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, S050
S052 · implies
Before
source roles = [59, 51]
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, S051
S053 · implies
Before
source roles = [59, 52]
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, S052
S054 · implies
Before
source roles = [59, 53]
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, S053
S055 · implies
Before
source roles = [59, 54]
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, S054
S056 · implies
Before
source roles = [59, 55]
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, S055
S057 · implies
Before
source roles = [59, 56]
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, S056
S058 · implies
Before
source roles = [59, 57]
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, S057
S059 · implies
Before
source roles = [59, 58]
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 dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S058
S060 · 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, S059
S061 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 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, S060
S062 · 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, S061
S063 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 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, S062
S064 · 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, S063
S065 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 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, S064
S066 · 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, S065
S067 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 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, S066
S068 · 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, S067
S069 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 5, 24, 120]
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, S068
S070 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 := mul(2, 6)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 12
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, 59, 6, 2, 12]
After
derived = [0, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S070
S072 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 := mul(12, 7)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 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, S071
S073 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 7, 12, 84]
After
derived = [1, 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, S072
S074 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 := mul(25, 8)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 200
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, 59, 8, 25, 200]
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, S074
S076 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 := mul(23, 9)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 207
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, 59, 9, 23, 207]
After
derived = [3, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S076
S078 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 := mul(30, 10)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 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, S077
S079 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 10, 30, 300]
After
derived = [5, 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, S078
S080 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 := mul(5, 11)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 55
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, 59, 11, 5, 55]
After
derived = [0, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S080
S082 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 := mul(55, 12)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 660
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, 59, 12, 55, 660]
After
derived = [11, 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, S082
S084 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 := mul(11, 13)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 143
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, 59, 13, 11, 143]
After
derived = [2, 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, S084
S086 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 := mul(25, 14)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 350
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, 59, 14, 25, 350]
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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S086
S088 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 := mul(55, 15)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 = 825
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, 59, 15, 55, 825]
After
derived = [13, 58, 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 product16 := mul(58, 16)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 928
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, 59, 16, 58, 928]
After
derived = [15, 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, S090
S092 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(43, 17)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 731
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, 59, 17, 43, 731]
After
derived = [12, 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, S092
S094 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 := mul(23, 18)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 414
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, 59, 18, 23, 414]
After
derived = [7, 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, S094
S096 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 := mul(1, 19)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 = 19
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, 59, 19, 1, 19]
After
derived = [0, 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, S096
S098 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(19, 20)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 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, S097
S099 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 20, 19, 380]
After
derived = [6, 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, S098
S100 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(26, 21)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 546
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, 59, 21, 26, 546]
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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S100
S102 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 := mul(15, 22)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 = 330
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, 59, 22, 15, 330]
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, S102
S104 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 := mul(35, 23)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 = 805
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, 59, 23, 35, 805]
After
derived = [13, 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, S104
S106 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 := mul(38, 24)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 = 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, S105
S107 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 24, 38, 912]
After
derived = [15, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S106
S108 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 := mul(27, 25)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 = 675
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, 59, 25, 27, 675]
After
derived = [11, 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, S108
S110 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 := mul(26, 26)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 = 676
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, 59, 26, 26, 676]
After
derived = [11, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S110
S112 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 := mul(27, 27)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 = 729
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, 59, 27, 27, 729]
After
derived = [12, 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, S112
S114 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 := mul(21, 28)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 = 588
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, 59, 28, 21, 588]
After
derived = [9, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S114
S116 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 := mul(57, 29)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 = 1653
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, 59, 29, 57, 1653]
After
derived = [28, 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, S116
S118 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 := mul(1, 30)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 = 30
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, 59, 30, 1, 30]
After
derived = [0, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S118
S120 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 := mul(30, 31)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 = 930
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, 59, 31, 30, 930]
After
derived = [15, 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 product32 := mul(45, 32)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 = 1440
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, 59, 32, 45, 1440]
After
derived = [24, 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, S122
S124 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 := mul(24, 33)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 = 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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S123
S125 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 33, 24, 792]
After
derived = [13, 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, S124
S126 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 := mul(25, 34)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 = 850
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, 59, 34, 25, 850]
After
derived = [14, 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, S126
S128 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 := mul(24, 35)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 = 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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S127
S129 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 35, 24, 840]
After
derived = [14, 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, S128
S130 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 := mul(14, 36)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 = 504
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, 59, 36, 14, 504]
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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S130
S132 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 := mul(32, 37)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 = 1184
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, 59, 37, 32, 1184]
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, S132
S134 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 := mul(4, 38)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 = 152
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, 59, 38, 4, 152]
After
derived = [2, 34, 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 product39 := mul(34, 39)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 = 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, S135
S137 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 39, 34, 1326]
After
derived = [22, 28, 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 product40 := mul(28, 40)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 = 1120
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, 59, 40, 28, 1120]
After
derived = [18, 58, 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 product41 := mul(58, 41)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 = 2378
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, 59, 41, 58, 2378]
After
derived = [40, 18, 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 product42 := mul(18, 42)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 = 756
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, 59, 42, 18, 756]
After
derived = [12, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S142
S144 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 := mul(48, 43)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 = 2064
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, 59, 43, 48, 2064]
After
derived = [34, 58, 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 product44 := mul(58, 44)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 = 2552
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, 59, 44, 58, 2552]
After
derived = [43, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S146
S148 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 := mul(15, 45)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 = 675
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, 59, 45, 15, 675]
After
derived = [11, 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, S148
S150 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 := mul(26, 46)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 = 1196
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, 59, 46, 26, 1196]
After
derived = [20, 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, S150
S152 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 := mul(16, 47)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 = 752
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, 59, 47, 16, 752]
After
derived = [12, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S152
S154 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 := mul(44, 48)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 = 2112
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, 59, 48, 44, 2112]
After
derived = [35, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S154
S156 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 := mul(47, 49)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 = 2303
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, 59, 49, 47, 2303]
After
derived = [39, 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, S156
S158 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 := mul(2, 50)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 = 100
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, S157
S159 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 50, 2, 100]
After
derived = [1, 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, S158
S160 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 := mul(41, 51)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 = 2091
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, S159
S161 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 51, 41, 2091]
After
derived = [35, 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, S160
S162 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 := mul(26, 52)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 = 1352
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, S161
S163 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 52, 26, 1352]
After
derived = [22, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S162
S164 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 := mul(54, 53)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 = 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 dependencies
Rule: exact_rational_arithmetic · Uses: G001, S163
S165 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 53, 54, 2862]
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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S164
S166 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 := mul(30, 54)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 = 1620
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, S165
S167 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 54, 30, 1620]
After
derived = [27, 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 dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S166
S168 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 := mul(27, 55)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 = 1485
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, S167
S169 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 55, 27, 1485]
After
derived = [25, 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, S168
S170 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 := mul(10, 56)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 = 560
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, S169
S171 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 56, 10, 560]
After
derived = [9, 29, 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, S170
S172 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 := mul(29, 57)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 = 1653
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, S171
S173 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 57, 29, 1653]
After
derived = [28, 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, S172
S174 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 := mul(1, 58)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 = 58
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, S173
S175 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 59, 58, 1, 58]
After
derived = [0, 58, 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, S174
S176 · implies
Before
source roles = [59, [[1, 1], [2, 30], [3, 20], [4, 15], [5, 12], [6, 10], [7, 17], [8, 37], [9, 46], [10, 6], [11, 43], [12, 5], [13, 50], [14, 38], [15, 4], [16, 48], [17, 7], [18, 23], [19, 28], [20, 3], [21, 45], [22, 51], [23, 18], [24, 32], [25, 26], [26, 25], [27, 35], [28, 19], [29, 57], [30, 2], [31, 40], [32, 24], [33, 34], [34, 33], [35, 27], [36, 41], [37, 8], [38, 14], [39, 56], [40, 31], [41, 36], [42, 52], [43, 11], [44, 55], [45, 21], [46, 9], [47, 54], [48, 16], [49, 53], [50, 13], [51, 22], [52, 42], [53, 49], [54, 47], [55, 44], [56, 39], [57, 29], [58, 58]]]
After
derived = [[1, 58], [[2, 30, 1], [3, 20, 1], [4, 15, 1], [5, 12, 1], [6, 10, 1], [7, 17, 1], [8, 37, 1], [9, 46, 1], [11, 43, 1], [13, 50, 1], [14, 38, 1], [16, 48, 1], [18, 23, 1], [19, 28, 1], [21, 45, 1], [22, 51, 1], [24, 32, 1], [25, 26, 1], [27, 35, 1], [29, 57, 1], [31, 40, 1], [33, 34, 1], [36, 41, 1], [39, 56, 1], [42, 52, 1], [44, 55, 1], [47, 54, 1], [49, 53, 1]], 58, 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, S175
Result
(59, [[1, 1], [2, 30], [3, 20], [4, 15], [5, 12], [6, 10], [7, 17], [8, 37], [9, 46], [10, 6], [11, 43], [12, 5], [13, 50], [14, 38], [15, 4], [16, 48], [17, 7], [18, 23], [19, 28], [20, 3], [21, 45], [22, 51], [23, 18], [24, 32], [25, 26], [26, 25], [27, 35], [28, 19], [29, 57], [30, 2], [31, 40], [32, 24], [33, 34], [34, 33], [35, 27], [36, 41], [37, 8], [38, 14], [39, 56], [40, 31], [41, 36], [42, 52], [43, 11], [44, 55], [45, 21], [46, 9], [47, 54], [48, 16], [49, 53], [50, 13], [51, 22], [52, 42], [53, 49], [54, 47], [55, 44], [56, 39], [57, 29], [58, 58]], [1, 58], [[2, 30, 1], [3, 20, 1], [4, 15, 1], [5, 12, 1], [6, 10, 1], [7, 17, 1], [8, 37, 1], [9, 46, 1], [11, 43, 1], [13, 50, 1], [14, 38, 1], [16, 48, 1], [18, 23, 1], [19, 28, 1], [21, 45, 1], [22, 51, 1], [24, 32, 1], [25, 26, 1], [27, 35, 1], [29, 57, 1], [31, 40, 1], [33, 34, 1], [36, 41, 1], [39, 56, 1], [42, 52, 1], [44, 55, 1], [47, 54, 1], [49, 53, 1]], self_inverse_residues_1_and_p_minus_1, 58, Yes)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.