逐步推導
S001 · implies
操作前
source roles = [qf-mod31-fielddeep-frobenius, [domain, element, operation, p]]
操作後
derived = [fielddeep-frobenius, 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 = [23, [2, 3, 4]]
操作後
derived = [[1, 2, 3], 是]
條件:無
完整試除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, 8)
操作後
Field ORIGINAL previous power times element k=1 = 8
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S002
S004 · implies
操作前
source roles = [power exponent1, 8, 23]
操作後
derived = [0, 8]
條件:無
以整數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(8, 8)
操作後
Field ORIGINAL previous power times element k=2 = 64
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S004
S006 · implies
操作前
source roles = [power exponent2, 64, 23]
操作後
derived = [2, 18]
條件:無
以整數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(18, 8)
操作後
Field ORIGINAL previous power times element k=3 = 144
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S006
S008 · implies
操作前
source roles = [power exponent3, 144, 23]
操作後
derived = [6, 6]
條件:無
以整數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(6, 8)
操作後
Field ORIGINAL previous power times element k=4 = 48
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S008
S010 · implies
操作前
source roles = [power exponent4, 48, 23]
操作後
derived = [2, 2]
條件:無
以整數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(2, 8)
操作後
Field ORIGINAL previous power times element k=5 = 16
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S010
S012 · implies
操作前
source roles = [power exponent5, 16, 23]
操作後
derived = [0, 16]
條件:無
以整數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(16, 8)
操作後
Field ORIGINAL previous power times element k=6 = 128
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S012
S014 · implies
操作前
source roles = [power exponent6, 128, 23]
操作後
derived = [5, 13]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S013
S015 · calculation
操作前
Field ORIGINAL previous power times element k=7 := mul(13, 8)
操作後
Field ORIGINAL previous power times element k=7 = 104
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S014
S016 · implies
操作前
source roles = [power exponent7, 104, 23]
操作後
derived = [4, 12]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S015
S017 · calculation
操作前
Field ORIGINAL previous power times element k=8 := mul(12, 8)
操作後
Field ORIGINAL previous power times element k=8 = 96
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S016
S018 · implies
操作前
source roles = [power exponent8, 96, 23]
操作後
derived = [4, 4]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S017
S019 · calculation
操作前
Field ORIGINAL previous power times element k=9 := mul(4, 8)
操作後
Field ORIGINAL previous power times element k=9 = 32
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S018
S020 · implies
操作前
source roles = [power exponent9, 32, 23]
操作後
derived = [1, 9]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S019
S021 · calculation
操作前
Field ORIGINAL previous power times element k=10 := mul(9, 8)
操作後
Field ORIGINAL previous power times element k=10 = 72
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S020
S022 · implies
操作前
source roles = [power exponent10, 72, 23]
操作後
derived = [3, 3]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S021
S023 · calculation
操作前
Field ORIGINAL previous power times element k=11 := mul(3, 8)
操作後
Field ORIGINAL previous power times element k=11 = 24
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S022
S024 · implies
操作前
source roles = [power exponent11, 24, 23]
操作後
derived = [1, 1]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S023
S025 · calculation
操作前
Field ORIGINAL previous power times element k=12 := mul(1, 8)
操作後
Field ORIGINAL previous power times element k=12 = 8
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S024
S026 · implies
操作前
source roles = [power exponent12, 8, 23]
操作後
derived = [0, 8]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S025
S027 · calculation
操作前
Field ORIGINAL previous power times element k=13 := mul(8, 8)
操作後
Field ORIGINAL previous power times element k=13 = 64
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S026
S028 · implies
操作前
source roles = [power exponent13, 64, 23]
操作後
derived = [2, 18]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S027
S029 · calculation
操作前
Field ORIGINAL previous power times element k=14 := mul(18, 8)
操作後
Field ORIGINAL previous power times element k=14 = 144
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S028
S030 · implies
操作前
source roles = [power exponent14, 144, 23]
操作後
derived = [6, 6]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S029
S031 · calculation
操作前
Field ORIGINAL previous power times element k=15 := mul(6, 8)
操作後
Field ORIGINAL previous power times element k=15 = 48
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S030
S032 · implies
操作前
source roles = [power exponent15, 48, 23]
操作後
derived = [2, 2]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S031
S033 · calculation
操作前
Field ORIGINAL previous power times element k=16 := mul(2, 8)
操作後
Field ORIGINAL previous power times element k=16 = 16
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S032
S034 · implies
操作前
source roles = [power exponent16, 16, 23]
操作後
derived = [0, 16]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S033
S035 · calculation
操作前
Field ORIGINAL previous power times element k=17 := mul(16, 8)
操作後
Field ORIGINAL previous power times element k=17 = 128
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S034
S036 · implies
操作前
source roles = [power exponent17, 128, 23]
操作後
derived = [5, 13]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S035
S037 · calculation
操作前
Field ORIGINAL previous power times element k=18 := mul(13, 8)
操作後
Field ORIGINAL previous power times element k=18 = 104
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S036
S038 · implies
操作前
source roles = [power exponent18, 104, 23]
操作後
derived = [4, 12]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S037
S039 · calculation
操作前
Field ORIGINAL previous power times element k=19 := mul(12, 8)
操作後
Field ORIGINAL previous power times element k=19 = 96
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S038
S040 · implies
操作前
source roles = [power exponent19, 96, 23]
操作後
derived = [4, 4]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S039
S041 · calculation
操作前
Field ORIGINAL previous power times element k=20 := mul(4, 8)
操作後
Field ORIGINAL previous power times element k=20 = 32
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S040
S042 · implies
操作前
source roles = [power exponent20, 32, 23]
操作後
derived = [1, 9]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S041
S043 · calculation
操作前
Field ORIGINAL previous power times element k=21 := mul(9, 8)
操作後
Field ORIGINAL previous power times element k=21 = 72
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S042
S044 · implies
操作前
source roles = [power exponent21, 72, 23]
操作後
derived = [3, 3]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S043
S045 · calculation
操作前
Field ORIGINAL previous power times element k=22 := mul(3, 8)
操作後
Field ORIGINAL previous power times element k=22 = 24
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S044
S046 · implies
操作前
source roles = [power exponent22, 24, 23]
操作後
derived = [1, 1]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S045
S047 · calculation
操作前
Field ORIGINAL previous power times element k=23 := mul(1, 8)
操作後
Field ORIGINAL previous power times element k=23 = 8
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S046
S048 · implies
操作前
source roles = [power exponent23, 8, 23]
操作後
derived = [0, 8]
條件:無
以整數Euclidean division核value=n*quotient+remainder與0≤remainder<n,負代表元也正規化;不是浮點餘數。
步驟識別與依賴
規則:Finite_MOD_euclidean_quotient_remainder · 依賴:G001, S047
S049 · implies
操作前
source roles = [23, 8, [8, 18, 6, 2, 16, 13, 12, 4, 9, 3, 1, 8, 18, 6, 2, 16, 13, 12, 4, 9, 3, 1, 8]]
操作後
derived = [8, 是]
條件:無
逐乘核element^p=element於此Z_p,零元素也允許。一般擴張域的Frobenius未必逐點固定,不能擴大本題的結論。
步驟識別與依賴
規則:Field_FROBENIUS_prime_field_INCLUDES_zero · 依賴:G001, S048