Explore related knowledge and questions →

Question 27722: Wilson Domain, Finite Testing, Fermat Comparison and the p=2 Exception Stay Separate

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-27722 · q-20261015-advance-20261118-r04-wilson-theorem-0097

Original question and givens

Use mode=fermat_confusion and exact integer n=79. Give (mode, n, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, Wilson_statement, Fermat_statement, theorem_identification_claim, boundary).

  • G001 — Use mode=fermat_confusion and exact integer n=79. Give (mode, n, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, Wilson_statement, Fermat_statement, theorem_identification_claim, boundary).

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-boundary]

After

derived = [[mode, n, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, Wilson_statement, Fermat_statement, theorem_identification_claim, boundary]]

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 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product1 := mul(1, 1)

After

Wilson boundary ORIGINAL prime 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, S001

S003 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 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, S002

S004 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product2 := mul(1, 2)

After

Wilson boundary ORIGINAL prime 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, S003

S005 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 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, S004

S006 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product3 := mul(2, 3)

After

Wilson boundary ORIGINAL prime 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, S005

S007 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 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, S006

S008 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product4 := mul(6, 4)

After

Wilson boundary ORIGINAL prime 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, S007

S009 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 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, S008

S010 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product5 := mul(24, 5)

After

Wilson boundary ORIGINAL prime 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, S009

S011 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 5, 24, 120]

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

S012 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product6 = 246

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 6, 41, 246]

After

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

S014 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product7 = 63

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S013

S015 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 7, 9, 63]

After

derived = [0, 63, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S014

S016 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product8 = 504

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S015

S017 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 8, 63, 504]

After

derived = [6, 30, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S016

S018 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product9 = 270

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S017

S019 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 9, 30, 270]

After

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

S020 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product10 = 330

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S019

S021 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 10, 33, 330]

After

derived = [4, 14, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S020

S022 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product11 = 154

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S021

S023 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 11, 14, 154]

After

derived = [1, 75, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S022

S024 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product12 = 900

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S023

S025 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 12, 75, 900]

After

derived = [11, 31, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S024

S026 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product13 = 403

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S025

S027 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 13, 31, 403]

After

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

S028 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product14 = 112

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S027

S029 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 14, 8, 112]

After

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

S030 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product15 = 495

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S029

S031 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 15, 33, 495]

After

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

S032 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product16 = 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, S031

S033 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 16, 21, 336]

After

derived = [4, 20, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S032

S034 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product17 = 340

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S033

S035 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 17, 20, 340]

After

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

S036 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product18 = 432

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S035

S037 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 18, 24, 432]

After

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

S038 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product19 = 703

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S037

S039 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 19, 37, 703]

After

derived = [8, 71, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S038

S040 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product20 = 1420

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S039

S041 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 20, 71, 1420]

After

derived = [17, 77, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S040

S042 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product21 = 1617

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S041

S043 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 21, 77, 1617]

After

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

S044 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product22 = 814

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S043

S045 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 22, 37, 814]

After

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

S046 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product23 = 552

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S045

S047 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 23, 24, 552]

After

derived = [6, 78, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S046

S048 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product24 = 1872

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S047

S049 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 24, 78, 1872]

After

derived = [23, 55, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S048

S050 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product25 := mul(55, 25)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product25 = 1375

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S049

S051 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 25, 55, 1375]

After

derived = [17, 32, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S050

S052 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product26 = 832

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S051

S053 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 26, 32, 832]

After

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

S054 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product27 = 1134

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S053

S055 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 27, 42, 1134]

After

derived = [14, 28, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S054

S056 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product28 = 784

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S055

S057 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 28, 28, 784]

After

derived = [9, 73, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S056

S058 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product29 = 2117

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S057

S059 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 29, 73, 2117]

After

derived = [26, 63, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S058

S060 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product30 = 1890

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S059

S061 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 30, 63, 1890]

After

derived = [23, 73, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S060

S062 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product31 = 2263

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S061

S063 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 31, 73, 2263]

After

