逐步推導
S001 · implies
操作前
source roles = [wilson-prime-inverse-pairing]
操作後
derived = [[p, all_inverse_pairs, self_inverse_residues, distinct_cancelling_pairs, self_inverse_scope, factorial_residue, Wilson_congruence]]
條件:無
直接明列此操作與mode完整欄序,不依JavaScript、不由答案形狀猜角色;布林、字串、null與未作聲稱保持不同。
步驟識別與依賴
規則:source_ordered_fields_without_JS · 依賴:G001
S002 · implies
操作前
source roles = [23, 1]
操作後
derived = [1, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S001
S003 · implies
操作前
source roles = [23, 2]
操作後
derived = [12, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S002
S004 · implies
操作前
source roles = [23, 3]
操作後
derived = [8, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S003
S005 · implies
操作前
source roles = [23, 4]
操作後
derived = [6, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S004
S006 · implies
操作前
source roles = [23, 5]
操作後
derived = [14, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S005
S007 · implies
操作前
source roles = [23, 6]
操作後
derived = [4, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S006
S008 · implies
操作前
source roles = [23, 7]
操作後
derived = [10, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S007
S009 · implies
操作前
source roles = [23, 8]
操作後
derived = [3, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S008
S010 · implies
操作前
source roles = [23, 9]
操作後
derived = [18, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S009
S011 · implies
操作前
source roles = [23, 10]
操作後
derived = [7, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S010
S012 · implies
操作前
source roles = [23, 11]
操作後
derived = [21, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S011
S013 · implies
操作前
source roles = [23, 12]
操作後
derived = [2, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S012
S014 · implies
操作前
source roles = [23, 13]
操作後
derived = [16, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S013
S015 · implies
操作前
source roles = [23, 14]
操作後
derived = [5, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S014
S016 · implies
操作前
source roles = [23, 15]
操作後
derived = [20, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S015
S017 · implies
操作前
source roles = [23, 16]
操作後
derived = [13, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S016
S018 · implies
操作前
source roles = [23, 17]
操作後
derived = [19, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S017
S019 · implies
操作前
source roles = [23, 18]
操作後
derived = [9, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S018
S020 · implies
操作前
source roles = [23, 19]
操作後
derived = [17, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S019
S021 · implies
操作前
source roles = [23, 20]
操作後
derived = [15, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S020
S022 · implies
操作前
source roles = [23, 21]
操作後
derived = [11, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S021
S023 · implies
操作前
source roles = [23, 22]
操作後
derived = [22, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S022
S024 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product1 := mul(1, 1)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product1 = 1
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S023
S025 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 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, S024
S026 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product2 := mul(1, 2)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product2 = 2
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S025
S027 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 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, S026
S028 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product3 := mul(2, 3)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product3 = 6
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S027
S029 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 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, S028
S030 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product4 := mul(6, 4)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product4 = 24
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S029
S031 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 4, 6, 24]
操作後
derived = [1, 1, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S030
S032 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product5 := mul(1, 5)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product5 = 5
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S031
S033 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 5, 1, 5]
操作後
derived = [0, 5, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S032
S034 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 := mul(5, 6)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 30
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S033
S035 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 6, 5, 30]
操作後
derived = [1, 7, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S034
S036 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 := mul(7, 7)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 49
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S035
S037 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 7, 7, 49]
操作後
derived = [2, 3, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S036
S038 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 := mul(3, 8)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 24
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S037
S039 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 8, 3, 24]
操作後
derived = [1, 1, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S038
S040 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 := mul(1, 9)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 9
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S039
S041 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 9, 1, 9]
操作後
derived = [0, 9, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S040
S042 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 := mul(9, 10)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 90
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S041
S043 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 10, 9, 90]
操作後
derived = [3, 21, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S042
S044 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 := mul(21, 11)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 231
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S043
S045 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 11, 21, 231]
操作後
derived = [10, 1, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S044
S046 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 := mul(1, 12)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 12
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S045
S047 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 12, 1, 12]
操作後
derived = [0, 12, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S046
S048 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 := mul(12, 13)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 156
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S047
S049 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 13, 12, 156]
操作後
derived = [6, 18, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S048
S050 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 := mul(18, 14)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 252
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S049
S051 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 14, 18, 252]
操作後
derived = [10, 22, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S050
S052 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 := mul(22, 15)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 = 330
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S051
S053 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 15, 22, 330]
操作後
derived = [14, 8, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S052
S054 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 := mul(8, 16)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 128
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S053
S055 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 16, 8, 128]
操作後
derived = [5, 13, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S054
S056 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(13, 17)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 221
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S055
S057 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 17, 13, 221]
操作後
derived = [9, 14, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S056
S058 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 := mul(14, 18)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 252
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S057
S059 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 18, 14, 252]
操作後
derived = [10, 22, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S058
S060 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 := mul(22, 19)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 = 418
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S059
S061 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 19, 22, 418]
操作後
derived = [18, 4, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S060
S062 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(4, 20)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 80
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S061
S063 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 20, 4, 80]
操作後
derived = [3, 11, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S062
S064 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(11, 21)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 231
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S063
S065 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 21, 11, 231]
操作後
derived = [10, 1, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S064
S066 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 := mul(1, 22)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 = 22
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S065
S067 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 23, 22, 1, 22]
操作後
derived = [0, 22, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S066
S068 · implies
操作前
source roles = [23, [[1, 1], [2, 12], [3, 8], [4, 6], [5, 14], [6, 4], [7, 10], [8, 3], [9, 18], [10, 7], [11, 21], [12, 2], [13, 16], [14, 5], [15, 20], [16, 13], [17, 19], [18, 9], [19, 17], [20, 15], [21, 11], [22, 22]]]
操作後
derived = [[1, 22], [[2, 12, 1], [3, 8, 1], [4, 6, 1], [5, 14, 1], [7, 10, 1], [9, 18, 1], [11, 21, 1], [13, 16, 1], [15, 20, 1], [17, 19, 1]], 22, 是]
條件:無
非self-inverse成對相乘1;self-inverse解(r-1)(r+1)=0 mod prime,故只±1。p>2相異乘積-1;p2僅1=-1一個。這是一般教學理由,有限表/本程式不冒稱Lean proof。
步驟識別與依賴
規則:Wilson_GENERAL_inverse_pairing_and_p2_exception · 依賴:G001, S067
結論
(23, [[1, 1], [2, 12], [3, 8], [4, 6], [5, 14], [6, 4], [7, 10], [8, 3], [9, 18], [10, 7], [11, 21], [12, 2], [13, 16], [14, 5], [15, 20], [16, 13], [17, 19], [18, 9], [19, 17], [20, 15], [21, 11], [22, 22]], [1, 22], [[2, 12, 1], [3, 8, 1], [4, 6, 1], [5, 14, 1], [7, 10, 1], [9, 18, 1], [11, 21, 1], [13, 16, 1], [15, 20, 1], [17, 19, 1]], self_inverse_residues_1_and_p_minus_1, 22, 是)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。