Question 27794: All Nonzero Prime Residues Pair with Inverses, with a Special p=2 Case

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 139

← Question derivation index · Original question batch

R0054-27794 · q-20261015-advance-20261118-r04-wilson-theorem-0044

Original question and givens

Use prime modulus p=67. Give (p, all_inverse_pairs, self_inverse_residues, distinct_cancelling_pairs, self_inverse_scope, factorial_residue, Wilson_congruence).

  • G001 — Use prime modulus p=67. Give (p, all_inverse_pairs, self_inverse_residues, distinct_cancelling_pairs, self_inverse_scope, factorial_residue, Wilson_congruence).

Definition and scope

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.

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 = [67, 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 = [67, 2]

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, S002

S004 · implies

Before

source roles = [67, 3]

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, S003

S005 · implies

Before

source roles = [67, 4]

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, S004

S006 · implies

Before

source roles = [67, 5]

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, S005

S007 · implies

Before

source roles = [67, 6]

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, S006

S008 · implies

Before

source roles = [67, 7]

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, S007

S009 · implies

Before

source roles = [67, 8]

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, S008

S010 · implies

Before

source roles = [67, 9]

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, S009

S011 · implies

Before

source roles = [67, 10]

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, S010

S012 · implies

Before

source roles = [67, 11]

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, S011

S013 · implies

Before

source roles = [67, 12]

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, S012

S014 · implies

Before

source roles = [67, 13]

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, S013

S015 · implies

Before

source roles = [67, 14]

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, S014

S016 · implies

Before

source roles = [67, 15]

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, S015

S017 · implies

Before

source roles = [67, 16]

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, S016

S018 · implies

Before

source roles = [67, 17]

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, S017

S019 · implies

Before

source roles = [67, 18]

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, S018

S020 · implies

Before

source roles = [67, 19]

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, S019

S021 · implies

Before

source roles = [67, 20]

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, S020

S022 · implies

Before

source roles = [67, 21]

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, S021

S023 · implies

Before

source roles = [67, 22]

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, S022

S024 · implies

Before

source roles = [67, 23]

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, S023

S025 · implies

Before

source roles = [67, 24]

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, S024

S026 · implies

Before

source roles = [67, 25]

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, S025

S027 · implies

Before

source roles = [67, 26]

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, S026

S028 · implies

Before

source roles = [67, 27]

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, S027

S029 · implies

Before

source roles = [67, 28]

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, S028

S030 · implies

Before

source roles = [67, 29]

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, S029

S031 · implies

Before

source roles = [67, 30]

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, S030

S032 · implies

Before

source roles = [67, 31]

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, S031

S033 · implies

Before

source roles = [67, 32]

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, S032

S034 · implies

Before

source roles = [67, 33]

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, S033

S035 · implies

Before

source roles = [67, 34]

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, S034

S036 · implies

Before

source roles = [67, 35]

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, S035

S037 · implies

Before

source roles = [67, 36]

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, S036

S038 · implies

Before

source roles = [67, 37]

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, S037

S039 · implies

Before

source roles = [67, 38]

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, S038

S040 · implies

Before

source roles = [67, 39]

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, S039

S041 · implies

Before

source roles = [67, 40]

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, S040

S042 · implies

Before

source roles = [67, 41]

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, S041

S043 · implies

Before

source roles = [67, 42]

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, S042

S044 · implies

Before

source roles = [67, 43]

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, S043

S045 · implies

Before

source roles = [67, 44]

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, S044

S046 · implies

Before

source roles = [67, 45]

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, S045

S047 · implies

Before

source roles = [67, 46]

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, S046

S048 · implies

Before

source roles = [67, 47]

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, S047

S049 · implies

Before

source roles = [67, 48]

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, S048

S050 · implies

Before

source roles = [67, 49]

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, S049

S051 · implies

Before

source roles = [67, 50]

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, S050

S052 · implies

Before

source roles = [67, 51]

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, S051

S053 · implies

Before

source roles = [67, 52]

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, S052

S054 · implies

Before

source roles = [67, 53]

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, S053

S055 · implies

Before

source roles = [67, 54]

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, S054

S056 · implies

Before

source roles = [67, 55]

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, S055

S057 · implies

Before

source roles = [67, 56]

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, S056

S058 · implies

Before

source roles = [67, 57]

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, S057

S059 · implies

Before

source roles = [67, 58]

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, S058

S060 · implies

Before

source roles = [67, 59]

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, S059

S061 · implies

Before

source roles = [67, 60]

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, S060

S062 · implies

Before

source roles = [67, 61]

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, S061

S063 · implies

Before

source roles = [67, 62]

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, S062

S064 · implies

Before

source roles = [67, 63]

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, S063

S065 · implies

Before

source roles = [67, 64]

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, S064

S066 · implies

Before

source roles = [67, 65]

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, S065

S067 · implies

Before

source roles = [67, 66]

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, S066

S068 · 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, S067

S069 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 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, S068

S070 · 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, S069

S071 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 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, S070

S072 · 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, S071

S073 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 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, S072

S074 · 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, S073

S075 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 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, S074

S076 · 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, S075

S077 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 5, 24, 120]