derived = [28, 51, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S062

S064 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product32 = 1632

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S063

S065 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 32, 51, 1632]

After

derived = [20, 52, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S064

S066 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product33 = 1716

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S065

S067 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 33, 52, 1716]

After

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

S068 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product34 = 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, S067

S069 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 34, 57, 1938]

After

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

S070 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product35 = 1470

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S069

S071 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 35, 42, 1470]

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

S072 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product36 = 1728

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 36, 48, 1728]

After

derived = [21, 69, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S072

S074 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product37 := mul(69, 37)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product37 = 2553

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 37, 69, 2553]

After

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

S076 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product38 = 950

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 38, 25, 950]

After

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

S078 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product39 := mul(2, 39)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product39 = 78

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 39, 2, 78]

After

derived = [0, 78, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S078

S080 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product40 = 3120

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 40, 78, 3120]

After

derived = [39, 39, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S080

S082 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product41 = 1599

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 41, 39, 1599]

After

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

S084 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product42 = 798

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 42, 19, 798]

After

derived = [10, 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 boundary ORIGINAL prime ORIGINAL running factorial product43 := mul(8, 43)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product43 = 344

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 43, 8, 344]

After

derived = [4, 28, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S086

S088 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product44 = 1232

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 44, 28, 1232]

After

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

S090 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product45 = 2115

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 45, 47, 2115]

After

derived = [26, 61, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S090

S092 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product46 = 2806

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 46, 61, 2806]

After

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

S094 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product47 = 1927

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 47, 41, 1927]

After

derived = [24, 31, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S094

S096 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product48 = 1488

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 48, 31, 1488]

After

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

S098 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product49 = 3234

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 49, 66, 3234]

After

derived = [40, 74, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S098

S100 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product50 = 3700

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 50, 74, 3700]

After

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

S102 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product51 = 3366

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 51, 66, 3366]

After

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

S104 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product52 = 2496

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 52, 48, 2496]

After

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

S106 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product53 = 2491

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 53, 47, 2491]

After

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

S108 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product54 = 2268

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 54, 42, 2268]

After

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

S110 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product55 = 3080

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S109

S111 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 55, 56, 3080]

After

derived = [38, 78, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S110

S112 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product56 = 4368

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 56, 78, 4368]

After

derived = [55, 23, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S112

S114 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product57 = 1311

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 57, 23, 1311]

After

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

S116 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product58 = 2726

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 58, 47, 2726]

After

derived = [34, 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 boundary ORIGINAL prime ORIGINAL running factorial product59 := mul(40, 59)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product59 = 2360

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 59, 40, 2360]

After

derived = [29, 69, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S118

S120 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product60 = 4140

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 60, 69, 4140]

After

derived = [52, 32, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S120

S122 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product61 = 1952

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 61, 32, 1952]

After

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

S124 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product62 = 3472

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 62, 56, 3472]

After

derived = [43, 75, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S124

S126 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product63 = 4725

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 63, 75, 4725]

After

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

S128 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product64 = 4096

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 64, 64, 4096]

After

derived = [51, 67, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S128

S130 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product65 = 4355

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 65, 67, 4355]

After

derived = [55, 10, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S130

S132 · calculation

Before

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

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product66 = 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, S131

S133 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 66, 10, 660]

After

derived = [8, 28, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S132

S134 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product67 := mul(28, 67)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product67 = 1876

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 67, 28, 1876]

After

derived = [23, 59, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S134

S136 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product68 := mul(59, 68)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product68 = 4012

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 68, 59, 4012]

After

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

S138 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product69 := mul(62, 69)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product69 = 4278

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 69, 62, 4278]

After

derived = [54, 12, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S138

S140 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product70 := mul(12, 70)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product70 = 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, S139

S141 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 70, 12, 840]

After

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

S142 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product71 := mul(50, 71)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product71 = 3550

Conditions: none

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

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S141

S143 · implies

Before

source roles = [Wilson boundary ORIGINAL prime, 79, 71, 50, 3550]

After

derived = [44, 74, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S142

S144 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product72 := mul(74, 72)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product72 = 5328

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 72, 74, 5328]

