逐步推導
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 = [37, 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 = [37, 2]
操作後
derived = [19, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S002
S004 · implies
操作前
source roles = [37, 3]
操作後
derived = [25, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S003
S005 · implies
操作前
source roles = [37, 4]
操作後
derived = [28, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S004
S006 · implies
操作前
source roles = [37, 5]
操作後
derived = [15, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S005
S007 · implies
操作前
source roles = [37, 6]
操作後
derived = [31, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S006
S008 · implies
操作前
source roles = [37, 7]
操作後
derived = [16, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S007
S009 · implies
操作前
source roles = [37, 8]
操作後
derived = [14, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S008
S010 · implies
操作前
source roles = [37, 9]
操作後
derived = [33, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S009
S011 · implies
操作前
source roles = [37, 10]
操作後
derived = [26, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S010
S012 · implies
操作前
source roles = [37, 11]
操作後
derived = [27, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S011
S013 · implies
操作前
source roles = [37, 12]
操作後
derived = [34, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S012
S014 · implies
操作前
source roles = [37, 13]
操作後
derived = [20, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S013
S015 · implies
操作前
source roles = [37, 14]
操作後
derived = [8, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S014
S016 · implies
操作前
source roles = [37, 15]
操作後
derived = [5, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S015
S017 · implies
操作前
source roles = [37, 16]
操作後
derived = [7, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S016
S018 · implies
操作前
source roles = [37, 17]
操作後
derived = [24, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S017
S019 · implies
操作前
source roles = [37, 18]
操作後
derived = [35, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S018
S020 · implies
操作前
source roles = [37, 19]
操作後
derived = [2, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S019
S021 · implies
操作前
source roles = [37, 20]
操作後
derived = [13, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S020
S022 · implies
操作前
source roles = [37, 21]
操作後
derived = [30, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S021
S023 · implies
操作前
source roles = [37, 22]
操作後
derived = [32, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S022
S024 · implies
操作前
source roles = [37, 23]
操作後
derived = [29, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S023
S025 · implies
操作前
source roles = [37, 24]
操作後
derived = [17, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S024
S026 · implies
操作前
source roles = [37, 25]
操作後
derived = [3, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S025
S027 · implies
操作前
source roles = [37, 26]
操作後
derived = [10, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S026
S028 · implies
操作前
source roles = [37, 27]
操作後
derived = [11, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S027
S029 · implies
操作前
source roles = [37, 28]
操作後
derived = [4, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S028
S030 · implies
操作前
source roles = [37, 29]
操作後
derived = [23, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S029
S031 · implies
操作前
source roles = [37, 30]
操作後
derived = [21, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S030
S032 · implies
操作前
source roles = [37, 31]
操作後
derived = [6, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S031
S033 · implies
操作前
source roles = [37, 32]
操作後
derived = [22, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S032
S034 · implies
操作前
source roles = [37, 33]
操作後
derived = [9, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S033
S035 · implies
操作前
source roles = [37, 34]
操作後
derived = [12, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S034
S036 · implies
操作前
source roles = [37, 35]
操作後
derived = [18, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S035
S037 · implies
操作前
source roles = [37, 36]
操作後
derived = [36, 1]
條件:無
prime modulus的非零residue均為units,逐a找來源首inverse;若有兩個inverse,乘a的消去性使其相同。
步驟識別與依賴
規則:Wilson_EVERY_nonzero_prime_residue_unique_inverse · 依賴:G001, S036
S038 · 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, S037
S039 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 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, S038
S040 · 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, S039
S041 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 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, S040
S042 · 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, S041
S043 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 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, S042
S044 · 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, S043
S045 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 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, S044
S046 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product5 := mul(24, 5)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product5 = 120
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S045
S047 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 5, 24, 120]
操作後
derived = [3, 9, 是, 是]
條件:無
逐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 product6 := mul(9, 6)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product6 = 54
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S047
S049 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 6, 9, 54]
操作後
derived = [1, 17, 是, 是]
條件:無
逐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 product7 := mul(17, 7)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product7 = 119
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S049
S051 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 7, 17, 119]
操作後
derived = [3, 8, 是, 是]
條件:無
逐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 product8 := mul(8, 8)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product8 = 64
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S051
S053 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 8, 8, 64]
操作後
derived = [1, 27, 是, 是]
條件:無
逐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 product9 := mul(27, 9)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product9 = 243
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S053
S055 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 9, 27, 243]
操作後
derived = [6, 21, 是, 是]
條件:無
逐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 product10 := mul(21, 10)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product10 = 210
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S055
S057 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 10, 21, 210]
操作後
derived = [5, 25, 是, 是]
條件:無
逐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 product11 := mul(25, 11)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product11 = 275
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S057
S059 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 11, 25, 275]
操作後
derived = [7, 16, 是, 是]
條件:無
逐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 product12 := mul(16, 12)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product12 = 192
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S059
S061 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 12, 16, 192]
操作後
derived = [5, 7, 是, 是]
條件:無
逐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 product13 := mul(7, 13)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product13 = 91
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S061
S063 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 13, 7, 91]
操作後
derived = [2, 17, 是, 是]
條件:無
逐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 product14 := mul(17, 14)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product14 = 238
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S063
S065 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 14, 17, 238]
操作後
derived = [6, 16, 是, 是]
條件:無
逐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 product15 := mul(16, 15)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product15 = 240
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S065
S067 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 15, 16, 240]
操作後
derived = [6, 18, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S066
S068 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 := mul(18, 16)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product16 = 288
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S067
S069 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 16, 18, 288]
操作後
derived = [7, 29, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S068
S070 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 := mul(29, 17)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product17 = 493
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S069
S071 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 17, 29, 493]
操作後
derived = [13, 12, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S070
S072 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 := mul(12, 18)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product18 = 216
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S071
S073 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 18, 12, 216]
操作後
derived = [5, 31, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S072
S074 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 := mul(31, 19)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product19 = 589
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S073
S075 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 19, 31, 589]
操作後
derived = [15, 34, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S074
S076 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 := mul(34, 20)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product20 = 680
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S075
S077 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 20, 34, 680]
操作後
derived = [18, 14, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S076
S078 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 := mul(14, 21)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product21 = 294
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S077
S079 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 21, 14, 294]
操作後
derived = [7, 35, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S078
S080 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 := mul(35, 22)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product22 = 770
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S079
S081 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 22, 35, 770]
操作後
derived = [20, 30, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S080
S082 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 := mul(30, 23)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product23 = 690
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S081
S083 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 23, 30, 690]
操作後
derived = [18, 24, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S082
S084 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 := mul(24, 24)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product24 = 576
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S083
S085 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 24, 24, 576]
操作後
derived = [15, 21, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S084
S086 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 := mul(21, 25)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product25 = 525
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S085
S087 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 25, 21, 525]
操作後
derived = [14, 7, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S086
S088 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 := mul(7, 26)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product26 = 182
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S087
S089 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 26, 7, 182]
操作後
derived = [4, 34, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S088
S090 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 := mul(34, 27)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product27 = 918
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S089
S091 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 27, 34, 918]
操作後
derived = [24, 30, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S090
S092 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 := mul(30, 28)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product28 = 840
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S091
S093 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 28, 30, 840]
操作後
derived = [22, 26, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S092
S094 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 := mul(26, 29)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product29 = 754
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S093
S095 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 29, 26, 754]
操作後
derived = [20, 14, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S094
S096 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 := mul(14, 30)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product30 = 420
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S095
S097 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 30, 14, 420]
操作後
derived = [11, 13, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S096
S098 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 := mul(13, 31)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product31 = 403
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S097
S099 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 31, 13, 403]
操作後
derived = [10, 33, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S098
S100 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 := mul(33, 32)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product32 = 1056
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S099
S101 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 32, 33, 1056]
操作後
derived = [28, 20, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S100
S102 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 := mul(20, 33)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product33 = 660
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S101
S103 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 33, 20, 660]
操作後
derived = [17, 31, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S102
S104 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 := mul(31, 34)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product34 = 1054
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S103
S105 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 34, 31, 1054]
操作後
derived = [28, 18, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S104
S106 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 := mul(18, 35)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product35 = 630
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S105
S107 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 35, 18, 630]
操作後
derived = [17, 1, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S106
S108 · calculation
操作前
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 := mul(1, 36)
操作後
Wilson ORIGINAL prime factorial ORIGINAL running factorial product36 = 36
條件:無
以原始角色與已證中間量精確代值,不用近似或自洽但換過的操作數;額外教學代數不另縮來源域。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S107
S109 · implies
操作前
source roles = [Wilson ORIGINAL prime factorial, 37, 36, 1, 36]
操作後
derived = [0, 36, 是, 是]
條件:無
逐k保前residue與完整乘積,再以唯一Euclidean餘數縮回0..n-1;累積不變量是value≡k! mod n,不把table最後一項當未算的假設。
步驟識別與依賴
規則:Wilson_EACH_running_factorial_exact_Euclidean_remainder · 依賴:G001, S108
S110 · implies
操作前
source roles = [37, [[1, 1], [2, 19], [3, 25], [4, 28], [5, 15], [6, 31], [7, 16], [8, 14], [9, 33], [10, 26], [11, 27], [12, 34], [13, 20], [14, 8], [15, 5], [16, 7], [17, 24], [18, 35], [19, 2], [20, 13], [21, 30], [22, 32], [23, 29], [24, 17], [25, 3], [26, 10], [27, 11], [28, 4], [29, 23], [30, 21], [31, 6], [32, 22], [33, 9], [34, 12], [35, 18], [36, 36]]]
操作後
derived = [[1, 36], [[2, 19, 1], [3, 25, 1], [4, 28, 1], [5, 15, 1], [6, 31, 1], [7, 16, 1], [8, 14, 1], [9, 33, 1], [10, 26, 1], [11, 27, 1], [12, 34, 1], [13, 20, 1], [17, 24, 1], [18, 35, 1], [21, 30, 1], [22, 32, 1], [23, 29, 1]], 36, 是]
條件:無
非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, S109
結論
(37, [[1, 1], [2, 19], [3, 25], [4, 28], [5, 15], [6, 31], [7, 16], [8, 14], [9, 33], [10, 26], [11, 27], [12, 34], [13, 20], [14, 8], [15, 5], [16, 7], [17, 24], [18, 35], [19, 2], [20, 13], [21, 30], [22, 32], [23, 29], [24, 17], [25, 3], [26, 10], [27, 11], [28, 4], [29, 23], [30, 21], [31, 6], [32, 22], [33, 9], [34, 12], [35, 18], [36, 36]], [1, 36], [[2, 19, 1], [3, 25, 1], [4, 28, 1], [5, 15, 1], [6, 31, 1], [7, 16, 1], [8, 14, 1], [9, 33, 1], [10, 26, 1], [11, 27, 1], [12, 34, 1], [13, 20, 1], [17, 24, 1], [18, 35, 1], [21, 30, 1], [22, 32, 1], [23, 29, 1]], self_inverse_residues_1_and_p_minus_1, 36, 是)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。