After

derived = [1, 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, S076

S078 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 := mul(53, 6)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 318

Conditions: none

Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S077

S079 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 6, 53, 318]

After

derived = [4, 50, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S078

S080 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 := mul(50, 7)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 350

Conditions: none

Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S079

S081 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 7, 50, 350]

After

derived = [5, 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, S080

S082 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 := mul(15, 8)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 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, S081

S083 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 8, 15, 120]

After

derived = [1, 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, S082

S084 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 := mul(53, 9)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 477

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 9, 53, 477]

After

derived = [7, 8, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S084

S086 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 := mul(8, 10)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 80

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 10, 8, 80]

After

derived = [1, 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, S086

S088 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 := mul(13, 11)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 143

Conditions: none

Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S087

S089 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 11, 13, 143]

After

derived = [2, 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, S088

S090 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 := mul(9, 12)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 108

Conditions: none

Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S089

S091 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 12, 9, 108]

After

derived = [1, 41, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S090

S092 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 := mul(41, 13)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 533

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 13, 41, 533]

After

derived = [7, 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, S092

S094 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 := mul(64, 14)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 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, S093

S095 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 14, 64, 896]

After

derived = [13, 25, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S094

S096 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 := mul(25, 15)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 = 375

Conditions: none

Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S095

S097 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 15, 25, 375]

After

derived = [5, 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, S096

S098 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 := mul(40, 16)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 640

Conditions: none

Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S097

S099 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 16, 40, 640]

After

derived = [9, 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, S098

S100 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(37, 17)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 629

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 17, 37, 629]

After

derived = [9, 26, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S100

S102 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 := mul(26, 18)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 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.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S101

S103 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 18, 26, 468]

After

derived = [6, 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, S102

S104 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 := mul(66, 19)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 = 1254

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 19, 66, 1254]

After

derived = [18, 48, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S104

S106 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(48, 20)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 960

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 20, 48, 960]

After

derived = [14, 22, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S106

S108 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(22, 21)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 462

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 21, 22, 462]

After

derived = [6, 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, S108

S110 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 := mul(60, 22)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 = 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.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S109

S111 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 22, 60, 1320]

After

derived = [19, 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, S110

S112 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 := mul(47, 23)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 = 1081

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 23, 47, 1081]

After

derived = [16, 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, S112

S114 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 := mul(9, 24)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 = 216

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 24, 9, 216]

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.

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 product25 := mul(15, 25)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 = 375

Conditions: none

Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S115

S117 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 25, 15, 375]

After

derived = [5, 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, S116

S118 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 := mul(40, 26)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 = 1040

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 26, 40, 1040]

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, S118

S120 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 := mul(35, 27)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 = 945

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 27, 35, 945]

After

derived = [14, 7, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S120

S122 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 := mul(7, 28)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 = 196

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 28, 7, 196]

After

derived = [2, 62, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S122

S124 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 := mul(62, 29)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 = 1798

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 29, 62, 1798]