After

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

S146 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product73 := mul(35, 73)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product73 = 2555

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 73, 35, 2555]

After

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

S148 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product74 := mul(27, 74)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product74 = 1998

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 74, 27, 1998]

After

derived = [25, 23, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S148

S150 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product75 := mul(23, 75)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product75 = 1725

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 75, 23, 1725]

After

derived = [21, 66, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S150

S152 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product76 := mul(66, 76)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product76 = 5016

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 76, 66, 5016]

After

derived = [63, 39, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S152

S154 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product77 := mul(39, 77)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product77 = 3003

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 77, 39, 3003]

After

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

S156 · calculation

Before

Wilson boundary ORIGINAL prime ORIGINAL running factorial product78 := mul(1, 78)

After

Wilson boundary ORIGINAL prime ORIGINAL running factorial product78 = 78

Conditions: none

Substitute original roles and established intermediates exactly,not 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 boundary ORIGINAL prime, 79, 78, 1, 78]

After

derived = [0, 78, Yes, Yes]

Conditions: none

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

Step identifiers and dependencies

Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S156

S158 · implies

Before

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

After

derived = [78, Yes, No]

Conditions: none

Wilson concerns(n-1)!;Fermat concerns a^(n-1) when n does not divide a.This branch supplies no a or power computation.The named comparison neither identifies the theorems nor adds an executed power test.

Step identifiers and dependencies

Rule: Wilson_and_Fermat_DISTINCT_named_statements_NO_unprovided_a_power · Uses: G001, S157

Reverse checks

  • S158 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • 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 boundary ORIGINAL prime ORIGINAL running factorial product78 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 boundary ORIGINAL prime ORIGINAL running factorial product77 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 boundary ORIGINAL prime ORIGINAL running factorial product76 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 boundary ORIGINAL prime ORIGINAL running factorial product75 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 boundary ORIGINAL prime ORIGINAL running factorial product74 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 boundary ORIGINAL prime ORIGINAL running factorial product73 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 boundary ORIGINAL prime ORIGINAL running factorial product72 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 boundary ORIGINAL prime ORIGINAL running factorial product71 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 boundary ORIGINAL prime ORIGINAL running factorial product70 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 boundary ORIGINAL prime ORIGINAL running factorial product69 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 boundary ORIGINAL prime ORIGINAL running factorial product68 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 boundary ORIGINAL prime ORIGINAL running factorial product67 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 boundary ORIGINAL prime ORIGINAL running factorial product66 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 boundary ORIGINAL prime ORIGINAL running factorial product65 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 boundary ORIGINAL prime ORIGINAL running factorial product64 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 boundary ORIGINAL prime ORIGINAL running factorial product63 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 boundary ORIGINAL prime ORIGINAL running factorial product62 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 boundary ORIGINAL prime ORIGINAL running factorial product61 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 boundary ORIGINAL prime ORIGINAL running factorial product60 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 boundary ORIGINAL prime ORIGINAL running factorial product59 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 boundary ORIGINAL prime ORIGINAL running factorial product58 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 boundary ORIGINAL prime ORIGINAL running factorial product57 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 boundary ORIGINAL prime ORIGINAL running factorial product56 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 boundary ORIGINAL prime ORIGINAL running factorial product55 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 boundary ORIGINAL prime ORIGINAL running factorial product54 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 boundary ORIGINAL prime ORIGINAL running factorial product53 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 boundary ORIGINAL prime ORIGINAL running factorial product52 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 boundary ORIGINAL prime ORIGINAL running factorial product51 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 boundary ORIGINAL prime ORIGINAL running factorial product50 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 boundary ORIGINAL prime ORIGINAL running factorial product49 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 boundary ORIGINAL prime ORIGINAL running factorial product48 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 boundary ORIGINAL prime ORIGINAL running factorial product47 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 boundary ORIGINAL prime ORIGINAL running factorial product46 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 boundary ORIGINAL prime ORIGINAL running factorial product45 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 boundary ORIGINAL prime ORIGINAL running factorial product44 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 boundary ORIGINAL prime ORIGINAL running factorial product43 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 boundary ORIGINAL prime ORIGINAL running factorial product42 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 boundary ORIGINAL prime ORIGINAL running factorial product41 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 boundary ORIGINAL prime ORIGINAL running factorial product40 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 boundary ORIGINAL prime ORIGINAL running factorial product39 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 boundary ORIGINAL prime ORIGINAL running factorial product38 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 boundary ORIGINAL prime ORIGINAL running factorial product37 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 boundary ORIGINAL prime ORIGINAL running factorial product36 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 boundary ORIGINAL prime ORIGINAL running factorial product35 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 boundary ORIGINAL prime ORIGINAL running factorial product34 with exact rational arithmetic, not rounded decimals.
  • S067 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S066 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product33 with exact rational arithmetic, not rounded decimals.
  • S065 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S064 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product32 with exact rational arithmetic, not rounded decimals.
  • S063 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S062 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product31 with exact rational arithmetic, not rounded decimals.
  • S061 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S060 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product30 with exact rational arithmetic, not rounded decimals.
  • S059 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S058 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product29 with exact rational arithmetic, not rounded decimals.
  • S057 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S056 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product28 with exact rational arithmetic, not rounded decimals.
  • S055 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S054 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product27 with exact rational arithmetic, not rounded decimals.
  • S053 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S052 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product26 with exact rational arithmetic, not rounded decimals.
  • S051 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S050 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product25 with exact rational arithmetic, not rounded decimals.
  • S049 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S048 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product24 with exact rational arithmetic, not rounded decimals.
  • S047 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
  • S046 · premise_and_result_audit — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product23 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product22 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product21 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product20 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product19 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product18 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product17 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product16 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product15 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product14 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product13 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product12 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product11 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product10 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product9 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product8 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product7 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product6 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product5 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product4 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product3 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product2 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Wilson boundary ORIGINAL prime ORIGINAL running factorial product1 with exact rational arithmetic, not rounded decimals.
  • 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

