# Question 27762: Wilson Congruence and Primality Agree at the Specified Modulus [Return to catalogue page 139](https://ocme.evemisslab.com/en/questions/page/139/) [← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261015-advance-20261118-r04-wilson-theorem-foundations/#q-20261015-advance-20261118-r04-wilson-theorem-0012) This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth. R0054-27762 · q-20261015-advance-20261118-r04-wilson-theorem-0012 ## Original question and givens Use exact integer n=13>1. Give (n, prime, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, instance_equivalence, instance_scope). - G001 — Use exact integer n=13>1. Give (n, prime, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, instance_equivalence, instance_scope). ## 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. - [mko-wilson-theorem](https://ocme.evemisslab.com/en/mko/mko-wilson-theorem/) ## Step-by-step derivation S001 · impliesBefore 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. Step identifiers and dependenciesRule: source_ordered_fields_without_JS · Uses: G001 S002 · calculationBefore 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. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S001 S003 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 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 dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S002 S004 · calculationBefore 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. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S003 S005 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 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 dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S004 S006 · calculationBefore 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. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S005 S007 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 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 dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S006 S008 · calculationBefore 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. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S007 S009 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 4, 6, 24] After derived = [1, 11, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S008 S010 · calculationBefore Wilson ORIGINAL factorial ORIGINAL running factorial product5 := mul(11, 5) After Wilson ORIGINAL factorial ORIGINAL running factorial product5 = 55 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S009 S011 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 5, 11, 55] After derived = [4, 3, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S010 S012 · calculationBefore Wilson ORIGINAL factorial ORIGINAL running factorial product6 := mul(3, 6) After Wilson ORIGINAL factorial ORIGINAL running factorial product6 = 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. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S011 S013 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 6, 3, 18] 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. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S012 S014 · calculationBefore Wilson ORIGINAL factorial ORIGINAL running factorial product7 := mul(5, 7) After Wilson ORIGINAL factorial ORIGINAL running factorial product7 = 35 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S013 S015 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 7, 5, 35] After derived = [2, 9, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S014 S016 · calculationBefore Wilson ORIGINAL factorial ORIGINAL running factorial product8 := mul(9, 8) After Wilson ORIGINAL factorial ORIGINAL running factorial product8 = 72 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S015 S017 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 8, 9, 72] After derived = [5, 7, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S016 S018 · calculationBefore Wilson ORIGINAL factorial ORIGINAL running factorial product9 := mul(7, 9) After Wilson ORIGINAL factorial ORIGINAL running factorial product9 = 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S017 S019 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 9, 7, 63] After derived = [4, 11, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S018 S020 · calculationBefore Wilson ORIGINAL factorial ORIGINAL running factorial product10 := mul(11, 10) After Wilson ORIGINAL factorial ORIGINAL running factorial product10 = 110 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S019 S021 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 10, 11, 110] After derived = [8, 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 dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S020 S022 · calculationBefore Wilson ORIGINAL factorial ORIGINAL running factorial product11 := mul(6, 11) After Wilson ORIGINAL factorial ORIGINAL running factorial product11 = 66 Conditions: none Substitute original roles and established intermediates exactly,not approximations or internally consistent changed operands;extra teaching algebra adds no source-domain gate. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S021 S023 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 11, 6, 66] After derived = [5, 1, Yes, Yes] Conditions: none Retain the prior residue and full product at every k,then its unique Euclidean remainder in0..n-1.The invariant is value congruent to k! mod n,not an assumed last table entry. Step identifiers and dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S022 S024 · calculationBefore Wilson ORIGINAL factorial ORIGINAL running factorial product12 := mul(1, 12) After Wilson ORIGINAL factorial ORIGINAL running factorial product12 = 12 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 dependenciesRule: exact_rational_arithmetic · Uses: G001, S023 S025 · impliesBefore source roles = [Wilson ORIGINAL factorial, 13, 12, 1, 12] After derived = [0, 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 dependenciesRule: Wilson_EACH_running_factorial_exact_Euclidean_remainder · Uses: G001, S024 S026 · impliesBefore source roles = [13, [[1, 1], [2, 2], [3, 6], [4, 11], [5, 3], [6, 5], [7, 9], [8, 7], [9, 11], [10, 6], [11, 1], [12, 12]]] After derived = [Yes, 12, 12, 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. Step identifiers and dependenciesRule: Wilson_prime_classification_instance_flags_AND_separate_converse_reason · Uses: G001, S025 ## Reverse checks - S026 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S025 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct. - S024 · premise_and_result_audit — 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. ## Result (13, Yes, [[1, 1], [2, 2], [3, 6], [4, 11], [5, 3], [6, 5], [7, 9], [8, 7], [9, 11], [10, 6], [11, 1], [12, 12]], 12, 12, Yes, Yes, Wilson_equivalence_instance) 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: 80b54085d9b4a1127621d67b6e5566eab176276390effe1bbeb6cb79651d955d - candidate record SHA-256: c0047e71273472bc89259486dbc64f99c9c14647bb63d1fae733e5ddf6b8a105 - semantic review receipt SHA-256: 0a76d8e93c08bb16998a0483f3dfc0504f269fc3e1982e6cd868cab0a2856d54 - question-first witness SHA-256: 09127b736c225714dfa0b7ceb0e6a6e66df27438b480cad8217d3c2f99ce9437 - Lean: NOT_RUN · human review: NOT_PERFORMED [Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261015-advance-20261118-r04-wilson-theorem-0012.json)