After

derived = [26, 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, S124

S126 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 := mul(56, 30)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 = 1680

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 30, 56, 1680]

After

derived = [25, 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, S126

S128 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 := mul(5, 31)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 = 155

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 31, 5, 155]

After

derived = [2, 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, S128

S130 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 := mul(21, 32)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 = 672

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 32, 21, 672]

After

derived = [10, 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, S130

S132 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 := mul(2, 33)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 = 66

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 33, 2, 66]

After

derived = [0, 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, S132

S134 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 := mul(66, 34)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 = 2244

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 34, 66, 2244]

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, S134

S136 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 := mul(33, 35)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 = 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, S135

S137 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 35, 33, 1155]

After

derived = [17, 16, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S136

S138 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 := mul(16, 36)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 = 576

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 36, 16, 576]

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.

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 product37 := mul(40, 37)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 = 1480

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 37, 40, 1480]

After

derived = [22, 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, S140

S142 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 := mul(6, 38)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 = 228

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 38, 6, 228]

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.

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 product39 := mul(27, 39)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 = 1053

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 39, 27, 1053]

After

derived = [15, 48, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S144

S146 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 := mul(48, 40)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 = 1920

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 40, 48, 1920]

After

derived = [28, 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, S146

S148 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 := mul(44, 41)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 = 1804

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 41, 44, 1804]

After

derived = [26, 62, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S148

S150 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 := mul(62, 42)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 = 2604

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 42, 62, 2604]

After

derived = [38, 58, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S150

S152 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 := mul(58, 43)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 = 2494

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 43, 58, 2494]

After

derived = [37, 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, S152

S154 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 := mul(15, 44)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 = 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, S153

S155 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 44, 15, 660]

After

derived = [9, 57, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S154

S156 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 := mul(57, 45)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 = 2565

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 45, 57, 2565]

After

derived = [38, 19, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S156

S158 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 := mul(19, 46)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 = 874

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 46, 19, 874]

After

derived = [13, 3, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S158

S160 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 := mul(3, 47)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 = 141

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 47, 3, 141]

After

derived = [2, 7, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S160

S162 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 := mul(7, 48)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 = 336

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 48, 7, 336]

After

derived = [5, 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, S162

S164 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 := mul(1, 49)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 = 49

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 49, 1, 49]

After

derived = [0, 49, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S164

S166 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 := mul(49, 50)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 = 2450

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 50, 49, 2450]

After

derived = [36, 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, S166

S168 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 := mul(38, 51)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 = 1938

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 51, 38, 1938]

After

derived = [28, 62, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S168

S170 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 := mul(62, 52)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 = 3224

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 52, 62, 3224]

After

derived = [48, 8, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S170

S172 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 := mul(8, 53)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 = 424

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 53, 8, 424]

After

derived = [6, 22, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S172

S174 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 := mul(22, 54)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 = 1188

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 54, 22, 1188]

After

derived = [17, 49, Yes, Yes]

Conditions: none

Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S174

S176 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 := mul(49, 55)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 = 2695

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 55, 49, 2695]

After

