逐步推導
S001 · implies
操作前
source operation=legendre-domain-method-boundary;original snapshot and mathematics retained
操作後
explicit ordered source output fields=[mode, modulus, normalized_class, unsupported_domain_or_method_certificate, boundary]
條件:無
保留原題介面快照,本頁直接列來源欄序,不需JavaScript。radius由原mode選6/11欄,不補欄;No與實際否定依來源責任分清。
步驟識別與依賴
規則:source_ordered_interface_explicit_without_javascript · 依賴:G001
S002 · calculation
操作前
Legendre ORIGINAL boundary class quotient times modulus := mul(0, 79)
操作後
Legendre ORIGINAL boundary class quotient times modulus = 0
條件:無
依原始角色與已證中間量精確代值,不用浮點近似,也不把有限測試冒充全稱極限。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S001
S003 · calculation
操作前
Legendre ORIGINAL boundary class ORIGINAL signed value minus multiple := sub(1, 0)
操作後
Legendre ORIGINAL boundary class ORIGINAL signed value minus multiple = 1
條件:無
依原始角色與已證中間量精確代值,不用浮點近似,也不把有限測試冒充全稱極限。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S002
S004 · implies
操作前
Legendre ORIGINAL boundary class:ORIGINAL a=1,positive modulus=79;actual quotient=0
操作後
normalized class=1;a=quotient*modulus+class;ORIGINAL a retained in output where declared
條件:無
負a亦保同一congruence class,以0到p−1表示;不把負餘數直接當標準類。
步驟識別與依賴
規則:legendre_ORIGINAL_signed_class_Euclidean_normalization · 依賴:G001, S003
S005 · implies
操作前
Legendre valid premature-method modulus:ORIGINAL modulus=79;ALL possible trial divisors through square root=[2, 3, 4, 5, 6, 7, 8]
操作後
ALL [divisor,remainder] rows=[[2, 1], [3, 1], [4, 3], [5, 4], [6, 1], [7, 2], [8, 7]];prime=是
條件:無
先完整核prime資格,不用Legendre或Euler分類反過來猜prime;這是modulus前提,不是a的平方性。
步驟識別與依賴
規則:legendre_complete_prime_trial_not_Euler_classification · 依賴:G001, S004
S006 · implies
操作前
ORIGINAL mode=premature_euler;modulus=79,a=1,normalized class=1
操作後
unsupported_domain_or_method_certificate fixed No;input IS valid odd-prime/nonzero but Euler method not yet established here
條件:無
premature_euler的No不否定Euler criterion,也不把合法input說成域外;p2/composite則是真域限制。不偷偷改為Jacobi等其他符號。
步驟識別與依賴
規則:legendre_DOMAIN_or_METHOD_No_responsibilities_distinct · 依賴:G001, S005