原題與已知條件
完整prime field Z_p運算。操作=fielddeep-affine-solve;資料={"p":5,"a":3,"b":3,"c":0}。請依 [a,b,c,inverse,solution,substitution,unique] 欄序回答。
G001 — 完整prime field Z_p運算。操作=fielddeep-affine-solve;資料={"p":5,"a":3,"b":3,"c":0}。請依 [a,b,c,inverse,solution,substitution,unique] 欄序回答。
逐步推導
S001 · implies
操作前
source roles = [qf-mod31-fielddeep-affine-solve, [a, b, c, domain, operation, p]]
操作後
derived = [fielddeep-affine-solve, 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 = [5, [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 a times proposed inverse := mul(3, 2)
操作後
Field ORIGINAL a times proposed inverse = 6
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S002
S004 · implies
操作前
source roles = [inverse substitution, 6, 5]
操作後
derived = [1, 1]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S003
S005 · calculation
操作前
Field ORIGINAL c minus b := sub(0, 3)
操作後
Field ORIGINAL c minus b = -3
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S004
S006 · calculation
操作前
Field ORIGINAL inverse times c minus b := mul(2, -3)
操作後
Field ORIGINAL inverse times c minus b = -6
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S005
S007 · implies
操作前
source roles = [affine solution, -6, 5]
操作後
derived = [-2, 4]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S006
S008 · calculation
操作前
Field ORIGINAL a times solution := mul(3, 4)
操作後
Field ORIGINAL a times solution = 12
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S007
S009 · calculation
操作前
Field ORIGINAL a solution plus b := sum(12, 3)
操作後
Field ORIGINAL a solution plus b = 15
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S008
S010 · implies
操作前
source roles = [equation substitution, 15, 5]
操作後
derived = [3, 0]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S009
S011 · implies
操作前
source roles = [5, 3, 3, 0, 2]
操作後
derived = [4, 0, 是]
條件:無
p為prime且a非0故可逆;先減b再乘inverse,代回同一模p等式。若兩解x,z,a(x−z)=0,乘inverse得x=z,故唯一;不除以0。
步驟識別與依賴
規則:Field_INVERT_nonzero_coefficient_and_UNIQUENESS · 依賴:G001, S010