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 = [83, 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 = [83, 2]
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, S002
S004 · implies
Before
source roles = [83, 3]
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, S003
S005 · implies
Before
source roles = [83, 4]
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, S004
S006 · implies
Before
source roles = [83, 5]
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, S005
S007 · implies
Before
source roles = [83, 6]
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, S006
S008 · implies
Before
source roles = [83, 7]
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, S007
S009 · implies
Before
source roles = [83, 8]
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, S008
S010 · implies
Before
source roles = [83, 9]
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, S009
S011 · implies
Before
source roles = [83, 10]
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, S010
S012 · implies
Before
source roles = [83, 11]
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, S011
S013 · implies
Before
source roles = [83, 12]
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, S012
S014 · implies
Before
source roles = [83, 13]
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, S013
S015 · implies
Before
source roles = [83, 14]
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, S014
S016 · implies
Before
source roles = [83, 15]
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, S015
S017 · implies
Before
source roles = [83, 16]
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, S016
S018 · implies
Before
source roles = [83, 17]
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, S017
S019 · implies
Before
source roles = [83, 18]
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, S018
S020 · implies
Before
source roles = [83, 19]
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, S019
S021 · implies
Before
source roles = [83, 20]
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, S020
S022 · implies
Before
source roles = [83, 21]
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, S021
S023 · implies
Before
source roles = [83, 22]
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, S022
S024 · implies
Before
source roles = [83, 23]
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, S023
S025 · implies
Before
source roles = [83, 24]
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, S024
S026 · implies
Before
source roles = [83, 25]
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, S025
S027 · implies
Before
source roles = [83, 26]
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, S026
S028 · implies
Before
source roles = [83, 27]
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, S027
S029 · implies
Before
source roles = [83, 28]
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, S028
S030 · implies
Before
source roles = [83, 29]
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, S029
S031 · implies
Before
source roles = [83, 30]
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, S030
S032 · implies
Before
source roles = [83, 31]
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, S031
S033 · implies
Before
source roles = [83, 32]
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, S032
S034 · implies
Before
source roles = [83, 33]
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, S033
S035 · implies
Before
source roles = [83, 34]
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, S034
S036 · implies
Before
source roles = [83, 35]
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, S035
S037 · implies
Before
source roles = [83, 36]
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, S036
S038 · implies
Before
source roles = [83, 37]
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, S037
S039 · implies
Before
source roles = [83, 38]
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, S038
S040 · implies
Before
source roles = [83, 39]
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, S039
S041 · implies
Before
source roles = [83, 40]
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, S040
S042 · implies
Before
source roles = [83, 41]
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, S041
S043 · implies
Before
source roles = [83, 42]
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, S042
S044 · implies
Before
source roles = [83, 43]
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, S043
S045 · implies
Before
source roles = [83, 44]
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, S044
S046 · implies
Before
source roles = [83, 45]
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, S045
S047 · implies
Before
source roles = [83, 46]
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, S046
S048 · implies
Before
source roles = [83, 47]
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, S047
S049 · implies
Before
source roles = [83, 48]
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, S048
S050 · implies
Before
source roles = [83, 49]
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, S049
S051 · implies
Before
source roles = [83, 50]
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, S050
S052 · implies
Before
source roles = [83, 51]
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, S051
S053 · implies
Before
source roles = [83, 52]
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, S052
S054 · implies
Before
source roles = [83, 53]
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, S053
S055 · implies
Before
source roles = [83, 54]
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, S054
S056 · implies
Before
source roles = [83, 55]
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, S055
S057 · implies
Before
source roles = [83, 56]
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, S056
S058 · implies
Before
source roles = [83, 57]
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, S057
S059 · implies
Before
source roles = [83, 58]
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, S058
S060 · implies
Before
source roles = [83, 59]
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, S059
S061 · implies
Before
source roles = [83, 60]
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, S060
S062 · implies
Before
source roles = [83, 61]
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, S061
S063 · implies
Before
source roles = [83, 62]
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, S062
S064 · implies
Before
source roles = [83, 63]
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, S063
S065 · implies
Before
source roles = [83, 64]
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, S064
S066 · implies
Before
source roles = [83, 65]
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, S065
S067 · implies
Before
source roles = [83, 66]
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, S066
S068 · implies
Before
source roles = [83, 67]
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, S067
S069 · implies
Before
source roles = [83, 68]
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, S068
S070 · implies
Before
source roles = [83, 69]
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, S069
S071 · implies
Before
source roles = [83, 70]
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, S070
S072 · implies
Before
source roles = [83, 71]
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, S071
S073 · implies
Before
source roles = [83, 72]
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, S072
S074 · implies
Before
source roles = [83, 73]
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, S073
S075 · implies
Before
source roles = [83, 74]
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, S074
S076 · implies
Before
source roles = [83, 75]
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, S075
S077 · implies
Before
source roles = [83, 76]
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, S076
S078 · implies
Before
source roles = [83, 77]
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, S077
S079 · implies
Before
source roles = [83, 78]
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, S078
S080 · implies
Before
source roles = [83, 79]
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, S079
S081 · implies
Before
source roles = [83, 80]
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, S080
S082 · implies
Before
source roles = [83, 81]
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, S081
S083 · implies
Before
source roles = [83, 82]
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, S082
S084 · 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, S083
S085 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 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, S084
S086 · 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, S085
S087 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 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, S086
S088 · 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, S087
S089 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 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, S088
S090 · 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, S089
S091 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 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, S090
S092 · 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, S091
S093 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 5, 24, 120]
After
derived = [1, 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, S092
S094 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 := mul(37, 6)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 222
Conditions: none
Substitute 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, 83, 6, 37, 222]
After
derived = [2, 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, S094
S096 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 := mul(56, 7)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 392
Conditions: none
Substitute 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, 83, 7, 56, 392]
After
derived = [4, 60, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S096
S098 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 := mul(60, 8)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 480
Conditions: none
Substitute 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, 83, 8, 60, 480]
After
derived = [5, 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, S098
S100 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 := mul(65, 9)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 585
Conditions: none
Substitute 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, 83, 9, 65, 585]
After
derived = [7, 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, S100
S102 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 := mul(4, 10)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 40
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S101
S103 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 10, 4, 40]
After
derived = [0, 40, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S102
S104 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 := mul(40, 11)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 440
Conditions: none
Substitute 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, 83, 11, 40, 440]
After
derived = [5, 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, S104
S106 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 := mul(25, 12)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 300
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S105
S107 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 12, 25, 300]
After
derived = [3, 51, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S106
S108 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 := mul(51, 13)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 663
Conditions: none
Substitute 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, 83, 13, 51, 663]
After
derived = [7, 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, S108
S110 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 := mul(82, 14)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 1148
Conditions: none
Substitute 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, 83, 14, 82, 1148]
After
derived = [13, 69, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its 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 product15 := mul(69, 15)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 = 1035
Conditions: none
Substitute 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, 83, 15, 69, 1035]
After
derived = [12, 39, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S112
S114 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 := mul(39, 16)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 624
Conditions: none
Substitute 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, 83, 16, 39, 624]
After
derived = [7, 43, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S114
S116 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(43, 17)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 731
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S115
S117 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 17, 43, 731]
After
derived = [8, 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, S116
S118 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 := mul(67, 18)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 1206
Conditions: none
Substitute 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, 83, 18, 67, 1206]
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, S118
S120 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 := mul(44, 19)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 = 836
Conditions: none
Substitute 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, 83, 19, 44, 836]
After
derived = [10, 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, S120
S122 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(6, 20)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 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, S121
S123 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 20, 6, 120]
After
derived = [1, 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, S122
S124 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(37, 21)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 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, S123
S125 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 21, 37, 777]
After
derived = [9, 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, S124
S126 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 := mul(30, 22)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 = 660
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S125
S127 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 22, 30, 660]
After
derived = [7, 79, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its 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 product23 := mul(79, 23)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 = 1817
Conditions: none
Substitute 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, 83, 23, 79, 1817]
After
derived = [21, 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, S128
S130 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 := mul(74, 24)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 = 1776
Conditions: none
Substitute 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, 83, 24, 74, 1776]
After
derived = [21, 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, S130
S132 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 := mul(33, 25)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 = 825
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S131
S133 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 25, 33, 825]
After
derived = [9, 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, S132
S134 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 := mul(78, 26)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 = 2028
Conditions: none
Substitute 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, 83, 26, 78, 2028]
After
derived = [24, 36, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S134
S136 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 := mul(36, 27)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 = 972
Conditions: none
Substitute 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, 83, 27, 36, 972]
After
derived = [11, 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, S136
S138 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 := mul(59, 28)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 = 1652
Conditions: none
Substitute 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, 83, 28, 59, 1652]
After
derived = [19, 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, S138
S140 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 := mul(75, 29)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 = 2175
Conditions: none
Substitute 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, 83, 29, 75, 2175]
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, S140
S142 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 := mul(17, 30)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 = 510
Conditions: none
Substitute 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, 83, 30, 17, 510]
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, S142
S144 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 := mul(12, 31)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 = 372
Conditions: none
Substitute 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, 83, 31, 12, 372]
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, S144
S146 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 := mul(40, 32)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 = 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, S145
S147 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 32, 40, 1280]
After
derived = [15, 35, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S146
S148 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 := mul(35, 33)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 = 1155
Conditions: none
Substitute 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, 83, 33, 35, 1155]
After
derived = [13, 76, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its 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 product34 := mul(76, 34)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 = 2584
Conditions: none
Substitute 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, 83, 34, 76, 2584]
After
derived = [31, 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, S150
S152 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 := mul(11, 35)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 = 385
Conditions: none
Substitute 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, 83, 35, 11, 385]
After
derived = [4, 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, S152
S154 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 := mul(53, 36)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 = 1908
Conditions: none
Substitute 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, 83, 36, 53, 1908]
After
derived = [22, 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, S154
S156 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 := mul(82, 37)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 = 3034
Conditions: none
Substitute 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, 83, 37, 82, 3034]
After
derived = [36, 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 product38 := mul(46, 38)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 = 1748
Conditions: none
Substitute 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, 83, 38, 46, 1748]
After
derived = [21, 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, S158
S160 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 := mul(5, 39)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 = 195
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S159
S161 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 39, 5, 195]
After
derived = [2, 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, S160
S162 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 := mul(29, 40)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 = 1160
Conditions: none
Substitute 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, 83, 40, 29, 1160]
After
derived = [13, 81, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its 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 product41 := mul(81, 41)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 = 3321
Conditions: none
Substitute 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, 83, 41, 81, 3321]
After
derived = [40, 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, S164
S166 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 := mul(1, 42)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 = 42
Conditions: none
Substitute 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, 83, 42, 1, 42]
After
derived = [0, 42, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S166
S168 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 := mul(42, 43)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 = 1806
Conditions: none
Substitute 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, 83, 43, 42, 1806]
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, S168
S170 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 := mul(63, 44)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 = 2772
Conditions: none
Substitute 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, 83, 44, 63, 2772]
After
derived = [33, 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, S170
S172 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 := mul(33, 45)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 = 1485
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S171
S173 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 45, 33, 1485]
After
derived = [17, 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, S172
S174 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 := mul(74, 46)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 = 3404
Conditions: none
Substitute 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, 83, 46, 74, 3404]
After
derived = [41, 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, S174
S176 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 := mul(1, 47)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 = 47
Conditions: none
Substitute 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, 83, 47, 1, 47]
After
derived = [0, 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, S176
S178 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 := mul(47, 48)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 = 2256
Conditions: none
Substitute 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, 83, 48, 47, 2256]
After
derived = [27, 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, S178
S180 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 := mul(15, 49)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 = 735
Conditions: none
Substitute 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, 83, 49, 15, 735]
After
derived = [8, 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, S180
S182 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 := mul(71, 50)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 = 3550
Conditions: none
Substitute 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, 83, 50, 71, 3550]
After
derived = [42, 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, S182
S184 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 := mul(64, 51)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 = 3264
Conditions: none
Substitute 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, 83, 51, 64, 3264]
After
derived = [39, 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, S184
S186 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 := mul(27, 52)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 = 1404
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S185
S187 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 52, 27, 1404]
After
derived = [16, 76, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its 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 product53 := mul(76, 53)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 = 4028
Conditions: none
Substitute 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, 83, 53, 76, 4028]
After
derived = [48, 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, S188
S190 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 := mul(44, 54)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 = 2376
Conditions: none
Substitute 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, 83, 54, 44, 2376]
After
derived = [28, 52, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S190
S192 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 := mul(52, 55)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 = 2860
Conditions: none
Substitute 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, 83, 55, 52, 2860]
After
derived = [34, 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, S192
S194 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 := mul(38, 56)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 = 2128
Conditions: none
Substitute 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, 83, 56, 38, 2128]
After
derived = [25, 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, S194
S196 · 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, S195
S197 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 57, 53, 3021]
After
derived = [36, 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, S196
S198 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 := mul(33, 58)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 = 1914
Conditions: none
Substitute 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, 83, 58, 33, 1914]
After
derived = [23, 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, S198
S200 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 := mul(5, 59)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 = 295
Conditions: none
Substitute 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, 83, 59, 5, 295]
After
derived = [3, 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, S200
S202 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 := mul(46, 60)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 = 2760
Conditions: none
Substitute 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, 83, 60, 46, 2760]
After
derived = [33, 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, S202
S204 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product61 := mul(21, 61)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product61 = 1281
Conditions: none
Substitute 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, 83, 61, 21, 1281]
After
derived = [15, 36, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S204
S206 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product62 := mul(36, 62)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product62 = 2232
Conditions: none
Substitute 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, 83, 62, 36, 2232]
After
derived = [26, 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, S206
S208 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product63 := mul(74, 63)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product63 = 4662
Conditions: none
Substitute 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, 83, 63, 74, 4662]
After
derived = [56, 14, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S208
S210 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product64 := mul(14, 64)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product64 = 896
Conditions: none
Substitute 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, 83, 64, 14, 896]
After
derived = [10, 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, S210
S212 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product65 := mul(66, 65)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product65 = 4290
Conditions: none
Substitute 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, 83, 65, 66, 4290]
After
derived = [51, 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, S212
S214 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product66 := mul(57, 66)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product66 = 3762
Conditions: none
Substitute 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, 83, 66, 57, 3762]
After
derived = [45, 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, S214
S216 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product67 := mul(27, 67)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product67 = 1809
Conditions: none
Substitute 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, 83, 67, 27, 1809]
After
derived = [21, 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, S216
S218 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product68 := mul(66, 68)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product68 = 4488
Conditions: none
Substitute 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, 83, 68, 66, 4488]
After
derived = [54, 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, S218
S220 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product69 := mul(6, 69)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product69 = 414
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S219
S221 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 69, 6, 414]
After
derived = [4, 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, S220
S222 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product70 := mul(82, 70)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product70 = 5740
Conditions: none
Substitute 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, 83, 70, 82, 5740]
After
derived = [69, 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, S222
S224 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product71 := mul(13, 71)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product71 = 923
Conditions: none
Substitute 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, 83, 71, 13, 923]
After
derived = [11, 10, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S224
S226 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product72 := mul(10, 72)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product72 = 720
Conditions: none
Substitute 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, 83, 72, 10, 720]
After
derived = [8, 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, S226
S228 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product73 := mul(56, 73)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product73 = 4088
Conditions: none
Substitute 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, 83, 73, 56, 4088]
After
derived = [49, 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, S228
S230 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product74 := mul(21, 74)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product74 = 1554
Conditions: none
Substitute 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, 83, 74, 21, 1554]
After
derived = [18, 60, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S230
S232 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product75 := mul(60, 75)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product75 = 4500
Conditions: none
Substitute 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, 83, 75, 60, 4500]
After
derived = [54, 18, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S232
S234 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product76 := mul(18, 76)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product76 = 1368
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S233
S235 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 76, 18, 1368]
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, S234
S236 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product77 := mul(40, 77)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product77 = 3080
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S235
S237 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 77, 40, 3080]
After
derived = [37, 9, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S236
S238 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product78 := mul(9, 78)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product78 = 702
Conditions: none
Substitute 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, 83, 78, 9, 702]
After
derived = [8, 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, S238
S240 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product79 := mul(38, 79)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product79 = 3002
Conditions: none
Substitute 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, 83, 79, 38, 3002]
After
derived = [36, 14, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Step identifiers and dependencies
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S240
S242 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product80 := mul(14, 80)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product80 = 1120
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S241
S243 · implies
Before
source roles = [Wilson ORIGINAL prime factorial, 83, 80, 14, 1120]
After
derived = [13, 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, S242
S244 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product81 := mul(41, 81)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product81 = 3321
Conditions: none
Substitute 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, 83, 81, 41, 3321]
After
derived = [40, 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, S244
S246 · calculation
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product82 := mul(1, 82)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product82 = 82
Conditions: none
Substitute 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, 83, 82, 1, 82]
After
derived = [0, 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, S246
S248 · implies
Before
source roles = [83, [[1, 1], [2, 42], [3, 28], [4, 21], [5, 50], [6, 14], [7, 12], [8, 52], [9, 37], [10, 25], [11, 68], [12, 7], [13, 32], [14, 6], [15, 72], [16, 26], [17, 44], [18, 60], [19, 35], [20, 54], [21, 4], [22, 34], [23, 65], [24, 45], [25, 10], [26, 16], [27, 40], [28, 3], [29, 63], [30, 36], [31, 75], [32, 13], [33, 78], [34, 22], [35, 19], [36, 30], [37, 9], [38, 59], [39, 66], [40, 27], [41, 81], [42, 2], [43, 56], [44, 17], [45, 24], [46, 74], [47, 53], [48, 64], [49, 61], [50, 5], [51, 70], [52, 8], [53, 47], [54, 20], [55, 80], [56, 43], [57, 67], [58, 73], [59, 38], [60, 18], [61, 49], [62, 79], [63, 29], [64, 48], [65, 23], [66, 39], [67, 57], [68, 11], [69, 77], [70, 51], [71, 76], [72, 15], [73, 58], [74, 46], [75, 31], [76, 71], [77, 69], [78, 33], [79, 62], [80, 55], [81, 41], [82, 82]]]
After
derived = [[1, 82], [[2, 42, 1], [3, 28, 1], [4, 21, 1], [5, 50, 1], [6, 14, 1], [7, 12, 1], [8, 52, 1], [9, 37, 1], [10, 25, 1], [11, 68, 1], [13, 32, 1], [15, 72, 1], [16, 26, 1], [17, 44, 1], [18, 60, 1], [19, 35, 1], [20, 54, 1], [22, 34, 1], [23, 65, 1], [24, 45, 1], [27, 40, 1], [29, 63, 1], [30, 36, 1], [31, 75, 1], [33, 78, 1], [38, 59, 1], [39, 66, 1], [41, 81, 1], [43, 56, 1], [46, 74, 1], [47, 53, 1], [48, 64, 1], [49, 61, 1], [51, 70, 1], [55, 80, 1], [57, 67, 1], [58, 73, 1], [62, 79, 1], [69, 77, 1], [71, 76, 1]], 82, 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, S247
Result
(83, [[1, 1], [2, 42], [3, 28], [4, 21], [5, 50], [6, 14], [7, 12], [8, 52], [9, 37], [10, 25], [11, 68], [12, 7], [13, 32], [14, 6], [15, 72], [16, 26], [17, 44], [18, 60], [19, 35], [20, 54], [21, 4], [22, 34], [23, 65], [24, 45], [25, 10], [26, 16], [27, 40], [28, 3], [29, 63], [30, 36], [31, 75], [32, 13], [33, 78], [34, 22], [35, 19], [36, 30], [37, 9], [38, 59], [39, 66], [40, 27], [41, 81], [42, 2], [43, 56], [44, 17], [45, 24], [46, 74], [47, 53], [48, 64], [49, 61], [50, 5], [51, 70], [52, 8], [53, 47], [54, 20], [55, 80], [56, 43], [57, 67], [58, 73], [59, 38], [60, 18], [61, 49], [62, 79], [63, 29], [64, 48], [65, 23], [66, 39], [67, 57], [68, 11], [69, 77], [70, 51], [71, 76], [72, 15], [73, 58], [74, 46], [75, 31], [76, 71], [77, 69], [78, 33], [79, 62], [80, 55], [81, 41], [82, 82]], [1, 82], [[2, 42, 1], [3, 28, 1], [4, 21, 1], [5, 50, 1], [6, 14, 1], [7, 12, 1], [8, 52, 1], [9, 37, 1], [10, 25, 1], [11, 68, 1], [13, 32, 1], [15, 72, 1], [16, 26, 1], [17, 44, 1], [18, 60, 1], [19, 35, 1], [20, 54, 1], [22, 34, 1], [23, 65, 1], [24, 45, 1], [27, 40, 1], [29, 63, 1], [30, 36, 1], [31, 75, 1], [33, 78, 1], [38, 59, 1], [39, 66, 1], [41, 81, 1], [43, 56, 1], [46, 74, 1], [47, 53, 1], [48, 64, 1], [49, 61, 1], [51, 70, 1], [55, 80, 1], [57, 67, 1], [58, 73, 1], [62, 79, 1], [69, 77, 1], [71, 76, 1]], self_inverse_residues_1_and_p_minus_1, 82, Yes)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.