逐步推導
S001 · implies
操作前
source roles = [qf-mod47-morder-qualification, [a, domain, n, operation]]
操作後
derived = [morder-qualification, Exact_multiplicative_order_mod_n]
條件:無
原bank的operation是LOCAL hyphen,keys與domain各自精確匹配。欄位順序及數字/Boolean/字串角色依來源,所有有理數文字整數省略/1;不改原題與英文、MKO、AST或狀態。
步驟識別與依賴
規則:R66_EXACT_source_bank_keys_local_operation_domain · 依賴:G001
S002 · implies
操作前
source roles = [ORIGINAL representative, 3, 26]
操作後
derived = [0, 3]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S001
S003 · implies
操作前
source roles = [26, 3, 3, 1]
操作後
derived = [[1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25], 12]
條件:無
先n≥2,正規化到0..n−1並驗gcd=1;完整列所有與n互質的residue得phi(n),不可拿n−1代替一般phi,也不把nonunit定義為某個數值階。
步驟識別與依賴
規則:Order_ALL_residues_UNIT_gcd_and_complete_phi_carrier · 依賴:G001, S002
S004 · calculation
操作前
Order ORIGINAL previous residue times unit exponent1 := mul(1, 3)
操作後
Order ORIGINAL previous residue times unit exponent1 = 3
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S003
S005 · implies
操作前
source roles = [first-return exponent1, 3, 26]
操作後
derived = [0, 3]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S004
S006 · calculation
操作前
Order ORIGINAL previous residue times unit exponent2 := mul(3, 3)
操作後
Order ORIGINAL previous residue times unit exponent2 = 9
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S005
S007 · implies
操作前
source roles = [first-return exponent2, 9, 26]
操作後
derived = [0, 9]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S006
S008 · calculation
操作前
Order ORIGINAL previous residue times unit exponent3 := mul(9, 3)
操作後
Order ORIGINAL previous residue times unit exponent3 = 27
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S007
S009 · implies
操作前
source roles = [first-return exponent3, 27, 26]
操作後
derived = [1, 1]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S008
S010 · implies
操作前
source roles = [26, 3, 12]
操作後
derived = [[[1, 3], [2, 9], [3, 1]], 3]
條件:無
來源即使qualification只輸出gcd/phi,也先計first-return完整prefix;保留此unused計算責任。從正指數1開始且之前不回1;不宣稱階必等phi或primitive root/加法階。
步驟識別與依賴
規則:Order_SOURCE_UNUSED_qualification_return_table_still_checked · 依賴:G001, S009
結論
(26, 3, 3, 1, 12, 是, unit_mod_n_qualified)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。