逐步推導
S001 · implies
操作前
source roles = [qf-permutation-exact-count, [k, n, operation]]
操作後
derived = [permutation, no-invented-domain]
條件:無
按本bank核keys與operation/domain:legacy為各表underscore,MOD50用local hyphen;BASE參數較寬不加未知欄限制。Number.isInteger與SAFE兩種來源界分開,原JSON數字表示仍完整保存。
步驟識別與依賴
規則:R67_SOURCE_specific_keys_operation_domain_and_numeric_bank · 依賴:G001
S002 · implies
操作前
source roles = [5, 5]
操作後
derived = [[5, 4, 3, 2, 1], 1]
條件:無
n個不同物件無重複無放回,ordered selection第i位置有n−i+1個選擇。k=0空選取恰1種,乘法從1開始;本bank到n=200,不搬其他bank的32或64界。
步驟識別與依賴
規則:Selection_DISTINCT_no_replacement_order_and_EMPTY_convention · 依賴:G001, S001
S003 · calculation
操作前
Permutation ORIGINAL available choices position1 := mul(1, 5)
操作後
Permutation ORIGINAL available choices position1 = 5
條件:無
依原操作數與原次序精確計算;legacy衍生整數不重套raw SAFE界,MOD50有理數則另保naive pre-reduction來源界。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S002
S004 · calculation
操作前
Permutation ORIGINAL available choices position2 := mul(5, 4)
操作後
Permutation ORIGINAL available choices position2 = 20
條件:無
依原操作數與原次序精確計算;legacy衍生整數不重套raw SAFE界,MOD50有理數則另保naive pre-reduction來源界。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S003
S005 · calculation
操作前
Permutation ORIGINAL available choices position3 := mul(20, 3)
操作後
Permutation ORIGINAL available choices position3 = 60
條件:無
依原操作數與原次序精確計算;legacy衍生整數不重套raw SAFE界,MOD50有理數則另保naive pre-reduction來源界。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S004
S006 · calculation
操作前
Permutation ORIGINAL available choices position4 := mul(60, 2)
操作後
Permutation ORIGINAL available choices position4 = 120
條件:無
依原操作數與原次序精確計算;legacy衍生整數不重套raw SAFE界,MOD50有理數則另保naive pre-reduction來源界。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S005
S007 · calculation
操作前
Permutation ORIGINAL available choices position5 := mul(120, 1)
操作後
Permutation ORIGINAL available choices position5 = 120
條件:無
依原操作數與原次序精確計算;legacy衍生整數不重套raw SAFE界,MOD50有理數則另保naive pre-reduction來源界。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S006
S008 · implies
操作前
source roles = [5, 5]
操作後
derived = [120]
條件:無
依乘法原理相乘全部k個位置的選擇數,得到P(n,k)=n!/(n−k)!。這是個數非機率,空乘積1且衍生BigInt不截SAFE。
步驟識別與依賴
規則:Selection_ALL_ordered_choices_falling_product · 依賴:G001, S007