逐步推導
S001 · implies
操作前
source roles = [wilson-boundary]
操作後
derived = [[mode, n, running_factorial_residues, factorial_residue, minus_one_residue, Wilson_congruence, Wilson_statement, Fermat_statement, theorem_identification_claim, boundary]]
條件:無
直接明列此操作與mode完整欄序,不依JavaScript、不由答案形狀猜角色;布林、字串、null與未作聲稱保持不同。
步驟識別與依賴
規則:source_ordered_fields_without_JS · 依賴:G001
S002 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product1 := mul(1, 1)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product1 = 1
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S001
S003 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 1, 1, 1]
操作後
derived = [0, 1, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S002
S004 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product2 := mul(1, 2)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product2 = 2
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S003
S005 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 2, 1, 2]
操作後
derived = [0, 2, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S004
S006 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product3 := mul(2, 3)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product3 = 6
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S005
S007 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 3, 2, 6]
操作後
derived = [0, 6, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S006
S008 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product4 := mul(6, 4)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product4 = 24
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S007
S009 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 4, 6, 24]
操作後
derived = [0, 24, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S008
S010 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product5 := mul(24, 5)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product5 = 120
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S009
S011 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 5, 24, 120]
操作後
derived = [4, 4, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S010
S012 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product6 := mul(4, 6)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product6 = 24
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S011
S013 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 6, 4, 24]
操作後
derived = [0, 24, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S012
S014 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product7 := mul(24, 7)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product7 = 168
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S013
S015 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 7, 24, 168]
操作後
derived = [5, 23, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S014
S016 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product8 := mul(23, 8)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product8 = 184
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S015
S017 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 8, 23, 184]
操作後
derived = [6, 10, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S016
S018 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product9 := mul(10, 9)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product9 = 90
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S017
S019 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 9, 10, 90]
操作後
derived = [3, 3, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S018
S020 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product10 := mul(3, 10)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product10 = 30
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S019
S021 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 10, 3, 30]
操作後
derived = [1, 1, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S020
S022 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product11 := mul(1, 11)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product11 = 11
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S021
S023 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 11, 1, 11]
操作後
derived = [0, 11, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S022
S024 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product12 := mul(11, 12)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product12 = 132
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S023
S025 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 12, 11, 132]
操作後
derived = [4, 16, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S024
S026 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product13 := mul(16, 13)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product13 = 208
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S025
S027 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 13, 16, 208]
操作後
derived = [7, 5, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S026
S028 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product14 := mul(5, 14)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product14 = 70
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S027
S029 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 14, 5, 70]
操作後
derived = [2, 12, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S028
S030 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product15 := mul(12, 15)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product15 = 180
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S029
S031 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 15, 12, 180]
操作後
derived = [6, 6, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S030
S032 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product16 := mul(6, 16)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product16 = 96
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S031
S033 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 16, 6, 96]
操作後
derived = [3, 9, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S032
S034 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product17 := mul(9, 17)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product17 = 153
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S033
S035 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 17, 9, 153]
操作後
derived = [5, 8, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S034
S036 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product18 := mul(8, 18)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product18 = 144
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S035
S037 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 18, 8, 144]
操作後
derived = [4, 28, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S036
S038 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product19 := mul(28, 19)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product19 = 532
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S037
S039 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 19, 28, 532]
操作後
derived = [18, 10, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S038
S040 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product20 := mul(10, 20)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product20 = 200
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S039
S041 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 20, 10, 200]
操作後
derived = [6, 26, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S040
S042 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product21 := mul(26, 21)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product21 = 546
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S041
S043 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 21, 26, 546]
操作後
derived = [18, 24, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S042
S044 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product22 := mul(24, 22)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product22 = 528
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S043
S045 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 22, 24, 528]
操作後
derived = [18, 6, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S044
S046 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product23 := mul(6, 23)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product23 = 138
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S045
S047 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 23, 6, 138]
操作後
derived = [4, 22, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S046
S048 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product24 := mul(22, 24)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product24 = 528
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S047
S049 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 24, 22, 528]
操作後
derived = [18, 6, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S048
S050 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product25 := mul(6, 25)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product25 = 150
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S049
S051 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 25, 6, 150]
操作後
derived = [5, 5, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S050
S052 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product26 := mul(5, 26)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product26 = 130
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S051
S053 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 26, 5, 130]
操作後
derived = [4, 14, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S052
S054 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product27 := mul(14, 27)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product27 = 378
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S053
S055 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 27, 14, 378]
操作後
derived = [13, 1, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S054
S056 · calculation
操作前
Wilson boundary ORIGINAL prime ORIGINAL running factorial product28 := mul(1, 28)
操作後
Wilson boundary ORIGINAL prime ORIGINAL running factorial product28 = 28
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S055
S057 · implies
操作前
source roles = [Wilson boundary ORIGINAL prime, 29, 28, 1, 28]
操作後
derived = [0, 28, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S056
S058 · implies
操作前
source roles = [29, [[1, 1], [2, 2], [3, 6], [4, 24], [5, 4], [6, 24], [7, 23], [8, 10], [9, 3], [10, 1], [11, 11], [12, 16], [13, 5], [14, 12], [15, 6], [16, 9], [17, 8], [18, 28], [19, 10], [20, 26], [21, 24], [22, 6], [23, 22], [24, 6], [25, 5], [26, 14], [27, 1], [28, 28]], 28]
操作後
derived = [28, 是, 否]
條件:無
Wilson談(n-1)!;Fermat談n不整除a時a^(n-1)。此分支未給a也未重算其冪,不能把named comparison當同一定理或額外數值測試。
步驟識別與依賴
規則:Wilson_and_Fermat_DISTINCT_named_statements_NO_unprovided_a_power · 依賴:G001, S057
結論
(fermat_confusion, 29, [[1, 1], [2, 2], [3, 6], [4, 24], [5, 4], [6, 24], [7, 23], [8, 10], [9, 3], [10, 1], [11, 11], [12, 16], [13, 5], [14, 12], [15, 6], [16, 9], [17, 8], [18, 28], [19, 10], [20, 26], [21, 24], [22, 6], [23, 22], [24, 6], [25, 5], [26, 14], [27, 1], [28, 28]], 28, 28, 是, Wilson:(n-1)!==-1_mod_29, Fermat:a^(29-1)==1_mod_29_when_n_does_not_divide_a, 否, distinct_theorems_no_Fermat_power_claim_recomputed)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。