(fermat_confusion, 79, [[1, 1], [2, 2], [3, 6], [4, 24], [5, 41], [6, 9], [7, 63], [8, 30], [9, 33], [10, 14], [11, 75], [12, 31], [13, 8], [14, 33], [15, 21], [16, 20], [17, 24], [18, 37], [19, 71], [20, 77], [21, 37], [22, 24], [23, 78], [24, 55], [25, 32], [26, 42], [27, 28], [28, 73], [29, 63], [30, 73], [31, 51], [32, 52], [33, 57], [34, 42], [35, 48], [36, 69], [37, 25], [38, 2], [39, 78], [40, 39], [41, 19], [42, 8], [43, 28], [44, 47], [45, 61], [46, 41], [47, 31], [48, 66], [49, 74], [50, 66], [51, 48], [52, 47], [53, 42], [54, 56], [55, 78], [56, 23], [57, 47], [58, 40], [59, 69], [60, 32], [61, 56], [62, 75], [63, 64], [64, 67], [65, 10], [66, 28], [67, 59], [68, 62], [69, 12], [70, 50], [71, 74], [72, 35], [73, 27], [74, 23], [75, 66], [76, 39], [77, 1], [78, 78]], 78, 78, Yes, Wilson:(n-1)!==-1_mod_79, Fermat:a^(79-1)==1_mod_79_when_n_does_not_divide_a, No, distinct_theorems_no_Fermat_power_claim_recomputed)

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: 9622639eae2bd4b6f4aa1620782b91f35e6c378422ec2121dcc889cc1a09e875
  • candidate record SHA-256: 56ed5d4cba7fc044a2091f934527b1c3e1193ce2fff48e139edac8c2e5f6900c
  • semantic review receipt SHA-256: 0a76d8e93c08bb16998a0483f3dfc0504f269fc3e1982e6cd868cab0a2856d54
  • question-first witness SHA-256: 09127b736c225714dfa0b7ceb0e6a6e66df27438b480cad8217d3c2f99ce9437
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON