Explore related knowledge and questions →
← Question derivation index · Original question batch
R0054-27790 · q-20261015-advance-20261118-r04-wilson-theorem-0040
Use prime modulus p=47. Give (p, all_inverse_pairs, self_inverse_residues, distinct_cancelling_pairs, self_inverse_scope, factorial_residue, Wilson_congruence).
G001 — Use prime modulus p=47. Give (p, all_inverse_pairs, self_inverse_residues, distinct_cancelling_pairs, self_inverse_scope, factorial_residue, Wilson_congruence).Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.
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.
Rule: source_ordered_fields_without_JS · Uses: G001
Before
source roles = [47, 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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S001
Before
source roles = [47, 2]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S002
Before
source roles = [47, 3]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S003
Before
source roles = [47, 4]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S004
Before
source roles = [47, 5]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S005
Before
source roles = [47, 6]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S006
Before
source roles = [47, 7]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S007
Before
source roles = [47, 8]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S008
Before
source roles = [47, 9]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S009
Before
source roles = [47, 10]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S010
Before
source roles = [47, 11]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S011
Before
source roles = [47, 12]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S012
Before
source roles = [47, 13]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S013
Before
source roles = [47, 14]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S014
Before
source roles = [47, 15]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S015
Before
source roles = [47, 16]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S016
Before
source roles = [47, 17]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S017
Before
source roles = [47, 18]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S018
Before
source roles = [47, 19]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S019
Before
source roles = [47, 20]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S020
Before
source roles = [47, 21]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S021
Before
source roles = [47, 22]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S022
Before
source roles = [47, 23]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S023
Before
source roles = [47, 24]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S024
Before
source roles = [47, 25]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S025
Before
source roles = [47, 26]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S026
Before
source roles = [47, 27]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S027
Before
source roles = [47, 28]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S028
Before
source roles = [47, 29]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S029
Before
source roles = [47, 30]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S030
Before
source roles = [47, 31]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S031
Before
source roles = [47, 32]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S032
Before
source roles = [47, 33]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S033
Before
source roles = [47, 34]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S034
Before
source roles = [47, 35]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S035
Before
source roles = [47, 36]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S036
Before
source roles = [47, 37]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S037
Before
source roles = [47, 38]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S038
Before
source roles = [47, 39]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S039
Before
source roles = [47, 40]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S040
Before
source roles = [47, 41]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S041
Before
source roles = [47, 42]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S042
Before
source roles = [47, 43]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S043
Before
source roles = [47, 44]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S044
Before
source roles = [47, 45]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S045
Before
source roles = [47, 46]
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.
Rule: Wilson_EVERY_nonzero_prime_residue_unique_inverse · Uses: G001, S046
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.
Rule: exact_rational_arithmetic · Uses: G001, S047
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S048
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.
Rule: exact_rational_arithmetic · Uses: G001, S049
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S050
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.
Rule: exact_rational_arithmetic · Uses: G001, S051
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S052
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.
Rule: exact_rational_arithmetic · Uses: G001, S053
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S054
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.
Rule: exact_rational_arithmetic · Uses: G001, S055
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 5, 24, 120]
After
derived = [2, 26, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S056
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 := mul(26, 6)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 156
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S057
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 6, 26, 156]
After
derived = [3, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S058
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 := mul(15, 7)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 105
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S059
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 7, 15, 105]
After
derived = [2, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S060
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 := mul(11, 8)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 88
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S061
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 8, 11, 88]
After
derived = [1, 41, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S062
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 := mul(41, 9)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 369
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S063
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 9, 41, 369]
After
derived = [7, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S064
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 := mul(40, 10)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 400
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S065
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 10, 40, 400]
After
derived = [8, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S066
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 := mul(24, 11)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 264
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S067
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 11, 24, 264]
After
derived = [5, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S068
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 := mul(29, 12)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 348
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S069
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 12, 29, 348]
After
derived = [7, 19, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S070
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 := mul(19, 13)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 247
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S071
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 13, 19, 247]
After
derived = [5, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S072
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 := mul(12, 14)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 168
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S073
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 14, 12, 168]
After
derived = [3, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S074
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 := mul(27, 15)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 = 405
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S075
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 15, 27, 405]
After
derived = [8, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S076
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 := mul(29, 16)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 464
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S077
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 16, 29, 464]
After
derived = [9, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S078
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(41, 17)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 697
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S079
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 17, 41, 697]
After
derived = [14, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S080
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 := mul(39, 18)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 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.
Rule: exact_rational_arithmetic · Uses: G001, S081
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 18, 39, 702]
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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S082
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.
Rule: exact_rational_arithmetic · Uses: G001, S083
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 19, 44, 836]
After
derived = [17, 37, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S084
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(37, 20)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 740
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S085
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 20, 37, 740]
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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S086
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(35, 21)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 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.
Rule: exact_rational_arithmetic · Uses: G001, S087
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 21, 35, 735]
After
derived = [15, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S088
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.
Rule: exact_rational_arithmetic · Uses: G001, S089
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 22, 30, 660]
After
derived = [14, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S090
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 := mul(2, 23)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 = 46
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S091
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 23, 2, 46]
After
derived = [0, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S092
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 := mul(46, 24)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 = 1104
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S093
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 24, 46, 1104]
After
derived = [23, 23, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S094
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 := mul(23, 25)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 = 575
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S095
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 25, 23, 575]
After
derived = [12, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S096
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 := mul(11, 26)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 = 286
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S097
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 26, 11, 286]
After
derived = [6, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S098
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 := mul(4, 27)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 = 108
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S099
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 27, 4, 108]
After
derived = [2, 14, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S100
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 := mul(14, 28)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 = 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.
Rule: exact_rational_arithmetic · Uses: G001, S101
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 28, 14, 392]
After
derived = [8, 16, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S102
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 := mul(16, 29)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 = 464
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S103
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 29, 16, 464]
After
derived = [9, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S104
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 := mul(41, 30)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 = 1230
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S105
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 30, 41, 1230]
After
derived = [26, 8, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S106
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 := mul(8, 31)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 = 248
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S107
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 31, 8, 248]
After
derived = [5, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S108
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 := mul(13, 32)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 = 416
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S109
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 32, 13, 416]
After
derived = [8, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S110
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 := mul(40, 33)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 = 1320
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S111
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 33, 40, 1320]
After
derived = [28, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S112
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 := mul(4, 34)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 = 136
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S113
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 34, 4, 136]
After
derived = [2, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S114
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 := mul(42, 35)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 = 1470
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S115
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 35, 42, 1470]
After
derived = [31, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S116
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 := mul(13, 36)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 = 468
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S117
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 36, 13, 468]
After
derived = [9, 45, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S118
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 := mul(45, 37)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 = 1665
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S119
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 37, 45, 1665]
After
derived = [35, 20, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S120
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 := mul(20, 38)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 = 760
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S121
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 38, 20, 760]
After
derived = [16, 8, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S122
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 := mul(8, 39)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 = 312
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S123
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 39, 8, 312]
After
derived = [6, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S124
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 := mul(30, 40)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 = 1200
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S125
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 40, 30, 1200]
After
derived = [25, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S126
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 := mul(25, 41)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 = 1025
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S127
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 41, 25, 1025]
After
derived = [21, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S128
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 := mul(38, 42)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 = 1596
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S129
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 42, 38, 1596]
After
derived = [33, 45, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S130
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 := mul(45, 43)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 = 1935
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S131
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 43, 45, 1935]
After
derived = [41, 8, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S132
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 := mul(8, 44)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 = 352
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S133
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 44, 8, 352]
After
derived = [7, 23, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S134
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 := mul(23, 45)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 = 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.
Rule: exact_rational_arithmetic · Uses: G001, S135
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 45, 23, 1035]
After
derived = [22, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S136
Before
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 := mul(1, 46)
After
Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 = 46
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S137
Before
source roles = [Wilson ORIGINAL prime factorial, 47, 46, 1, 46]
After
derived = [0, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S138
Before
source roles = [47, [[1, 1], [2, 24], [3, 16], [4, 12], [5, 19], [6, 8], [7, 27], [8, 6], [9, 21], [10, 33], [11, 30], [12, 4], [13, 29], [14, 37], [15, 22], [16, 3], [17, 36], [18, 34], [19, 5], [20, 40], [21, 9], [22, 15], [23, 45], [24, 2], [25, 32], [26, 38], [27, 7], [28, 42], [29, 13], [30, 11], [31, 44], [32, 25], [33, 10], [34, 18], [35, 43], [36, 17], [37, 14], [38, 26], [39, 41], [40, 20], [41, 39], [42, 28], [43, 35], [44, 31], [45, 23], [46, 46]]]
After
derived = [[1, 46], [[2, 24, 1], [3, 16, 1], [4, 12, 1], [5, 19, 1], [6, 8, 1], [7, 27, 1], [9, 21, 1], [10, 33, 1], [11, 30, 1], [13, 29, 1], [14, 37, 1], [15, 22, 1], [17, 36, 1], [18, 34, 1], [20, 40, 1], [23, 45, 1], [25, 32, 1], [26, 38, 1], [28, 42, 1], [31, 44, 1], [35, 43, 1], [39, 41, 1]], 46, 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.
Rule: Wilson_GENERAL_inverse_pairing_and_p2_exception · Uses: G001, S139
S140 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S139 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S138 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 with exact rational arithmetic, not rounded decimals.S137 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S136 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 with exact rational arithmetic, not rounded decimals.S135 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S134 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 with exact rational arithmetic, not rounded decimals.S133 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S132 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 with exact rational arithmetic, not rounded decimals.S131 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S130 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 with exact rational arithmetic, not rounded decimals.S129 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S128 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 with exact rational arithmetic, not rounded decimals.S127 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S126 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 with exact rational arithmetic, not rounded decimals.S125 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S124 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 with exact rational arithmetic, not rounded decimals.S123 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S122 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 with exact rational arithmetic, not rounded decimals.S121 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S120 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 with exact rational arithmetic, not rounded decimals.S119 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S118 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 with exact rational arithmetic, not rounded decimals.S117 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S116 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 with exact rational arithmetic, not rounded decimals.S115 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S114 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 with exact rational arithmetic, not rounded decimals.S113 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S112 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 with exact rational arithmetic, not rounded decimals.S111 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S110 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 with exact rational arithmetic, not rounded decimals.S109 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S108 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 with exact rational arithmetic, not rounded decimals.S107 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S106 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 with exact rational arithmetic, not rounded decimals.S105 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S104 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 with exact rational arithmetic, not rounded decimals.S103 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S102 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 with exact rational arithmetic, not rounded decimals.S101 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S100 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 with exact rational arithmetic, not rounded decimals.S099 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S098 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 with exact rational arithmetic, not rounded decimals.S097 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S096 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 with exact rational arithmetic, not rounded decimals.S095 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S094 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 with exact rational arithmetic, not rounded decimals.S093 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S092 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 with exact rational arithmetic, not rounded decimals.S091 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S090 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 with exact rational arithmetic, not rounded decimals.S089 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S088 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 with exact rational arithmetic, not rounded decimals.S087 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S086 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 with exact rational arithmetic, not rounded decimals.S085 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S084 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 with exact rational arithmetic, not rounded decimals.S083 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S082 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 with exact rational arithmetic, not rounded decimals.S081 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S080 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 with exact rational arithmetic, not rounded decimals.S079 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S078 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 with exact rational arithmetic, not rounded decimals.S077 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S076 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 with exact rational arithmetic, not rounded decimals.S075 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S074 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 with exact rational arithmetic, not rounded decimals.S073 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S072 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 with exact rational arithmetic, not rounded decimals.S071 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S070 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 with exact rational arithmetic, not rounded decimals.S069 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S068 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 with exact rational arithmetic, not rounded decimals.S067 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S066 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 with exact rational arithmetic, not rounded decimals.S065 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S064 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 with exact rational arithmetic, not rounded decimals.S063 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S062 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 with exact rational arithmetic, not rounded decimals.S061 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S060 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 with exact rational arithmetic, not rounded decimals.S059 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S058 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 with exact rational arithmetic, not rounded decimals.S057 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S056 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product5 with exact rational arithmetic, not rounded decimals.S055 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S054 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product4 with exact rational arithmetic, not rounded decimals.S053 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S052 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product3 with exact rational arithmetic, not rounded decimals.S051 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S050 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product2 with exact rational arithmetic, not rounded decimals.S049 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S048 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product1 with exact rational arithmetic, not rounded decimals.S047 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S046 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S045 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S044 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S043 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S042 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S041 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S040 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S039 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S038 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S037 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S036 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S035 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S034 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S033 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S032 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S031 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S030 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S029 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S028 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S027 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S026 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S025 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S024 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S023 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S022 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S021 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S020 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S019 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S018 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S017 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S016 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S015 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S014 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S013 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S012 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S011 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S010 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S009 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S008 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S007 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S006 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S005 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S004 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S003 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S002 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S001 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.(47, [[1, 1], [2, 24], [3, 16], [4, 12], [5, 19], [6, 8], [7, 27], [8, 6], [9, 21], [10, 33], [11, 30], [12, 4], [13, 29], [14, 37], [15, 22], [16, 3], [17, 36], [18, 34], [19, 5], [20, 40], [21, 9], [22, 15], [23, 45], [24, 2], [25, 32], [26, 38], [27, 7], [28, 42], [29, 13], [30, 11], [31, 44], [32, 25], [33, 10], [34, 18], [35, 43], [36, 17], [37, 14], [38, 26], [39, 41], [40, 20], [41, 39], [42, 28], [43, 35], [44, 31], [45, 23], [46, 46]], [1, 46], [[2, 24, 1], [3, 16, 1], [4, 12, 1], [5, 19, 1], [6, 8, 1], [7, 27, 1], [9, 21, 1], [10, 33, 1], [11, 30, 1], [13, 29, 1], [14, 37, 1], [15, 22, 1], [17, 36, 1], [18, 34, 1], [20, 40, 1], [23, 45, 1], [25, 32, 1], [26, 38, 1], [28, 42, 1], [31, 44, 1], [35, 43, 1], [39, 41, 1]], self_inverse_residues_1_and_p_minus_1, 46, Yes)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.
input commit: 0f7be61e2c22317a4075561dc822c87d881a50dboriginal question SHA-256: 9b5b3073e6c7c1d219348880adb2e474e78a8ddc3a0c23d0039e071898b309bfcandidate record SHA-256: b10cd3f27cb092e2ac42a7fc68fde5e8598dd1bf06fc1da5cbf0257d37a9f5acsemantic review receipt SHA-256: 0a76d8e93c08bb16998a0483f3dfc0504f269fc3e1982e6cd868cab0a2856d54question-first witness SHA-256: 09127b736c225714dfa0b7ceb0e6a6e66df27438b480cad8217d3c2f99ce9437Lean: NOT_RUN · human review: NOT_PERFORMED