R0043-22149 · q-20261014-advance-20261110-r06-mobius-inversion-finite-divisors-0099
positive integer domain、完整positive divisor set與完整UPF-derived Mobius values。操作=mobinv-incomplete-divisor-boundary；資料={"n":650,"a":24,"b":1,"omitted_divisor":1}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
G001 — positive integer domain、完整positive divisor set與完整UPF-derived Mobius values。操作=mobinv-incomplete-divisor-boundary；資料={"n":650,"a":24,"b":1,"omitted_divisor":1}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。
操作前
source operation=mobinv-incomplete-divisor-boundary;original snapshot and mathematics retained
操作後
explicit ordered source output fields=[n, all_divisors, omitted_divisor, partial_divisors, complete_value, partial_value, f_n, incomplete_certificate, boundary]
條件：無
原題歷史介面標記保留，直接列來源有序欄位，不需JavaScript；MVT由原mode選欄序，不補空欄或看答案形狀猜。tag與固定No保原聲稱範圍。
規則：source_ordered_interface_explicit_without_javascript · 依賴：G001
操作前
Mobius inversion ORIGINAL inverse:actual positive input=650;check complete integer range1..650
操作後
ALL positive divisors INCREASING=[1, 2, 5, 10, 13, 25, 26, 50, 65, 130, 325, 650];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S001
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor1:actual positive input for mu=1
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S002
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[]
操作後
mu=1;empty product case=是;repeated prime=否
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S003
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor1 := div(650, 1)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor1 = 650
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S004
操作前
Mobius inversion ORIGINAL inverse F(n/1):actual positive input=650;check complete integer range1..650
操作後
ALL positive divisors INCREASING=[1, 2, 5, 10, 13, 25, 26, 50, 65, 130, 325, 650];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S005
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S006
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S007
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(2) ORIGINAL a times divisor := mul(24, 2)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(2) ORIGINAL a times divisor = 48
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S008
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(2) plus ORIGINAL b := sum(48, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(2) plus ORIGINAL b = 49
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S009
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(5) ORIGINAL a times divisor := mul(24, 5)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(5) ORIGINAL a times divisor = 120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S010
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(5) plus ORIGINAL b := sum(120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(5) plus ORIGINAL b = 121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S011
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(10) ORIGINAL a times divisor := mul(24, 10)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(10) ORIGINAL a times divisor = 240
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S012
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(10) plus ORIGINAL b := sum(240, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(10) plus ORIGINAL b = 241
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S013
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(13) ORIGINAL a times divisor := mul(24, 13)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(13) ORIGINAL a times divisor = 312
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S014
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(13) plus ORIGINAL b := sum(312, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(13) plus ORIGINAL b = 313
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S015
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(25) ORIGINAL a times divisor := mul(24, 25)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(25) ORIGINAL a times divisor = 600
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S016
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(25) plus ORIGINAL b := sum(600, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(25) plus ORIGINAL b = 601
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S017
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(26) ORIGINAL a times divisor := mul(24, 26)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(26) ORIGINAL a times divisor = 624
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S018
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(26) plus ORIGINAL b := sum(624, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(26) plus ORIGINAL b = 625
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S019
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(50) ORIGINAL a times divisor := mul(24, 50)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(50) ORIGINAL a times divisor = 1200
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S020
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(50) plus ORIGINAL b := sum(1200, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(50) plus ORIGINAL b = 1201
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S021
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(65) ORIGINAL a times divisor := mul(24, 65)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(65) ORIGINAL a times divisor = 1560
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S022
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(65) plus ORIGINAL b := sum(1560, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(65) plus ORIGINAL b = 1561
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S023
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(130) ORIGINAL a times divisor := mul(24, 130)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(130) ORIGINAL a times divisor = 3120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S024
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(130) plus ORIGINAL b := sum(3120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(130) plus ORIGINAL b = 3121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S025
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(325) ORIGINAL a times divisor := mul(24, 325)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(325) ORIGINAL a times divisor = 7800
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S026
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(325) plus ORIGINAL b := sum(7800, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(325) plus ORIGINAL b = 7801
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S027
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(650) ORIGINAL a times divisor := mul(24, 650)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(650) ORIGINAL a times divisor = 15600
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S028
操作前
Mobius inversion ORIGINAL inverse F(n/1) f(650) plus ORIGINAL b := sum(15600, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/1) f(650) plus ORIGINAL b = 15601
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S029
操作前
Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum := sum(25, 49, 121, 241, 313, 601, 625, 1201, 1561, 3121, 7801, 15601)
操作後
Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum = 31260
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S030
操作前
Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1) := mul(1, 31260)
操作後
Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1) = 31260
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S031
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor2:actual positive input for mu=2
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S032
操作前
ORIGINAL positive integer absolute magnitude=2>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S033
操作前
upf canonical complete product factor0 := mul(1, 2)
操作後
upf canonical complete product factor0 = 2
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S034
操作前
exhausted trial divisors below2;terminal remaining=2;d*d>remaining;ORIGINAL n=2
操作後
complete increasing prime multiset=[2];full product=2;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S035
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor2:input=2;COMPLETE prime multiset=[2];distinct primes=[2]
操作後
mu=-1;empty product case=否;repeated prime=否
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S036
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2 := div(650, 2)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2 = 325
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S037
操作前
Mobius inversion ORIGINAL inverse F(n/2):actual positive input=325;check complete integer range1..325
操作後
ALL positive divisors INCREASING=[1, 5, 13, 25, 65, 325];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S038
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S039
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S040
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(5) ORIGINAL a times divisor := mul(24, 5)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(5) ORIGINAL a times divisor = 120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S041
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(5) plus ORIGINAL b := sum(120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(5) plus ORIGINAL b = 121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S042
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(13) ORIGINAL a times divisor := mul(24, 13)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(13) ORIGINAL a times divisor = 312
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S043
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(13) plus ORIGINAL b := sum(312, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(13) plus ORIGINAL b = 313
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S044
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(25) ORIGINAL a times divisor := mul(24, 25)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(25) ORIGINAL a times divisor = 600
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S045
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(25) plus ORIGINAL b := sum(600, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(25) plus ORIGINAL b = 601
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S046
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(65) ORIGINAL a times divisor := mul(24, 65)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(65) ORIGINAL a times divisor = 1560
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S047
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(65) plus ORIGINAL b := sum(1560, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(65) plus ORIGINAL b = 1561
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S048
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(325) ORIGINAL a times divisor := mul(24, 325)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(325) ORIGINAL a times divisor = 7800
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S049
操作前
Mobius inversion ORIGINAL inverse F(n/2) f(325) plus ORIGINAL b := sum(7800, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/2) f(325) plus ORIGINAL b = 7801
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S050
操作前
Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum := sum(25, 121, 313, 601, 1561, 7801)
操作後
Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum = 10422
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S051
操作前
Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2) := mul(-1, 10422)
操作後
Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2) = -10422
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S052
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor5:actual positive input for mu=5
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S053
操作前
ORIGINAL positive integer absolute magnitude=5>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S054
操作前
next divisor=2;previous remaining=5;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=5;remaining modulo2=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S055
操作前
upf canonical complete product factor0 := mul(1, 5)
操作後
upf canonical complete product factor0 = 5
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S056
操作前
exhausted trial divisors below3;terminal remaining=5;d*d>remaining;ORIGINAL n=5
操作後
complete increasing prime multiset=[5];full product=5;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S057
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor5:input=5;COMPLETE prime multiset=[5];distinct primes=[5]
操作後
mu=-1;empty product case=否;repeated prime=否
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S058
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor5 := div(650, 5)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor5 = 130
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S059
操作前
Mobius inversion ORIGINAL inverse F(n/5):actual positive input=130;check complete integer range1..130
操作後
ALL positive divisors INCREASING=[1, 2, 5, 10, 13, 26, 65, 130];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S060
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S061
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S062
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(2) ORIGINAL a times divisor := mul(24, 2)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(2) ORIGINAL a times divisor = 48
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S063
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(2) plus ORIGINAL b := sum(48, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(2) plus ORIGINAL b = 49
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S064
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(5) ORIGINAL a times divisor := mul(24, 5)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(5) ORIGINAL a times divisor = 120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S065
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(5) plus ORIGINAL b := sum(120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(5) plus ORIGINAL b = 121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S066
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(10) ORIGINAL a times divisor := mul(24, 10)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(10) ORIGINAL a times divisor = 240
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S067
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(10) plus ORIGINAL b := sum(240, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(10) plus ORIGINAL b = 241
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S068
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(13) ORIGINAL a times divisor := mul(24, 13)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(13) ORIGINAL a times divisor = 312
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S069
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(13) plus ORIGINAL b := sum(312, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(13) plus ORIGINAL b = 313
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S070
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(26) ORIGINAL a times divisor := mul(24, 26)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(26) ORIGINAL a times divisor = 624
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S071
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(26) plus ORIGINAL b := sum(624, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(26) plus ORIGINAL b = 625
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S072
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(65) ORIGINAL a times divisor := mul(24, 65)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(65) ORIGINAL a times divisor = 1560
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S073
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(65) plus ORIGINAL b := sum(1560, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(65) plus ORIGINAL b = 1561
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S074
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(130) ORIGINAL a times divisor := mul(24, 130)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(130) ORIGINAL a times divisor = 3120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S075
操作前
Mobius inversion ORIGINAL inverse F(n/5) f(130) plus ORIGINAL b := sum(3120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/5) f(130) plus ORIGINAL b = 3121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S076
操作前
Mobius inversion ORIGINAL inverse F(n/5) full forward divisor sum := sum(25, 49, 121, 241, 313, 625, 1561, 3121)
操作後
Mobius inversion ORIGINAL inverse F(n/5) full forward divisor sum = 6056
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S077
操作前
Mobius inversion ORIGINAL inverse mu(5) times SAME F(n/5) := mul(-1, 6056)
操作後
Mobius inversion ORIGINAL inverse mu(5) times SAME F(n/5) = -6056
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S078
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor10:actual positive input for mu=10
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S079
操作前
ORIGINAL positive integer absolute magnitude=10>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S080
操作前
upf extract divisor2 occurrence0 := div(10, 2)
操作後
upf extract divisor2 occurrence0 = 5
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S081
操作前
next divisor=2;previous remaining=10;all smaller divisors exhausted
操作後
extracted multiplicity=1;next remaining=5;remaining modulo2=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S082
操作前
upf canonical complete product factor0 := mul(1, 2)
操作後
upf canonical complete product factor0 = 2
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S083
操作前
upf canonical complete product factor1 := mul(2, 5)
操作後
upf canonical complete product factor1 = 10
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S084
操作前
exhausted trial divisors below3;terminal remaining=5;d*d>remaining;ORIGINAL n=10
操作後
complete increasing prime multiset=[2, 5];full product=10;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S085
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor10:input=10;COMPLETE prime multiset=[2, 5];distinct primes=[2, 5]
操作後
mu=1;empty product case=否;repeated prime=否
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S086
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor10 := div(650, 10)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor10 = 65
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S087
操作前
Mobius inversion ORIGINAL inverse F(n/10):actual positive input=65;check complete integer range1..65
操作後
ALL positive divisors INCREASING=[1, 5, 13, 65];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S088
操作前
Mobius inversion ORIGINAL inverse F(n/10) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/10) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S089
操作前
Mobius inversion ORIGINAL inverse F(n/10) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/10) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S090
操作前
Mobius inversion ORIGINAL inverse F(n/10) f(5) ORIGINAL a times divisor := mul(24, 5)
操作後
Mobius inversion ORIGINAL inverse F(n/10) f(5) ORIGINAL a times divisor = 120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S091
操作前
Mobius inversion ORIGINAL inverse F(n/10) f(5) plus ORIGINAL b := sum(120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/10) f(5) plus ORIGINAL b = 121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S092
操作前
Mobius inversion ORIGINAL inverse F(n/10) f(13) ORIGINAL a times divisor := mul(24, 13)
操作後
Mobius inversion ORIGINAL inverse F(n/10) f(13) ORIGINAL a times divisor = 312
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S093
操作前
Mobius inversion ORIGINAL inverse F(n/10) f(13) plus ORIGINAL b := sum(312, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/10) f(13) plus ORIGINAL b = 313
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S094
操作前
Mobius inversion ORIGINAL inverse F(n/10) f(65) ORIGINAL a times divisor := mul(24, 65)
操作後
Mobius inversion ORIGINAL inverse F(n/10) f(65) ORIGINAL a times divisor = 1560
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S095
操作前
Mobius inversion ORIGINAL inverse F(n/10) f(65) plus ORIGINAL b := sum(1560, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/10) f(65) plus ORIGINAL b = 1561
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S096
操作前
Mobius inversion ORIGINAL inverse F(n/10) full forward divisor sum := sum(25, 121, 313, 1561)
操作後
Mobius inversion ORIGINAL inverse F(n/10) full forward divisor sum = 2020
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S097
操作前
Mobius inversion ORIGINAL inverse mu(10) times SAME F(n/10) := mul(1, 2020)
操作後
Mobius inversion ORIGINAL inverse mu(10) times SAME F(n/10) = 2020
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S098
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor13:actual positive input for mu=13
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S099
操作前
ORIGINAL positive integer absolute magnitude=13>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S100
操作前
next divisor=2;previous remaining=13;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=13;remaining modulo2=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S101
操作前
next divisor=3;previous remaining=13;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=13;remaining modulo3=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S102
操作前
upf canonical complete product factor0 := mul(1, 13)
操作後
upf canonical complete product factor0 = 13
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S103
操作前
exhausted trial divisors below4;terminal remaining=13;d*d>remaining;ORIGINAL n=13
操作後
complete increasing prime multiset=[13];full product=13;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S104
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor13:input=13;COMPLETE prime multiset=[13];distinct primes=[13]
操作後
mu=-1;empty product case=否;repeated prime=否
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S105
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor13 := div(650, 13)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor13 = 50
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S106
操作前
Mobius inversion ORIGINAL inverse F(n/13):actual positive input=50;check complete integer range1..50
操作後
ALL positive divisors INCREASING=[1, 2, 5, 10, 25, 50];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S107
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S108
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S109
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(2) ORIGINAL a times divisor := mul(24, 2)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(2) ORIGINAL a times divisor = 48
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S110
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(2) plus ORIGINAL b := sum(48, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(2) plus ORIGINAL b = 49
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S111
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(5) ORIGINAL a times divisor := mul(24, 5)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(5) ORIGINAL a times divisor = 120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S112
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(5) plus ORIGINAL b := sum(120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(5) plus ORIGINAL b = 121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S113
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(10) ORIGINAL a times divisor := mul(24, 10)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(10) ORIGINAL a times divisor = 240
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S114
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(10) plus ORIGINAL b := sum(240, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(10) plus ORIGINAL b = 241
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S115
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(25) ORIGINAL a times divisor := mul(24, 25)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(25) ORIGINAL a times divisor = 600
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S116
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(25) plus ORIGINAL b := sum(600, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(25) plus ORIGINAL b = 601
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S117
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(50) ORIGINAL a times divisor := mul(24, 50)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(50) ORIGINAL a times divisor = 1200
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S118
操作前
Mobius inversion ORIGINAL inverse F(n/13) f(50) plus ORIGINAL b := sum(1200, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/13) f(50) plus ORIGINAL b = 1201
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S119
操作前
Mobius inversion ORIGINAL inverse F(n/13) full forward divisor sum := sum(25, 49, 121, 241, 601, 1201)
操作後
Mobius inversion ORIGINAL inverse F(n/13) full forward divisor sum = 2238
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S120
操作前
Mobius inversion ORIGINAL inverse mu(13) times SAME F(n/13) := mul(-1, 2238)
操作後
Mobius inversion ORIGINAL inverse mu(13) times SAME F(n/13) = -2238
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S121
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor25:actual positive input for mu=25
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S122
操作前
ORIGINAL positive integer absolute magnitude=25>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S123
操作前
next divisor=2;previous remaining=25;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=25;remaining modulo2=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S124
操作前
next divisor=3;previous remaining=25;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=25;remaining modulo3=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S125
操作前
next divisor=4;previous remaining=25;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=25;remaining modulo4=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S126
操作前
upf extract divisor5 occurrence0 := div(25, 5)
操作後
upf extract divisor5 occurrence0 = 5
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S127
操作前
upf extract divisor5 occurrence1 := div(5, 5)
操作後
upf extract divisor5 occurrence1 = 1
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S128
操作前
next divisor=5;previous remaining=25;all smaller divisors exhausted
操作後
extracted multiplicity=2;next remaining=1;remaining modulo5=1;extracted multiset=[5, 5]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S129
操作前
upf canonical complete product factor0 := mul(1, 5)
操作後
upf canonical complete product factor0 = 5
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S130
操作前
upf canonical complete product factor1 := mul(5, 5)
操作後
upf canonical complete product factor1 = 25
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S131
操作前
exhausted trial divisors below6;terminal remaining=1;d*d>remaining;ORIGINAL n=25
操作後
complete increasing prime multiset=[5, 5];full product=25;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S132
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor25:input=25;COMPLETE prime multiset=[5, 5];distinct primes=[5]
操作後
mu=0;empty product case=否;repeated prime=是
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S133
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor25 := div(650, 25)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor25 = 26
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S134
操作前
Mobius inversion ORIGINAL inverse F(n/25):actual positive input=26;check complete integer range1..26
操作後
ALL positive divisors INCREASING=[1, 2, 13, 26];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S135
操作前
Mobius inversion ORIGINAL inverse F(n/25) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/25) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S136
操作前
Mobius inversion ORIGINAL inverse F(n/25) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/25) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S137
操作前
Mobius inversion ORIGINAL inverse F(n/25) f(2) ORIGINAL a times divisor := mul(24, 2)
操作後
Mobius inversion ORIGINAL inverse F(n/25) f(2) ORIGINAL a times divisor = 48
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S138
操作前
Mobius inversion ORIGINAL inverse F(n/25) f(2) plus ORIGINAL b := sum(48, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/25) f(2) plus ORIGINAL b = 49
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S139
操作前
Mobius inversion ORIGINAL inverse F(n/25) f(13) ORIGINAL a times divisor := mul(24, 13)
操作後
Mobius inversion ORIGINAL inverse F(n/25) f(13) ORIGINAL a times divisor = 312
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S140
操作前
Mobius inversion ORIGINAL inverse F(n/25) f(13) plus ORIGINAL b := sum(312, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/25) f(13) plus ORIGINAL b = 313
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S141
操作前
Mobius inversion ORIGINAL inverse F(n/25) f(26) ORIGINAL a times divisor := mul(24, 26)
操作後
Mobius inversion ORIGINAL inverse F(n/25) f(26) ORIGINAL a times divisor = 624
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S142
操作前
Mobius inversion ORIGINAL inverse F(n/25) f(26) plus ORIGINAL b := sum(624, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/25) f(26) plus ORIGINAL b = 625
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S143
操作前
Mobius inversion ORIGINAL inverse F(n/25) full forward divisor sum := sum(25, 49, 313, 625)
操作後
Mobius inversion ORIGINAL inverse F(n/25) full forward divisor sum = 1012
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S144
操作前
Mobius inversion ORIGINAL inverse mu(25) times SAME F(n/25) := mul(0, 1012)
操作後
Mobius inversion ORIGINAL inverse mu(25) times SAME F(n/25) = 0
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S145
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor26:actual positive input for mu=26
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S146
操作前
ORIGINAL positive integer absolute magnitude=26>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S147
操作前
upf extract divisor2 occurrence0 := div(26, 2)
操作後
upf extract divisor2 occurrence0 = 13
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S148
操作前
next divisor=2;previous remaining=26;all smaller divisors exhausted
操作後
extracted multiplicity=1;next remaining=13;remaining modulo2=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S149
操作前
next divisor=3;previous remaining=13;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=13;remaining modulo3=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S150
操作前
upf canonical complete product factor0 := mul(1, 2)
操作後
upf canonical complete product factor0 = 2
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S151
操作前
upf canonical complete product factor1 := mul(2, 13)
操作後
upf canonical complete product factor1 = 26
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S152
操作前
exhausted trial divisors below4;terminal remaining=13;d*d>remaining;ORIGINAL n=26
操作後
complete increasing prime multiset=[2, 13];full product=26;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S153
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor26:input=26;COMPLETE prime multiset=[2, 13];distinct primes=[2, 13]
操作後
mu=1;empty product case=否;repeated prime=否
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S154
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor26 := div(650, 26)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor26 = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S155
操作前
Mobius inversion ORIGINAL inverse F(n/26):actual positive input=25;check complete integer range1..25
操作後
ALL positive divisors INCREASING=[1, 5, 25];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S156
操作前
Mobius inversion ORIGINAL inverse F(n/26) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/26) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S157
操作前
Mobius inversion ORIGINAL inverse F(n/26) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/26) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S158
操作前
Mobius inversion ORIGINAL inverse F(n/26) f(5) ORIGINAL a times divisor := mul(24, 5)
操作後
Mobius inversion ORIGINAL inverse F(n/26) f(5) ORIGINAL a times divisor = 120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S159
操作前
Mobius inversion ORIGINAL inverse F(n/26) f(5) plus ORIGINAL b := sum(120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/26) f(5) plus ORIGINAL b = 121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S160
操作前
Mobius inversion ORIGINAL inverse F(n/26) f(25) ORIGINAL a times divisor := mul(24, 25)
操作後
Mobius inversion ORIGINAL inverse F(n/26) f(25) ORIGINAL a times divisor = 600
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S161
操作前
Mobius inversion ORIGINAL inverse F(n/26) f(25) plus ORIGINAL b := sum(600, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/26) f(25) plus ORIGINAL b = 601
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S162
操作前
Mobius inversion ORIGINAL inverse F(n/26) full forward divisor sum := sum(25, 121, 601)
操作後
Mobius inversion ORIGINAL inverse F(n/26) full forward divisor sum = 747
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S163
操作前
Mobius inversion ORIGINAL inverse mu(26) times SAME F(n/26) := mul(1, 747)
操作後
Mobius inversion ORIGINAL inverse mu(26) times SAME F(n/26) = 747
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S164
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor50:actual positive input for mu=50
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S165
操作前
ORIGINAL positive integer absolute magnitude=50>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S166
操作前
upf extract divisor2 occurrence0 := div(50, 2)
操作後
upf extract divisor2 occurrence0 = 25
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S167
操作前
next divisor=2;previous remaining=50;all smaller divisors exhausted
操作後
extracted multiplicity=1;next remaining=25;remaining modulo2=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S168
操作前
next divisor=3;previous remaining=25;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=25;remaining modulo3=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S169
操作前
next divisor=4;previous remaining=25;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=25;remaining modulo4=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S170
操作前
upf extract divisor5 occurrence1 := div(25, 5)
操作後
upf extract divisor5 occurrence1 = 5
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S171
操作前
upf extract divisor5 occurrence2 := div(5, 5)
操作後
upf extract divisor5 occurrence2 = 1
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S172
操作前
next divisor=5;previous remaining=25;all smaller divisors exhausted
操作後
extracted multiplicity=2;next remaining=1;remaining modulo5=1;extracted multiset=[2, 5, 5]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S173
操作前
upf canonical complete product factor0 := mul(1, 2)
操作後
upf canonical complete product factor0 = 2
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S174
操作前
upf canonical complete product factor1 := mul(2, 5)
操作後
upf canonical complete product factor1 = 10
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S175
操作前
upf canonical complete product factor2 := mul(10, 5)
操作後
upf canonical complete product factor2 = 50
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S176
操作前
exhausted trial divisors below6;terminal remaining=1;d*d>remaining;ORIGINAL n=50
操作後
complete increasing prime multiset=[2, 5, 5];full product=50;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S177
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor50:input=50;COMPLETE prime multiset=[2, 5, 5];distinct primes=[2, 5]
操作後
mu=0;empty product case=否;repeated prime=是
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S178
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor50 := div(650, 50)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor50 = 13
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S179
操作前
Mobius inversion ORIGINAL inverse F(n/50):actual positive input=13;check complete integer range1..13
操作後
ALL positive divisors INCREASING=[1, 13];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S180
操作前
Mobius inversion ORIGINAL inverse F(n/50) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/50) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S181
操作前
Mobius inversion ORIGINAL inverse F(n/50) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/50) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S182
操作前
Mobius inversion ORIGINAL inverse F(n/50) f(13) ORIGINAL a times divisor := mul(24, 13)
操作後
Mobius inversion ORIGINAL inverse F(n/50) f(13) ORIGINAL a times divisor = 312
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S183
操作前
Mobius inversion ORIGINAL inverse F(n/50) f(13) plus ORIGINAL b := sum(312, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/50) f(13) plus ORIGINAL b = 313
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S184
操作前
Mobius inversion ORIGINAL inverse F(n/50) full forward divisor sum := sum(25, 313)
操作後
Mobius inversion ORIGINAL inverse F(n/50) full forward divisor sum = 338
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S185
操作前
Mobius inversion ORIGINAL inverse mu(50) times SAME F(n/50) := mul(0, 338)
操作後
Mobius inversion ORIGINAL inverse mu(50) times SAME F(n/50) = 0
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S186
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor65:actual positive input for mu=65
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S187
操作前
ORIGINAL positive integer absolute magnitude=65>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S188
操作前
next divisor=2;previous remaining=65;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=65;remaining modulo2=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S189
操作前
next divisor=3;previous remaining=65;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=65;remaining modulo3=2;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S190
操作前
next divisor=4;previous remaining=65;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=65;remaining modulo4=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S191
操作前
upf extract divisor5 occurrence0 := div(65, 5)
操作後
upf extract divisor5 occurrence0 = 13
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S192
操作前
next divisor=5;previous remaining=65;all smaller divisors exhausted
操作後
extracted multiplicity=1;next remaining=13;remaining modulo5=3;extracted multiset=[5]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S193
操作前
upf canonical complete product factor0 := mul(1, 5)
操作後
upf canonical complete product factor0 = 5
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S194
操作前
upf canonical complete product factor1 := mul(5, 13)
操作後
upf canonical complete product factor1 = 65
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S195
操作前
exhausted trial divisors below6;terminal remaining=13;d*d>remaining;ORIGINAL n=65
操作後
complete increasing prime multiset=[5, 13];full product=65;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S196
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor65:input=65;COMPLETE prime multiset=[5, 13];distinct primes=[5, 13]
操作後
mu=1;empty product case=否;repeated prime=否
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S197
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor65 := div(650, 65)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor65 = 10
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S198
操作前
Mobius inversion ORIGINAL inverse F(n/65):actual positive input=10;check complete integer range1..10
操作後
ALL positive divisors INCREASING=[1, 2, 5, 10];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S199
操作前
Mobius inversion ORIGINAL inverse F(n/65) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/65) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S200
操作前
Mobius inversion ORIGINAL inverse F(n/65) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/65) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S201
操作前
Mobius inversion ORIGINAL inverse F(n/65) f(2) ORIGINAL a times divisor := mul(24, 2)
操作後
Mobius inversion ORIGINAL inverse F(n/65) f(2) ORIGINAL a times divisor = 48
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S202
操作前
Mobius inversion ORIGINAL inverse F(n/65) f(2) plus ORIGINAL b := sum(48, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/65) f(2) plus ORIGINAL b = 49
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S203
操作前
Mobius inversion ORIGINAL inverse F(n/65) f(5) ORIGINAL a times divisor := mul(24, 5)
操作後
Mobius inversion ORIGINAL inverse F(n/65) f(5) ORIGINAL a times divisor = 120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S204
操作前
Mobius inversion ORIGINAL inverse F(n/65) f(5) plus ORIGINAL b := sum(120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/65) f(5) plus ORIGINAL b = 121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S205
操作前
Mobius inversion ORIGINAL inverse F(n/65) f(10) ORIGINAL a times divisor := mul(24, 10)
操作後
Mobius inversion ORIGINAL inverse F(n/65) f(10) ORIGINAL a times divisor = 240
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S206
操作前
Mobius inversion ORIGINAL inverse F(n/65) f(10) plus ORIGINAL b := sum(240, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/65) f(10) plus ORIGINAL b = 241
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S207
操作前
Mobius inversion ORIGINAL inverse F(n/65) full forward divisor sum := sum(25, 49, 121, 241)
操作後
Mobius inversion ORIGINAL inverse F(n/65) full forward divisor sum = 436
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S208
操作前
Mobius inversion ORIGINAL inverse mu(65) times SAME F(n/65) := mul(1, 436)
操作後
Mobius inversion ORIGINAL inverse mu(65) times SAME F(n/65) = 436
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S209
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor130:actual positive input for mu=130
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S210
操作前
ORIGINAL positive integer absolute magnitude=130>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S211
操作前
upf extract divisor2 occurrence0 := div(130, 2)
操作後
upf extract divisor2 occurrence0 = 65
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S212
操作前
next divisor=2;previous remaining=130;all smaller divisors exhausted
操作後
extracted multiplicity=1;next remaining=65;remaining modulo2=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S213
操作前
next divisor=3;previous remaining=65;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=65;remaining modulo3=2;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S214
操作前
next divisor=4;previous remaining=65;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=65;remaining modulo4=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S215
操作前
upf extract divisor5 occurrence1 := div(65, 5)
操作後
upf extract divisor5 occurrence1 = 13
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S216
操作前
next divisor=5;previous remaining=65;all smaller divisors exhausted
操作後
extracted multiplicity=1;next remaining=13;remaining modulo5=3;extracted multiset=[2, 5]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S217
操作前
upf canonical complete product factor0 := mul(1, 2)
操作後
upf canonical complete product factor0 = 2
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S218
操作前
upf canonical complete product factor1 := mul(2, 5)
操作後
upf canonical complete product factor1 = 10
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S219
操作前
upf canonical complete product factor2 := mul(10, 13)
操作後
upf canonical complete product factor2 = 130
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S220
操作前
exhausted trial divisors below6;terminal remaining=13;d*d>remaining;ORIGINAL n=130
操作後
complete increasing prime multiset=[2, 5, 13];full product=130;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S221
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor130:input=130;COMPLETE prime multiset=[2, 5, 13];distinct primes=[2, 5, 13]
操作後
mu=-1;empty product case=否;repeated prime=否
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S222
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor130 := div(650, 130)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor130 = 5
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S223
操作前
Mobius inversion ORIGINAL inverse F(n/130):actual positive input=5;check complete integer range1..5
操作後
ALL positive divisors INCREASING=[1, 5];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S224
操作前
Mobius inversion ORIGINAL inverse F(n/130) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/130) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S225
操作前
Mobius inversion ORIGINAL inverse F(n/130) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/130) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S226
操作前
Mobius inversion ORIGINAL inverse F(n/130) f(5) ORIGINAL a times divisor := mul(24, 5)
操作後
Mobius inversion ORIGINAL inverse F(n/130) f(5) ORIGINAL a times divisor = 120
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S227
操作前
Mobius inversion ORIGINAL inverse F(n/130) f(5) plus ORIGINAL b := sum(120, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/130) f(5) plus ORIGINAL b = 121
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S228
操作前
Mobius inversion ORIGINAL inverse F(n/130) full forward divisor sum := sum(25, 121)
操作後
Mobius inversion ORIGINAL inverse F(n/130) full forward divisor sum = 146
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S229
操作前
Mobius inversion ORIGINAL inverse mu(130) times SAME F(n/130) := mul(-1, 146)
操作後
Mobius inversion ORIGINAL inverse mu(130) times SAME F(n/130) = -146
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S230
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor325:actual positive input for mu=325
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S231
操作前
ORIGINAL positive integer absolute magnitude=325>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S232
操作前
next divisor=2;previous remaining=325;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=325;remaining modulo2=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S233
操作前
next divisor=3;previous remaining=325;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=325;remaining modulo3=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S234
操作前
next divisor=4;previous remaining=325;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=325;remaining modulo4=1;extracted multiset=[]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S235
操作前
upf extract divisor5 occurrence0 := div(325, 5)
操作後
upf extract divisor5 occurrence0 = 65
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S236
操作前
upf extract divisor5 occurrence1 := div(65, 5)
操作後
upf extract divisor5 occurrence1 = 13
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S237
操作前
next divisor=5;previous remaining=325;all smaller divisors exhausted
操作後
extracted multiplicity=2;next remaining=13;remaining modulo5=3;extracted multiset=[5, 5]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S238
操作前
upf canonical complete product factor0 := mul(1, 5)
操作後
upf canonical complete product factor0 = 5
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S239
操作前
upf canonical complete product factor1 := mul(5, 5)
操作後
upf canonical complete product factor1 = 25
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S240
操作前
upf canonical complete product factor2 := mul(25, 13)
操作後
upf canonical complete product factor2 = 325
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S241
操作前
exhausted trial divisors below6;terminal remaining=13;d*d>remaining;ORIGINAL n=325
操作後
complete increasing prime multiset=[5, 5, 13];full product=325;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S242
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor325:input=325;COMPLETE prime multiset=[5, 5, 13];distinct primes=[5, 13]
操作後
mu=0;empty product case=否;repeated prime=是
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S243
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor325 := div(650, 325)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor325 = 2
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S244
操作前
Mobius inversion ORIGINAL inverse F(n/325):actual positive input=2;check complete integer range1..2
操作後
ALL positive divisors INCREASING=[1, 2];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S245
操作前
Mobius inversion ORIGINAL inverse F(n/325) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/325) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S246
操作前
Mobius inversion ORIGINAL inverse F(n/325) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/325) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S247
操作前
Mobius inversion ORIGINAL inverse F(n/325) f(2) ORIGINAL a times divisor := mul(24, 2)
操作後
Mobius inversion ORIGINAL inverse F(n/325) f(2) ORIGINAL a times divisor = 48
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S248
操作前
Mobius inversion ORIGINAL inverse F(n/325) f(2) plus ORIGINAL b := sum(48, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/325) f(2) plus ORIGINAL b = 49
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S249
操作前
Mobius inversion ORIGINAL inverse F(n/325) full forward divisor sum := sum(25, 49)
操作後
Mobius inversion ORIGINAL inverse F(n/325) full forward divisor sum = 74
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S250
操作前
Mobius inversion ORIGINAL inverse mu(325) times SAME F(n/325) := mul(0, 74)
操作後
Mobius inversion ORIGINAL inverse mu(325) times SAME F(n/325) = 0
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S251
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor650:actual positive input for mu=650
操作後
complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search
條件：無
先明示正在算原n還是其正因數的mu；每次需要完整prime重數，不能用找到的幾個因數猜squarefree。
規則：mobius_complete_UPF_input_role · 依賴：G001, S252
操作前
ORIGINAL positive integer absolute magnitude=650>1
操作後
initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted
條件：無
每次只除真正整除的d，並以已窮盡更小因數維持d為prime的理由，不先假定原n為prime。
規則：upf_factorization_remaining_product_invariant · 依賴：G001, S253
操作前
upf extract divisor2 occurrence0 := div(650, 2)
操作後
upf extract divisor2 occurrence0 = 325
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S254
操作前
next divisor=2;previous remaining=650;all smaller divisors exhausted
操作後
extracted multiplicity=1;next remaining=325;remaining modulo2=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S255
操作前
next divisor=3;previous remaining=325;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=325;remaining modulo3=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S256
操作前
next divisor=4;previous remaining=325;all smaller divisors exhausted
操作後
extracted multiplicity=0;next remaining=325;remaining modulo4=1;extracted multiset=[2]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S257
操作前
upf extract divisor5 occurrence1 := div(325, 5)
操作後
upf extract divisor5 occurrence1 = 65
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S258
操作前
upf extract divisor5 occurrence2 := div(65, 5)
操作後
upf extract divisor5 occurrence2 = 13
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S259
操作前
next divisor=5;previous remaining=325;all smaller divisors exhausted
操作後
extracted multiplicity=2;next remaining=13;remaining modulo5=3;extracted multiset=[2, 5, 5]
條件：無
除盡同一prime的所有重數才前進；不把n的原平方根與remaining的停止責任混淆，也不漏最後的prime remainder。
規則：upf_complete_trial_division_remaining_invariant · 依賴：G001, S260
操作前
upf canonical complete product factor0 := mul(1, 2)
操作後
upf canonical complete product factor0 = 2
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S261
操作前
upf canonical complete product factor1 := mul(2, 5)
操作後
upf canonical complete product factor1 = 10
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S262
操作前
upf canonical complete product factor2 := mul(10, 5)
操作後
upf canonical complete product factor2 = 50
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S263
操作前
upf canonical complete product factor3 := mul(50, 13)
操作後
upf canonical complete product factor3 = 650
條件：無
依原題角色與已核中間量精確代值，保留原順序、正負號及量詞條件。
規則：exact_rational_arithmetic · 依賴：G001, S264
操作前
exhausted trial divisors below6;terminal remaining=13;d*d>remaining;ORIGINAL n=650
操作後
complete increasing prime multiset=[2, 5, 5, 13];full product=650;a composite terminal remainder would have an already tested smaller divisor
條件：無
若remaining>1仍合數，其最小prime因數會在已驗範圍，與除盡不變式矛盾，所以補入的末項為prime。這證本例完整分解；一般存在也可對n作強歸納，合數拆成較小正因數後遞歸。
規則：upf_final_prime_remainder_complete_existence_instance · 依賴：G001, S265
操作前
Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor650:input=650;COMPLETE prime multiset=[2, 5, 5, 13];distinct primes=[2, 5, 13]
操作後
mu=0;empty product case=否;repeated prime=是
條件：無
1的空prime多重集給mu1=1；任何prime重複表示square divisor而給0；否則依不同prime個數奇偶給正負。排序不丟重數。
規則：mobius_value_one_repeated_prime_or_squarefree_parity · 依賴：G001, S266
操作前
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor650 := div(650, 650)
操作後
Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor650 = 1
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S267
操作前
Mobius inversion ORIGINAL inverse F(n/650):actual positive input=1;check complete integer range1..1
操作後
ALL positive divisors INCREASING=[1];not only primes/proper divisors or all integers<=n
條件：無
逐完整範圍查整除，保1與n；d|n不是d<=n，也不只取prime或proper divisor。
規則：mobinv_ALL_positive_divisors_complete_indexing · 依賴：G001, S268
操作前
Mobius inversion ORIGINAL inverse F(n/650) f(1) ORIGINAL a times divisor := mul(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/650) f(1) ORIGINAL a times divisor = 24
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S269
操作前
Mobius inversion ORIGINAL inverse F(n/650) f(1) plus ORIGINAL b := sum(24, 1)
操作後
Mobius inversion ORIGINAL inverse F(n/650) f(1) plus ORIGINAL b = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S270
操作前
Mobius inversion ORIGINAL inverse F(n/650) full forward divisor sum := sum(25)
操作後
Mobius inversion ORIGINAL inverse F(n/650) full forward divisor sum = 25
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S271
操作前
Mobius inversion ORIGINAL inverse mu(650) times SAME F(n/650) := mul(0, 25)
操作後
Mobius inversion ORIGINAL inverse mu(650) times SAME F(n/650) = 0
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S272
操作前
Mobius inversion ORIGINAL inverse complete inverse-term sum := sum(31260, -10422, -6056, 2020, -2238, 0, 747, 0, 436, -146, 0, 0)
操作後
Mobius inversion ORIGINAL inverse complete inverse-term sum = 15601
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S273
操作前
Mobius inversion ORIGINAL inverse direct ORIGINAL a times n := mul(24, 650)
操作後
Mobius inversion ORIGINAL inverse direct ORIGINAL a times n = 15600
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S274
操作前
Mobius inversion ORIGINAL inverse direct plus ORIGINAL b := sum(15600, 1)
操作後
Mobius inversion ORIGINAL inverse direct plus ORIGINAL b = 15601
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S275
操作前
Mobius inversion ORIGINAL inverse:actual n=650;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 650, 31260, 31260], [2, -1, 325, 10422, -10422], [5, -1, 130, 6056, -6056], [10, 1, 65, 2020, 2020], [13, -1, 50, 2238, -2238], [25, 0, 26, 1012, 0], [26, 1, 25, 747, 747], [50, 0, 13, 338, 0], [65, 1, 10, 436, 436], [130, -1, 5, 146, -146], [325, 0, 2, 74, 0], [650, 0, 1, 25, 0]]
操作後
complete reconstructed=15601;direct f(n)=15601;sum_d mu(d)sum_e|n/d f(e)=sum_e|n f(e)sum_d|n/e mu(d)=f(n)
條件：無
有限雙和可換序，d*e|n；內層mu和在n/e=1時為1，否則由不同prime子集合正負配對為0，故只留e=n。n=1也有d=1、mu1=1，不混另一等價公式的index。
規則：mobinv_general_finite_double_sum_and_Mobius_cancellation · 依賴：G001, S276
操作前
Mobius inversion ORIGINAL omitted-divisor partial sum := sum(-10422, -6056, 2020, -2238, 0, 747, 0, 436, -146, 0, 0)
操作後
Mobius inversion ORIGINAL omitted-divisor partial sum = -15659
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S277
操作前
Mobius inversion complete minus partial := sub(15601, -15659)
操作後
Mobius inversion complete minus partial = 31260
條件：無
依原始角色、次序與已核中間量精確代值；不改source binding或用浮點近似。
規則：exact_rational_arithmetic · 依賴：G001, S278
操作前
ORIGINAL full divisors=[1, 2, 5, 10, 13, 25, 26, 50, 65, 130, 325, 650];actual omitted divisor=1;remaining ORIGINAL-order divisors=[2, 5, 10, 13, 25, 26, 50, 65, 130, 325, 650]
操作後
complete=15601=f(n)=15601;partial=-15659;lost term=31260!=0;incomplete_certificate fixed No
條件：無
必須真漏一個divisor且其貢獻非零，使部分結果與目標不同；漏零項而恰巧相等不給本boundary證書。No拒絕不完整證書，不否認完整反演正確。
規則：mobinv_omission_actual_nonzero_discriminative_term · 依賴：G001, S279
S280 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S279 · premise_and_result_audit — 以精確有理數重算 Mobius inversion complete minus partial，不以小數近似替代。S278 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL omitted-divisor partial sum，不以小數近似替代。S277 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S276 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse direct plus ORIGINAL b，不以小數近似替代。S275 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse direct ORIGINAL a times n，不以小數近似替代。S274 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse complete inverse-term sum，不以小數近似替代。S273 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(650) times SAME F(n/650)，不以小數近似替代。S272 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/650) full forward divisor sum，不以小數近似替代。S271 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/650) f(1) plus ORIGINAL b，不以小數近似替代。S270 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/650) f(1) ORIGINAL a times divisor，不以小數近似替代。S269 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S268 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor650，不以小數近似替代。S267 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S266 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S265 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor3，不以小數近似替代。S264 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。S263 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。S262 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S261 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S260 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence2，不以小數近似替代。S259 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence1，不以小數近似替代。S258 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S257 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S256 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S255 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。S254 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S253 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S252 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(325) times SAME F(n/325)，不以小數近似替代。S251 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/325) full forward divisor sum，不以小數近似替代。S250 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/325) f(2) plus ORIGINAL b，不以小數近似替代。S249 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/325) f(2) ORIGINAL a times divisor，不以小數近似替代。S248 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/325) f(1) plus ORIGINAL b，不以小數近似替代。S247 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/325) f(1) ORIGINAL a times divisor，不以小數近似替代。S246 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S245 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor325，不以小數近似替代。S244 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S243 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S242 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。S241 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。S240 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S239 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S238 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence1，不以小數近似替代。S237 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence0，不以小數近似替代。S236 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S235 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S234 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S233 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S232 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S231 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(130) times SAME F(n/130)，不以小數近似替代。S230 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/130) full forward divisor sum，不以小數近似替代。S229 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/130) f(5) plus ORIGINAL b，不以小數近似替代。S228 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/130) f(5) ORIGINAL a times divisor，不以小數近似替代。S227 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/130) f(1) plus ORIGINAL b，不以小數近似替代。S226 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/130) f(1) ORIGINAL a times divisor，不以小數近似替代。S225 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S224 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor130，不以小數近似替代。S223 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S222 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S221 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。S220 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。S219 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S218 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S217 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence1，不以小數近似替代。S216 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S215 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S214 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S213 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。S212 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S211 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S210 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(65) times SAME F(n/65)，不以小數近似替代。S209 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) full forward divisor sum，不以小數近似替代。S208 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) f(10) plus ORIGINAL b，不以小數近似替代。S207 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) f(10) ORIGINAL a times divisor，不以小數近似替代。S206 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) f(5) plus ORIGINAL b，不以小數近似替代。S205 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) f(5) ORIGINAL a times divisor，不以小數近似替代。S204 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) f(2) plus ORIGINAL b，不以小數近似替代。S203 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) f(2) ORIGINAL a times divisor，不以小數近似替代。S202 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) f(1) plus ORIGINAL b，不以小數近似替代。S201 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/65) f(1) ORIGINAL a times divisor，不以小數近似替代。S200 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S199 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor65，不以小數近似替代。S198 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S197 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S196 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。S195 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S194 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S193 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence0，不以小數近似替代。S192 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S191 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S190 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S189 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S188 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S187 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(50) times SAME F(n/50)，不以小數近似替代。S186 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/50) full forward divisor sum，不以小數近似替代。S185 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/50) f(13) plus ORIGINAL b，不以小數近似替代。S184 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/50) f(13) ORIGINAL a times divisor，不以小數近似替代。S183 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/50) f(1) plus ORIGINAL b，不以小數近似替代。S182 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/50) f(1) ORIGINAL a times divisor，不以小數近似替代。S181 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S180 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor50，不以小數近似替代。S179 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S178 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S177 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。S176 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。S175 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S174 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S173 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence2，不以小數近似替代。S172 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence1，不以小數近似替代。S171 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S170 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S169 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S168 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。S167 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S166 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S165 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(26) times SAME F(n/26)，不以小數近似替代。S164 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/26) full forward divisor sum，不以小數近似替代。S163 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/26) f(25) plus ORIGINAL b，不以小數近似替代。S162 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/26) f(25) ORIGINAL a times divisor，不以小數近似替代。S161 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/26) f(5) plus ORIGINAL b，不以小數近似替代。S160 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/26) f(5) ORIGINAL a times divisor，不以小數近似替代。S159 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/26) f(1) plus ORIGINAL b，不以小數近似替代。S158 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/26) f(1) ORIGINAL a times divisor，不以小數近似替代。S157 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S156 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor26，不以小數近似替代。S155 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S154 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S153 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。S152 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S151 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S150 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S149 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。S148 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S147 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S146 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(25) times SAME F(n/25)，不以小數近似替代。S145 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) full forward divisor sum，不以小數近似替代。S144 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) f(26) plus ORIGINAL b，不以小數近似替代。S143 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) f(26) ORIGINAL a times divisor，不以小數近似替代。S142 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) f(13) plus ORIGINAL b，不以小數近似替代。S141 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) f(13) ORIGINAL a times divisor，不以小數近似替代。S140 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) f(2) plus ORIGINAL b，不以小數近似替代。S139 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) f(2) ORIGINAL a times divisor，不以小數近似替代。S138 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) f(1) plus ORIGINAL b，不以小數近似替代。S137 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/25) f(1) ORIGINAL a times divisor，不以小數近似替代。S136 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S135 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor25，不以小數近似替代。S134 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S133 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S132 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。S131 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S130 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S129 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence1，不以小數近似替代。S128 · premise_and_result_audit — 以精確有理數重算 upf extract divisor5 occurrence0，不以小數近似替代。S127 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S126 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S125 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S124 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S123 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S122 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(13) times SAME F(n/13)，不以小數近似替代。S121 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) full forward divisor sum，不以小數近似替代。S120 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(50) plus ORIGINAL b，不以小數近似替代。S119 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(50) ORIGINAL a times divisor，不以小數近似替代。S118 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(25) plus ORIGINAL b，不以小數近似替代。S117 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(25) ORIGINAL a times divisor，不以小數近似替代。S116 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(10) plus ORIGINAL b，不以小數近似替代。S115 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(10) ORIGINAL a times divisor，不以小數近似替代。S114 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(5) plus ORIGINAL b，不以小數近似替代。S113 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(5) ORIGINAL a times divisor，不以小數近似替代。S112 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(2) plus ORIGINAL b，不以小數近似替代。S111 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(2) ORIGINAL a times divisor，不以小數近似替代。S110 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(1) plus ORIGINAL b，不以小數近似替代。S109 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/13) f(1) ORIGINAL a times divisor，不以小數近似替代。S108 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S107 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor13，不以小數近似替代。S106 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S105 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S104 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S103 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S102 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S101 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S100 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S099 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(10) times SAME F(n/10)，不以小數近似替代。S098 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) full forward divisor sum，不以小數近似替代。S097 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) f(65) plus ORIGINAL b，不以小數近似替代。S096 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) f(65) ORIGINAL a times divisor，不以小數近似替代。S095 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) f(13) plus ORIGINAL b，不以小數近似替代。S094 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) f(13) ORIGINAL a times divisor，不以小數近似替代。S093 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) f(5) plus ORIGINAL b，不以小數近似替代。S092 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) f(5) ORIGINAL a times divisor，不以小數近似替代。S091 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) f(1) plus ORIGINAL b，不以小數近似替代。S090 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/10) f(1) ORIGINAL a times divisor，不以小數近似替代。S089 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S088 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor10，不以小數近似替代。S087 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S086 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S085 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。S084 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S083 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S082 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。S081 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S080 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S079 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(5) times SAME F(n/5)，不以小數近似替代。S078 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) full forward divisor sum，不以小數近似替代。S077 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(130) plus ORIGINAL b，不以小數近似替代。S076 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(130) ORIGINAL a times divisor，不以小數近似替代。S075 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(65) plus ORIGINAL b，不以小數近似替代。S074 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(65) ORIGINAL a times divisor，不以小數近似替代。S073 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(26) plus ORIGINAL b，不以小數近似替代。S072 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(26) ORIGINAL a times divisor，不以小數近似替代。S071 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(13) plus ORIGINAL b，不以小數近似替代。S070 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(13) ORIGINAL a times divisor，不以小數近似替代。S069 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(10) plus ORIGINAL b，不以小數近似替代。S068 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(10) ORIGINAL a times divisor，不以小數近似替代。S067 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(5) plus ORIGINAL b，不以小數近似替代。S066 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(5) ORIGINAL a times divisor，不以小數近似替代。S065 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(2) plus ORIGINAL b，不以小數近似替代。S064 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(2) ORIGINAL a times divisor，不以小數近似替代。S063 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(1) plus ORIGINAL b，不以小數近似替代。S062 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/5) f(1) ORIGINAL a times divisor，不以小數近似替代。S061 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S060 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor5，不以小數近似替代。S059 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S058 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S057 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S056 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S055 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S054 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S053 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2)，不以小數近似替代。S052 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum，不以小數近似替代。S051 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(325) plus ORIGINAL b，不以小數近似替代。S050 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(325) ORIGINAL a times divisor，不以小數近似替代。S049 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(65) plus ORIGINAL b，不以小數近似替代。S048 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(65) ORIGINAL a times divisor，不以小數近似替代。S047 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(25) plus ORIGINAL b，不以小數近似替代。S046 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(25) ORIGINAL a times divisor，不以小數近似替代。S045 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(13) plus ORIGINAL b，不以小數近似替代。S044 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(13) ORIGINAL a times divisor，不以小數近似替代。S043 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(5) plus ORIGINAL b，不以小數近似替代。S042 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(5) ORIGINAL a times divisor，不以小數近似替代。S041 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b，不以小數近似替代。S040 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor，不以小數近似替代。S039 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S038 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2，不以小數近似替代。S037 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S036 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S035 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。S034 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S033 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S032 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1)，不以小數近似替代。S031 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum，不以小數近似替代。S030 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(650) plus ORIGINAL b，不以小數近似替代。S029 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(650) ORIGINAL a times divisor，不以小數近似替代。S028 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(325) plus ORIGINAL b，不以小數近似替代。S027 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(325) ORIGINAL a times divisor，不以小數近似替代。S026 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(130) plus ORIGINAL b，不以小數近似替代。S025 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(130) ORIGINAL a times divisor，不以小數近似替代。S024 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(65) plus ORIGINAL b，不以小數近似替代。S023 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(65) ORIGINAL a times divisor，不以小數近似替代。S022 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(50) plus ORIGINAL b，不以小數近似替代。S021 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(50) ORIGINAL a times divisor，不以小數近似替代。S020 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(26) plus ORIGINAL b，不以小數近似替代。S019 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(26) ORIGINAL a times divisor，不以小數近似替代。S018 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(25) plus ORIGINAL b，不以小數近似替代。S017 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(25) ORIGINAL a times divisor，不以小數近似替代。S016 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(13) plus ORIGINAL b，不以小數近似替代。S015 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(13) ORIGINAL a times divisor，不以小數近似替代。S014 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(10) plus ORIGINAL b，不以小數近似替代。S013 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(10) ORIGINAL a times divisor，不以小數近似替代。S012 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(5) plus ORIGINAL b，不以小數近似替代。S011 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(5) ORIGINAL a times divisor，不以小數近似替代。S010 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(2) plus ORIGINAL b，不以小數近似替代。S009 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(2) ORIGINAL a times divisor，不以小數近似替代。S008 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。S007 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。S006 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S005 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor1，不以小數近似替代。S004 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S003 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S002 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。S001 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。(650, [1, 2, 5, 10, 13, 25, 26, 50, 65, 130, 325, 650], 1, [2, 5, 10, 13, 25, 26, 50, 65, 130, 325, 650], 15601, -15659, 15601, 否, all_positive_divisors_and_consistent_d_to_n_over_d_indexing_required)
依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。
覆核日期：2026-10-26
原題、答案、步驟表達式、數值 AST 與既有歷史保持原樣；原來的候選狀態屬於來源歷史，不覆寫為形式化證明。
input commit: 0f7be61e2c22317a4075561dc822c87d881a50dboriginal question SHA-256: 37610b19b5e3627dca01785986b6ec6e92d2d74fb74440a4f8bd6c431f0a0dfecandidate record SHA-256: 5c11aa3b73c130123e92d03a336d775f8c4b62c15a83cbdbb92689235485b251semantic review receipt SHA-256: 49cf6ec60211c92d1c0c302663af4d44479635dc8181fb61a20c3374288e21c5question-first witness SHA-256: 10fd25b4643e5ff12753daceaa61f9f2499bf381f65ef96e9d21185c7c0d0c5eLean: NOT_RUN · human review: NOT_PERFORMED