derived = [40, 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, S176

S178 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 := mul(15, 56)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 = 840

Conditions: none

Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S177

S179 · implies

Before

source roles = [Wilson ORIGINAL prime factorial, 67, 56, 15, 840]

After

derived = [12, 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, S178

S180 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 := mul(36, 57)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 = 2052

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 57, 36, 2052]

After

derived = [30, 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, S180

S182 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 := mul(42, 58)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 = 2436

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 58, 42, 2436]

After

derived = [36, 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, S182

S184 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 := mul(24, 59)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 = 1416

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 59, 24, 1416]

After

derived = [21, 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, S184

S186 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 := mul(9, 60)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 = 540

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 60, 9, 540]

After

derived = [8, 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, S186

S188 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product61 := mul(4, 61)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product61 = 244

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 61, 4, 244]

After

derived = [3, 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, S188

S190 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product62 := mul(43, 62)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product62 = 2666

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 62, 43, 2666]

After

derived = [39, 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, S190

S192 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product63 := mul(53, 63)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product63 = 3339

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 63, 53, 3339]

After

derived = [49, 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, S192

S194 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product64 := mul(56, 64)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product64 = 3584

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 64, 56, 3584]

After

derived = [53, 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, S194

S196 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product65 := mul(33, 65)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product65 = 2145

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 65, 33, 2145]

After

derived = [32, 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, S196

S198 · calculation

Before

Wilson ORIGINAL prime factorial ORIGINAL running factorial product66 := mul(1, 66)

After

Wilson ORIGINAL prime factorial ORIGINAL running factorial product66 = 66

Conditions: none

Substitute original roles and established intermediates exactly,not 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, 67, 66, 1, 66]

After

derived = [0, 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, S198

S200 · implies

Before

source roles = [67, [[1, 1], [2, 34], [3, 45], [4, 17], [5, 27], [6, 56], [7, 48], [8, 42], [9, 15], [10, 47], [11, 61], [12, 28], [13, 31], [14, 24], [15, 9], [16, 21], [17, 4], [18, 41], [19, 60], [20, 57], [21, 16], [22, 64], [23, 35], [24, 14], [25, 59], [26, 49], [27, 5], [28, 12], [29, 37], [30, 38], [31, 13], [32, 44], [33, 65], [34, 2], [35, 23], [36, 54], [37, 29], [38, 30], [39, 55], [40, 62], [41, 18], [42, 8], [43, 53], [44, 32], [45, 3], [46, 51], [47, 10], [48, 7], [49, 26], [50, 63], [51, 46], [52, 58], [53, 43], [54, 36], [55, 39], [56, 6], [57, 20], [58, 52], [59, 25], [60, 19], [61, 11], [62, 40], [63, 50], [64, 22], [65, 33], [66, 66]]]

After

derived = [[1, 66], [[2, 34, 1], [3, 45, 1], [4, 17, 1], [5, 27, 1], [6, 56, 1], [7, 48, 1], [8, 42, 1], [9, 15, 1], [10, 47, 1], [11, 61, 1], [12, 28, 1], [13, 31, 1], [14, 24, 1], [16, 21, 1], [18, 41, 1], [19, 60, 1], [20, 57, 1], [22, 64, 1], [23, 35, 1], [25, 59, 1], [26, 49, 1], [29, 37, 1], [30, 38, 1], [32, 44, 1], [33, 65, 1], [36, 54, 1], [39, 55, 1], [40, 62, 1], [43, 53, 1], [46, 51, 1], [50, 63, 1], [52, 58, 1]], 66, 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, S199

Reverse checks

  • S200 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S199 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S198 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product66 with exact rational arithmetic, not rounded decimals.
  • S197 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S196 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product65 with exact rational arithmetic, not rounded decimals.
  • S195 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S194 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product64 with exact rational arithmetic, not rounded decimals.
  • S193 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S192 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product63 with exact rational arithmetic, not rounded decimals.
  • S191 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S190 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product62 with exact rational arithmetic, not rounded decimals.
  • S189 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S188 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product61 with exact rational arithmetic, not rounded decimals.
  • S187 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S186 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product60 with exact rational arithmetic, not rounded decimals.
  • S185 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S184 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product59 with exact rational arithmetic, not rounded decimals.
  • S183 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S182 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product58 with exact rational arithmetic, not rounded decimals.
  • S181 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S180 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product57 with exact rational arithmetic, not rounded decimals.
  • S179 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S178 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product56 with exact rational arithmetic, not rounded decimals.
  • S177 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S176 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product55 with exact rational arithmetic, not rounded decimals.
  • S175 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S174 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product54 with exact rational arithmetic, not rounded decimals.
  • S173 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S172 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product53 with exact rational arithmetic, not rounded decimals.
  • S171 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S170 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product52 with exact rational arithmetic, not rounded decimals.
  • S169 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S168 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product51 with exact rational arithmetic, not rounded decimals.
  • S167 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S166 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product50 with exact rational arithmetic, not rounded decimals.
  • S165 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S164 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product49 with exact rational arithmetic, not rounded decimals.
  • S163 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S162 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product48 with exact rational arithmetic, not rounded decimals.
  • S161 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S160 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product47 with exact rational arithmetic, not rounded decimals.
  • S159 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S158 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product46 with exact rational arithmetic, not rounded decimals.
  • S157 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S156 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product45 with exact rational arithmetic, not rounded decimals.
  • S155 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S154 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product44 with exact rational arithmetic, not rounded decimals.
  • S153 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S152 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product43 with exact rational arithmetic, not rounded decimals.
  • S151 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S150 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product42 with exact rational arithmetic, not rounded decimals.
  • S149 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S148 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product41 with exact rational arithmetic, not rounded decimals.
  • S147 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S146 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product40 with exact rational arithmetic, not rounded decimals.
  • S145 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S144 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product39 with exact rational arithmetic, not rounded decimals.
  • S143 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S142 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product38 with exact rational arithmetic, not rounded decimals.
  • S141 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S140 · premise_and_result_audit — Recompute Wilson ORIGINAL prime factorial ORIGINAL running factorial product37 with exact rational arithmetic, not rounded decimals.
  • 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 product36 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 product35 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 product34 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 product33 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 product32 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 product31 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 product30 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 product29 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 product28 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 product27 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 product26 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 product25 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 product24 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 product23 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 product22 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 product21 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 product20 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 product19 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 product18 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 product17 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 product16 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 product15 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 product14 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 product13 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 product12 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 product11 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 product10 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 product9 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 product8 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 product7 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 product6 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 product5 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 product4 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 product3 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 product2 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 product1 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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.

Result

(67, [[1, 1], [2, 34], [3, 45], [4, 17], [5, 27], [6, 56], [7, 48], [8, 42], [9, 15], [10, 47], [11, 61], [12, 28], [13, 31], [14, 24], [15, 9], [16, 21], [17, 4], [18, 41], [19, 60], [20, 57], [21, 16], [22, 64], [23, 35], [24, 14], [25, 59], [26, 49], [27, 5], [28, 12], [29, 37], [30, 38], [31, 13], [32, 44], [33, 65], [34, 2], [35, 23], [36, 54], [37, 29], [38, 30], [39, 55], [40, 62], [41, 18], [42, 8], [43, 53], [44, 32], [45, 3], [46, 51], [47, 10], [48, 7], [49, 26], [50, 63], [51, 46], [52, 58], [53, 43], [54, 36], [55, 39], [56, 6], [57, 20], [58, 52], [59, 25], [60, 19], [61, 11], [62, 40], [63, 50], [64, 22], [65, 33], [66, 66]], [1, 66], [[2, 34, 1], [3, 45, 1], [4, 17, 1], [5, 27, 1], [6, 56, 1], [7, 48, 1], [8, 42, 1], [9, 15, 1], [10, 47, 1], [11, 61, 1], [12, 28, 1], [13, 31, 1], [14, 24, 1], [16, 21, 1], [18, 41, 1], [19, 60, 1], [20, 57, 1], [22, 64, 1], [23, 35, 1], [25, 59, 1], [26, 49, 1], [29, 37, 1], [30, 38, 1], [32, 44, 1], [33, 65, 1], [36, 54, 1], [39, 55, 1], [40, 62, 1], [43, 53, 1], [46, 51, 1], [50, 63, 1], [52, 58, 1]], self_inverse_residues_1_and_p_minus_1, 66, Yes)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

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.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: d04541a70790756d135eb291442716bb2d65db0639be3fb64314722bd1a7816a
  • candidate record SHA-256: f9bb40090913aef3fd0c7687f622c0ebb3611afdc855f6e810c6b86fc8bf1f08
  • semantic review receipt SHA-256: 0a76d8e93c08bb16998a0483f3dfc0504f269fc3e1982e6cd868cab0a2856d54
  • question-first witness SHA-256: 09127b736c225714dfa0b7ceb0e6a6e66df27438b480cad8217d3c2f99ce9437
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON