逐步推導
S001 · implies
操作前
source roles = [qf-mod31-fielddeep-power-cycle, [domain, element, operation, p]]
操作後
derived = [fielddeep-power-cycle, Exact_prime_field_Zp]
條件:無
原bank的operation是LOCAL hyphen,keys與domain各自精確匹配。欄位順序及數字/Boolean/字串角色依來源,所有有理數文字整數省略/1;不改原題與英文、MKO、AST或狀態。
步驟識別與依賴
規則:R66_EXACT_source_bank_keys_local_operation_domain · 依賴:G001
S002 · implies
操作前
source roles = [7, [2]]
操作後
derived = [[1], 是]
條件:無
完整試除2到floor(sqrt(p))無因數;若p合成必有其中因數。2也合法。只限定本題Z_p,不把一般有限域都說成prime order或把有限環都說成域。
步驟識別與依賴
規則:Field_PRIME_complete_trial_divisor_qualification · 依賴:G001, S001
S003 · calculation
操作前
Field ORIGINAL previous power times element k=1 := mul(1, 4)
操作後
Field ORIGINAL previous power times element k=1 = 4
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S002
S004 · implies
操作前
source roles = [power exponent1, 4, 7]
操作後
derived = [0, 4]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S003
S005 · calculation
操作前
Field ORIGINAL previous power times element k=2 := mul(4, 4)
操作後
Field ORIGINAL previous power times element k=2 = 16
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S004
S006 · implies
操作前
source roles = [power exponent2, 16, 7]
操作後
derived = [2, 2]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S005
S007 · calculation
操作前
Field ORIGINAL previous power times element k=3 := mul(2, 4)
操作後
Field ORIGINAL previous power times element k=3 = 8
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S006
S008 · implies
操作前
source roles = [power exponent3, 8, 7]
操作後
derived = [1, 1]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S007
S009 · calculation
操作前
Field ORIGINAL previous power times element k=4 := mul(1, 4)
操作後
Field ORIGINAL previous power times element k=4 = 4
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S008
S010 · implies
操作前
source roles = [power exponent4, 4, 7]
操作後
derived = [0, 4]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S009
S011 · calculation
操作前
Field ORIGINAL previous power times element k=5 := mul(4, 4)
操作後
Field ORIGINAL previous power times element k=5 = 16
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S010
S012 · implies
操作前
source roles = [power exponent5, 16, 7]
操作後
derived = [2, 2]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S011
S013 · calculation
操作前
Field ORIGINAL previous power times element k=6 := mul(2, 4)
操作後
Field ORIGINAL previous power times element k=6 = 8
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S012
S014 · implies
操作前
source roles = [power exponent6, 8, 7]
操作後
derived = [1, 1]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S013
S015 · implies
操作前
source roles = [7, 4, [4, 2, 1, 4, 2, 1]]
操作後
derived = [1, 是]
條件:無
列全部1..p−1次方,最後為1。非零residue形成乘法群,但此等式不說元素的最小正階恰為p−1,也不認證primitive root。
步驟識別與依賴
規則:Field_NONZERO_p_minus_1_power_identity_NOT_exact_order · 依賴:G001, S014
結論
(4, [4, 2, 1, 4, 2, 1], 1, 是, nonzero_multiplicative_group_cycle)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。