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 = [89, 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 = [89, 2]
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, S002
S004 · implies
Before
source roles = [89, 3]
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, S003
S005 · implies
Before
source roles = [89, 4]
After
derived = [67, 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 = [89, 5]
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, S005
S007 · implies
Before
source roles = [89, 6]
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, S006
S008 · implies
Before
source roles = [89, 7]
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, S007
S009 · implies
Before
source roles = [89, 8]
After
derived = [78, 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 = [89, 9]
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, S009
S011 · implies
Before
source roles = [89, 10]
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, S010
S012 · implies
Before
source roles = [89, 11]
After
derived = [81, 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 = [89, 12]
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, S012
S014 · implies
Before
source roles = [89, 13]
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, S013
S015 · implies
Before
source roles = [89, 14]
After
derived = [70, 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 = [89, 15]
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, S015
S017 · implies
Before
source roles = [89, 16]
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, S016
S018 · implies
Before
source roles = [89, 17]
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, S017
S019 · implies
Before
source roles = [89, 18]
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, S018
S020 · implies
Before
source roles = [89, 19]
After
derived = [75, 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 = [89, 20]
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, S020
S022 · implies
Before
source roles = [89, 21]
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, S021
S023 · implies
Before
source roles = [89, 22]
After
derived = [85, 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 = [89, 23]
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, S023
S025 · implies
Before
source roles = [89, 24]
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, S024
S026 · implies
Before
source roles = [89, 25]
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, S025
S027 · implies
Before
source roles = [89, 26]
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, S026
S028 · implies
Before
source roles = [89, 27]
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, S027
S029 · implies
Before
source roles = [89, 28]
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, S028
S030 · implies
Before
source roles = [89, 29]
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, S029
S031 · implies
Before
source roles = [89, 30]
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, S030
S032 · implies
Before
source roles = [89, 31]
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, S031
S033 · implies
Before
source roles = [89, 32]
After
derived = [64, 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 = [89, 33]
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, S033
S035 · implies
Before
source roles = [89, 34]
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, S034
S036 · implies
Before
source roles = [89, 35]
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, S035
S037 · implies
Before
source roles = [89, 36]
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, S036
S038 · implies
Before
source roles = [89, 37]
After
derived = [77, 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 = [89, 38]
After
derived = [82, 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 = [89, 39]
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, S039
S041 · implies
Before
source roles = [89, 40]
After
derived = [69, 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 = [89, 41]
After
derived = [76, 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 = [89, 42]
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, S042
S044 · implies
Before
source roles = [89, 43]
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, S043
S045 · implies
Before
source roles = [89, 44]
After
derived = [87, 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 = [89, 45]
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, S045
S047 · implies
Before
source roles = [89, 46]
After
derived = [60, 1]
Conditions: none
Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a.
Step identifiers and dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S046
S048 · implies
Before
source roles = [89, 47]
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, S047
S049 · implies
Before
source roles = [89, 48]
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, S048
S050 · implies
Before
source roles = [89, 49]
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, S049
S051 · implies
Before
source roles = [89, 50]
After
derived = [73, 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 = [89, 51]
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, S051
S053 · implies
Before
source roles = [89, 52]
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, S052
S054 · implies
Before
source roles = [89, 53]
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, S053
S055 · implies
Before
source roles = [89, 54]
After
derived = [61, 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 = [89, 55]
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, S055
S057 · implies
Before
source roles = [89, 56]
After
derived = [62, 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 = [89, 57]
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, S057
S059 · implies
Before
source roles = [89, 58]
After
derived = [66, 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 · implies
Before
source roles = [89, 59]
After
derived = [86, 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, S059
S061 · implies
Before
source roles = [89, 60]
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, S060
S062 · implies
Before
source roles = [89, 61]
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, S061
S063 · implies
Before
source roles = [89, 62]
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, S062
S064 · implies
Before
source roles = [89, 63]
After
derived = [65, 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, S063
S065 · implies
Before
source roles = [89, 64]
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, S064
S066 · implies
Before
source roles = [89, 65]
After
derived = [63, 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, S065
S067 · implies
Before
source roles = [89, 66]
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, S066
S068 · implies
Before
source roles = [89, 67]
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, S067
S069 · implies
Before
source roles = [89, 68]
After
derived = [72, 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, S068
S070 · implies
Before
source roles = [89, 69]
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, S069
S071 · implies
Before
source roles = [89, 70]
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, S070
S072 · implies
Before
source roles = [89, 71]
After
derived = [84, 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, S071
S073 · implies
Before
source roles = [89, 72]
After
derived = [68, 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, S072
S074 · implies
Before
source roles = [89, 73]
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, S073
S075 · implies
Before
source roles = [89, 74]
After
derived = [83, 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, S074
S076 · implies
Before
source roles = [89, 75]
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, S075
S077 · implies
Before
source roles = [89, 76]
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, S076
S078 · implies
Before
source roles = [89, 77]
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, S077
S079 · implies
Before
source roles = [89, 78]
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, S078
S080 · implies
Before
source roles = [89, 79]
After
derived = [80, 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, S079
S081 · implies
Before
source roles = [89, 80]
After
derived = [79, 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, S080
S082 · implies
Before
source roles = [89, 81]
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, S081
S083 · implies
Before
source roles = [89, 82]
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, S082
S084 · implies
Before
source roles = [89, 83]
After
derived = [74, 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, S083
S085 · implies
Before
source roles = [89, 84]
After
derived = [71, 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, S084
S086 · implies
Before
source roles = [89, 85]
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, S085
S087 · implies
Before
source roles = [89, 86]
After
derived = [59, 1]
Conditions: none
Every nonzero residue at a prime modulus is a unit.For each a find the first source inverse;two inverses coincide by cancellation of a.
Step identifiers and dependencies
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S086
S088 · implies
Before
source roles = [89, 87]
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, S087
S089 · implies
Before
source roles = [89, 88]
After
derived = [88, 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, S088
S090 · 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, S089
S091 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 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, S090
S092 · 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, S091
S093 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 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, S092
S094 · 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, S093
S095 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 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, S094
S096 · 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, S095
S097 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 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, S096
S098 · 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, S097
S099 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 5, 24, 120]
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, S098
S100 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 := mul(31, 6)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 186
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, 89, 6, 31, 186]
After
derived = [2, 8, 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 product7 := mul(8, 7)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 56
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, 89, 7, 8, 56]
After
derived = [0, 56, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S102
S104 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 := mul(56, 8)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 448
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, 89, 8, 56, 448]
After
derived = [5, 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, S104
S106 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 := mul(3, 9)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 27
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, 89, 9, 3, 27]
After
derived = [0, 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 product10 := mul(27, 10)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 270
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, 89, 10, 27, 270]
After
derived = [3, 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, S108
S110 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 := mul(3, 11)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 33
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, 89, 11, 3, 33]
After
derived = [0, 33, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S110
S112 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 := mul(33, 12)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 396
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, 89, 12, 33, 396]
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, S112
S114 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 := mul(40, 13)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 520
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S113
S115 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 13, 40, 520]
After
derived = [5, 75, 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 product14 := mul(75, 14)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 1050
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, 89, 14, 75, 1050]
After
derived = [11, 71, 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 product15 := mul(71, 15)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 = 1065
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, 89, 15, 71, 1065]
After
derived = [11, 86, 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 product16 := mul(86, 16)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 1376
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, 89, 16, 86, 1376]
After
derived = [15, 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, S120
S122 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(41, 17)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 697
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, 89, 17, 41, 697]
After
derived = [7, 74, 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 product18 := mul(74, 18)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 1332
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S123
S125 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 18, 74, 1332]
After
derived = [14, 86, 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 product19 := mul(86, 19)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 = 1634
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, 89, 19, 86, 1634]
After
derived = [18, 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, S126
S128 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(32, 20)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 640
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, 89, 20, 32, 640]
After
derived = [7, 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, S128
S130 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(17, 21)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 357
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, 89, 21, 17, 357]
After
derived = [4, 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, S130
S132 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 := mul(1, 22)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 = 22
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, 89, 22, 1, 22]
After
derived = [0, 22, 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 product23 := mul(22, 23)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 = 506
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, 89, 23, 22, 506]
After
derived = [5, 61, 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 product24 := mul(61, 24)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 = 1464
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, 89, 24, 61, 1464]
After
derived = [16, 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 product25 := mul(40, 25)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 = 1000
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, 89, 25, 40, 1000]
After
derived = [11, 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, S138
S140 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 := mul(21, 26)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 = 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, S139
S141 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 26, 21, 546]
After
derived = [6, 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, S140
S142 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 := mul(12, 27)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 = 324
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, 89, 27, 12, 324]
After
derived = [3, 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, S142
S144 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 := mul(57, 28)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 = 1596
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, 89, 28, 57, 1596]
After
derived = [17, 83, 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 product29 := mul(83, 29)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 = 2407
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, 89, 29, 83, 2407]
After
derived = [27, 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, S146
S148 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 := mul(4, 30)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 = 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, S147
S149 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 30, 4, 120]
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, S148
S150 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 := mul(31, 31)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 = 961
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, 89, 31, 31, 961]
After
derived = [10, 71, 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 product32 := mul(71, 32)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 = 2272
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, 89, 32, 71, 2272]
After
derived = [25, 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, S152
S154 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 := mul(47, 33)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 = 1551
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, 89, 33, 47, 1551]
After
derived = [17, 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, S154
S156 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 := mul(38, 34)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 = 1292
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, 89, 34, 38, 1292]
After
derived = [14, 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, S156
S158 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 := mul(46, 35)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 = 1610
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, 89, 35, 46, 1610]
After
derived = [18, 8, 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 product36 := mul(8, 36)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 = 288
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, 89, 36, 8, 288]
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, S160
S162 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 := mul(21, 37)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 = 777
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, 89, 37, 21, 777]
After
derived = [8, 65, 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 product38 := mul(65, 38)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 = 2470
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, 89, 38, 65, 2470]
After
derived = [27, 67, 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 product39 := mul(67, 39)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 = 2613
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, 89, 39, 67, 2613]
After
derived = [29, 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, S166
S168 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 := mul(32, 40)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 = 1280
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, 89, 40, 32, 1280]
After
derived = [14, 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, S168
S170 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 := mul(34, 41)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 = 1394
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, 89, 41, 34, 1394]
After
derived = [15, 59, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S170
S172 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 := mul(59, 42)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 = 2478
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, 89, 42, 59, 2478]
After
derived = [27, 75, 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 product43 := mul(75, 43)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 = 3225
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, 89, 43, 75, 3225]
After
derived = [36, 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, S174
S176 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 := mul(21, 44)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 = 924
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, S175
S177 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 44, 21, 924]
After
derived = [10, 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, S176
S178 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 := mul(34, 45)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 = 1530
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, S177
S179 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 45, 34, 1530]
After
derived = [17, 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, S178
S180 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 := mul(17, 46)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 = 782
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, S179
S181 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 46, 17, 782]
After
derived = [8, 70, 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, S180
S182 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 := mul(70, 47)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 = 3290
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, S181
S183 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 47, 70, 3290]
After
derived = [36, 86, 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, S182
S184 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 := mul(86, 48)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 = 4128
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, S183
S185 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 48, 86, 4128]
After
derived = [46, 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, S184
S186 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 := mul(34, 49)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 = 1666
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, S185
S187 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 49, 34, 1666]
After
derived = [18, 64, 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, S186
S188 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 := mul(64, 50)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 = 3200
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, S187
S189 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 50, 64, 3200]
After
derived = [35, 85, 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, S188
S190 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 := mul(85, 51)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 = 4335
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, S189
S191 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 51, 85, 4335]
After
derived = [48, 63, 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, S190
S192 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 := mul(63, 52)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 = 3276
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, S191
S193 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 52, 63, 3276]
After
derived = [36, 72, 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, S192
S194 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 := mul(72, 53)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 = 3816
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, S193
S195 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 53, 72, 3816]
After
derived = [42, 78, 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, S194
S196 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 := mul(78, 54)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 = 4212
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, S195
S197 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 54, 78, 4212]
After
derived = [47, 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, S196
S198 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 := mul(29, 55)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 = 1595
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, S197
S199 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 55, 29, 1595]
After
derived = [17, 82, 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, S198
S200 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 := mul(82, 56)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 = 4592
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, S199
S201 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 56, 82, 4592]
After
derived = [51, 53, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S200
S202 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 := mul(53, 57)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 = 3021
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, S201
S203 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 57, 53, 3021]
After
derived = [33, 84, 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, S202
S204 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 := mul(84, 58)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 = 4872
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, S203
S205 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 58, 84, 4872]
After
derived = [54, 66, 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, S204
S206 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 := mul(66, 59)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 = 3894
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, S205
S207 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 59, 66, 3894]
After
derived = [43, 67, 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, S206
S208 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 := mul(67, 60)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 = 4020
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, S207
S209 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 60, 67, 4020]
After
derived = [45, 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, S208
S210 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product61 := mul(15, 61)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product61 = 915
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, S209
S211 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 61, 15, 915]
After
derived = [10, 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, S210
S212 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product62 := mul(25, 62)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product62 = 1550
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, S211
S213 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 62, 25, 1550]
After
derived = [17, 37, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S212
S214 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product63 := mul(37, 63)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product63 = 2331
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, S213
S215 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 63, 37, 2331]
After
derived = [26, 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, S214
S216 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product64 := mul(17, 64)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product64 = 1088
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, S215
S217 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 64, 17, 1088]
After
derived = [12, 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, S216
S218 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product65 := mul(20, 65)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product65 = 1300
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, S217
S219 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 65, 20, 1300]
After
derived = [14, 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, S218
S220 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product66 := mul(54, 66)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product66 = 3564
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, S219
S221 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 66, 54, 3564]
After
derived = [40, 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, S220
S222 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product67 := mul(4, 67)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product67 = 268
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, S221
S223 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 67, 4, 268]
After
derived = [3, 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, S222
S224 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product68 := mul(1, 68)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product68 = 68
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, S223
S225 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 68, 1, 68]
After
derived = [0, 68, 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, S224
S226 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product69 := mul(68, 69)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product69 = 4692
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, S225
S227 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 69, 68, 4692]
After
derived = [52, 64, 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, S226
S228 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product70 := mul(64, 70)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product70 = 4480
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, S227
S229 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 70, 64, 4480]
After
derived = [50, 30, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S228
S230 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product71 := mul(30, 71)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product71 = 2130
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, S229
S231 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 71, 30, 2130]
After
derived = [23, 83, 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, S230
S232 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product72 := mul(83, 72)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product72 = 5976
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, S231
S233 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 72, 83, 5976]
After
derived = [67, 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, S232
S234 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product73 := mul(13, 73)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product73 = 949
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, S233
S235 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 73, 13, 949]
After
derived = [10, 59, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S234
S236 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product74 := mul(59, 74)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product74 = 4366
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, S235
S237 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 74, 59, 4366]
After
derived = [49, 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, S236
S238 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product75 := mul(5, 75)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product75 = 375
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, S237
S239 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 75, 5, 375]
After
derived = [4, 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, S238
S240 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product76 := mul(19, 76)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product76 = 1444
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, S239
S241 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 76, 19, 1444]
After
derived = [16, 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, S240
S242 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product77 := mul(20, 77)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product77 = 1540
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, S241
S243 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 77, 20, 1540]
After
derived = [17, 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, S242
S244 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product78 := mul(27, 78)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product78 = 2106
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, S243
S245 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 78, 27, 2106]
After
derived = [23, 59, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S244
S246 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product79 := mul(59, 79)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product79 = 4661
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, S245
S247 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 79, 59, 4661]
After
derived = [52, 33, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S246
S248 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product80 := mul(33, 80)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product80 = 2640
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, S247
S249 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 80, 33, 2640]
After
derived = [29, 59, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S248
S250 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product81 := mul(59, 81)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product81 = 4779
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, S249
S251 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 81, 59, 4779]
After
derived = [53, 62, 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, S250
S252 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product82 := mul(62, 82)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product82 = 5084
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, S251
S253 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 82, 62, 5084]
After
derived = [57, 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, S252
S254 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product83 := mul(11, 83)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product83 = 913
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, S253
S255 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 83, 11, 913]
After
derived = [10, 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, S254
S256 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product84 := mul(23, 84)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product84 = 1932
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, S255
S257 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 84, 23, 1932]
After
derived = [21, 63, 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, S256
S258 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product85 := mul(63, 85)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product85 = 5355
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, S257
S259 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 85, 63, 5355]
After
derived = [60, 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, S258
S260 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product86 := mul(15, 86)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product86 = 1290
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, S259
S261 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 86, 15, 1290]
After
derived = [14, 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, S260
S262 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product87 := mul(44, 87)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product87 = 3828
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, S261
S263 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 87, 44, 3828]
After
derived = [43, 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, S262
S264 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product88 := mul(1, 88)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product88 = 88
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, S263
S265 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 89, 88, 1, 88]
After
derived = [0, 88, 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, S264
S266 · implies
Before
source roles = [89, [[1, 1], [2, 45], [3, 30], [4, 67], [5, 18], [6, 15], [7, 51], [8, 78], [9, 10], [10, 9], [11, 81], [12, 52], [13, 48], [14, 70], [15, 6], [16, 39], [17, 21], [18, 5], [19, 75], [20, 49], [21, 17], [22, 85], [23, 31], [24, 26], [25, 57], [26, 24], [27, 33], [28, 35], [29, 43], [30, 3], [31, 23], [32, 64], [33, 27], [34, 55], [35, 28], [36, 47], [37, 77], [38, 82], [39, 16], [40, 69], [41, 76], [42, 53], [43, 29], [44, 87], [45, 2], [46, 60], [47, 36], [48, 13], [49, 20], [50, 73], [51, 7], [52, 12], [53, 42], [54, 61], [55, 34], [56, 62], [57, 25], [58, 66], [59, 86], [60, 46], [61, 54], [62, 56], [63, 65], [64, 32], [65, 63], [66, 58], [67, 4], [68, 72], [69, 40], [70, 14], [71, 84], [72, 68], [73, 50], [74, 83], [75, 19], [76, 41], [77, 37], [78, 8], [79, 80], [80, 79], [81, 11], [82, 38], [83, 74], [84, 71], [85, 22], [86, 59], [87, 44], [88, 88]]]
After
derived = [[1, 88], [[2, 45, 1], [3, 30, 1], [4, 67, 1], [5, 18, 1], [6, 15, 1], [7, 51, 1], [8, 78, 1], [9, 10, 1], [11, 81, 1], [12, 52, 1], [13, 48, 1], [14, 70, 1], [16, 39, 1], [17, 21, 1], [19, 75, 1], [20, 49, 1], [22, 85, 1], [23, 31, 1], [24, 26, 1], [25, 57, 1], [27, 33, 1], [28, 35, 1], [29, 43, 1], [32, 64, 1], [34, 55, 1], [36, 47, 1], [37, 77, 1], [38, 82, 1], [40, 69, 1], [41, 76, 1], [42, 53, 1], [44, 87, 1], [46, 60, 1], [50, 73, 1], [54, 61, 1], [56, 62, 1], [58, 66, 1], [59, 86, 1], [63, 65, 1], [68, 72, 1], [71, 84, 1], [74, 83, 1], [79, 80, 1]], 88, 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, S265
Result
(89, [[1, 1], [2, 45], [3, 30], [4, 67], [5, 18], [6, 15], [7, 51], [8, 78], [9, 10], [10, 9], [11, 81], [12, 52], [13, 48], [14, 70], [15, 6], [16, 39], [17, 21], [18, 5], [19, 75], [20, 49], [21, 17], [22, 85], [23, 31], [24, 26], [25, 57], [26, 24], [27, 33], [28, 35], [29, 43], [30, 3], [31, 23], [32, 64], [33, 27], [34, 55], [35, 28], [36, 47], [37, 77], [38, 82], [39, 16], [40, 69], [41, 76], [42, 53], [43, 29], [44, 87], [45, 2], [46, 60], [47, 36], [48, 13], [49, 20], [50, 73], [51, 7], [52, 12], [53, 42], [54, 61], [55, 34], [56, 62], [57, 25], [58, 66], [59, 86], [60, 46], [61, 54], [62, 56], [63, 65], [64, 32], [65, 63], [66, 58], [67, 4], [68, 72], [69, 40], [70, 14], [71, 84], [72, 68], [73, 50], [74, 83], [75, 19], [76, 41], [77, 37], [78, 8], [79, 80], [80, 79], [81, 11], [82, 38], [83, 74], [84, 71], [85, 22], [86, 59], [87, 44], [88, 88]], [1, 88], [[2, 45, 1], [3, 30, 1], [4, 67, 1], [5, 18, 1], [6, 15, 1], [7, 51, 1], [8, 78, 1], [9, 10, 1], [11, 81, 1], [12, 52, 1], [13, 48, 1], [14, 70, 1], [16, 39, 1], [17, 21, 1], [19, 75, 1], [20, 49, 1], [22, 85, 1], [23, 31, 1], [24, 26, 1], [25, 57, 1], [27, 33, 1], [28, 35, 1], [29, 43, 1], [32, 64, 1], [34, 55, 1], [36, 47, 1], [37, 77, 1], [38, 82, 1], [40, 69, 1], [41, 76, 1], [42, 53, 1], [44, 87, 1], [46, 60, 1], [50, 73, 1], [54, 61, 1], [56, 62, 1], [58, 66, 1], [59, 86, 1], [63, 65, 1], [68, 72, 1], [71, 84, 1], [74, 83, 1], [79, 80, 1]], self_inverse_residues_1_and_p_minus_1, 88, Yes)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.