Explore related knowledge and questions →
← Question derivation index · Original question batch
R0054-27768 · q-20261015-advance-20261118-r04-wilson-theorem-0018
Use exact integer n=19>1. Give (n, prime, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, instance_equivalence, instance_scope).
G001 — Use exact integer n=19>1. Give (n, prime, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, instance_equivalence, instance_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.
Before
source roles = [wilson-domain-factorial]
After
derived = [[n, prime, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, instance_equivalence, instance_scope]]
Conditions: none
List the complete operation/mode field order without JavaScript or answer-shape inference;Boolean,string,null and an unclaimed result remain distinct.
Rule: source_ordered_fields_without_JS · Uses: G001
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product1 := mul(1, 1)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product1 = 1
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S001
Before
source roles = [Wilson ORIGINAL factorial, 19, 1, 1, 1]
After
derived = [0, 1, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S002
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product2 := mul(1, 2)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product2 = 2
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S003
Before
source roles = [Wilson ORIGINAL factorial, 19, 2, 1, 2]
After
derived = [0, 2, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S004
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product3 := mul(2, 3)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product3 = 6
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S005
Before
source roles = [Wilson ORIGINAL factorial, 19, 3, 2, 6]
After
derived = [0, 6, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S006
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product4 := mul(6, 4)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product4 = 24
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S007
Before
source roles = [Wilson ORIGINAL factorial, 19, 4, 6, 24]
After
derived = [1, 5, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S008
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product5 := mul(5, 5)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product5 = 25
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S009
Before
source roles = [Wilson ORIGINAL factorial, 19, 5, 5, 25]
After
derived = [1, 6, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S010
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product6 := mul(6, 6)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product6 = 36
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S011
Before
source roles = [Wilson ORIGINAL factorial, 19, 6, 6, 36]
After
derived = [1, 17, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S012
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product7 := mul(17, 7)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product7 = 119
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S013
Before
source roles = [Wilson ORIGINAL factorial, 19, 7, 17, 119]
After
derived = [6, 5, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S014
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product8 := mul(5, 8)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product8 = 40
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S015
Before
source roles = [Wilson ORIGINAL factorial, 19, 8, 5, 40]
After
derived = [2, 2, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S016
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product9 := mul(2, 9)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product9 = 18
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S017
Before
source roles = [Wilson ORIGINAL factorial, 19, 9, 2, 18]
After
derived = [0, 18, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S018
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product10 := mul(18, 10)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product10 = 180
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S019
Before
source roles = [Wilson ORIGINAL factorial, 19, 10, 18, 180]
After
derived = [9, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S020
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product11 := mul(9, 11)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product11 = 99
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S021
Before
source roles = [Wilson ORIGINAL factorial, 19, 11, 9, 99]
After
derived = [5, 4, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S022
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product12 := mul(4, 12)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product12 = 48
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S023
Before
source roles = [Wilson ORIGINAL factorial, 19, 12, 4, 48]
After
derived = [2, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S024
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product13 := mul(10, 13)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product13 = 130
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S025
Before
source roles = [Wilson ORIGINAL factorial, 19, 13, 10, 130]
After
derived = [6, 16, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S026
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product14 := mul(16, 14)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product14 = 224
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S027
Before
source roles = [Wilson ORIGINAL factorial, 19, 14, 16, 224]
After
derived = [11, 15, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S028
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product15 := mul(15, 15)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product15 = 225
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S029
Before
source roles = [Wilson ORIGINAL factorial, 19, 15, 15, 225]
After
derived = [11, 16, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S030
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product16 := mul(16, 16)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product16 = 256
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S031
Before
source roles = [Wilson ORIGINAL factorial, 19, 16, 16, 256]
After
derived = [13, 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.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S032
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product17 := mul(9, 17)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product17 = 153
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S033
Before
source roles = [Wilson ORIGINAL factorial, 19, 17, 9, 153]
After
derived = [8, 1, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S034
Before
Wilson ORIGINAL factorial ORIGINAL running factorial product18 := mul(1, 18)
After
Wilson ORIGINAL factorial ORIGINAL running factorial product18 = 18
Conditions: none
Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate.
Rule: exact_rational_arithmetic · Uses: G001, S035
Before
source roles = [Wilson ORIGINAL factorial, 19, 18, 1, 18]
After
derived = [0, 18, Yes, Yes]
Conditions: none
Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry.
Rule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S036
Before
source roles = [19, [[1, 1], [2, 2], [3, 6], [4, 5], [5, 6], [6, 17], [7, 5], [8, 2], [9, 18], [10, 9], [11, 4], [12, 10], [13, 16], [14, 15], [15, 16], [16, 9], [17, 1], [18, 18]]]
After
derived = [Yes, 18, 18, Yes, Yes]
Conditions: none
Qualify primality and congruence separately.Both may be False at a composite while equivalence is True.The converse has a separate argument:a proper divisor d>=2 of composite n divides both n and(n-1)!;a congruence to-1 would force d to divide1,a contradiction.This reasoning is not a single instance or finite-cutoff test.
Rule: Wilson_prime_classification_instance_flags_AND_separate_converse_reason · Uses: G001, S037
S038 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S037 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.S036 · premise_and_result_audit — Recompute Wilson ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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 ORIGINAL factorial 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.(19, Yes, [[1, 1], [2, 2], [3, 6], [4, 5], [5, 6], [6, 17], [7, 5], [8, 2], [9, 18], [10, 9], [11, 4], [12, 10], [13, 16], [14, 15], [15, 16], [16, 9], [17, 1], [18, 18]], 18, 18, Yes, Yes, Wilson_equivalence_instance)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.
input commit: 0f7be61e2c22317a4075561dc822c87d881a50dboriginal question SHA-256: 49fa61366e75e171893924b7b6cf45aac6dbcc42d78671570822b4afa01ec2bbcandidate record SHA-256: fe2c3788aeefb7b0efbdc7bdb4c9fd19db689a3ee36e79183eb3138c96861434semantic review receipt SHA-256: 0a76d8e93c08bb16998a0483f3dfc0504f269fc3e1982e6cd868cab0a2856d54question-first witness SHA-256: 09127b736c225714dfa0b7ceb0e6a6e66df27438b480cad8217d3c2f99ce9437Lean: NOT_RUN · human review: NOT_PERFORMED