第 22145 題：有限因數格上的Möbius反演

原題與已知條件

positive integer domain、完整positive divisor set與完整UPF-derived Mobius values。操作=mobinv-incomplete-divisor-boundary；資料={"n":462,"a":20,"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":462,"a":20,"b":1,"omitted_divisor":1}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

定義與適用範圍

沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。

• mko-mobius-inversion-finite-divisors

逐步推導

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]

Mobius inversion ORIGINAL inverse:actual positive input=462;check complete integer range1..462

ALL positive divisors INCREASING=[1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462];not only primes/proper divisors or all integers<=n

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

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[]

mu=1;empty product case=是;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor1 := div(462, 1)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor1 = 462

Mobius inversion ORIGINAL inverse F(n/1):actual positive input=462;check complete integer range1..462

ALL positive divisors INCREASING=[1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/1) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/1) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/1) f(2) ORIGINAL a times divisor := mul(20, 2)

Mobius inversion ORIGINAL inverse F(n/1) f(2) ORIGINAL a times divisor = 40

Mobius inversion ORIGINAL inverse F(n/1) f(2) plus ORIGINAL b := sum(40, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(2) plus ORIGINAL b = 41

Mobius inversion ORIGINAL inverse F(n/1) f(3) ORIGINAL a times divisor := mul(20, 3)

Mobius inversion ORIGINAL inverse F(n/1) f(3) ORIGINAL a times divisor = 60

Mobius inversion ORIGINAL inverse F(n/1) f(3) plus ORIGINAL b := sum(60, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(3) plus ORIGINAL b = 61

Mobius inversion ORIGINAL inverse F(n/1) f(6) ORIGINAL a times divisor := mul(20, 6)

Mobius inversion ORIGINAL inverse F(n/1) f(6) ORIGINAL a times divisor = 120

Mobius inversion ORIGINAL inverse F(n/1) f(6) plus ORIGINAL b := sum(120, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(6) plus ORIGINAL b = 121

Mobius inversion ORIGINAL inverse F(n/1) f(7) ORIGINAL a times divisor := mul(20, 7)

Mobius inversion ORIGINAL inverse F(n/1) f(7) ORIGINAL a times divisor = 140

Mobius inversion ORIGINAL inverse F(n/1) f(7) plus ORIGINAL b := sum(140, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(7) plus ORIGINAL b = 141

Mobius inversion ORIGINAL inverse F(n/1) f(11) ORIGINAL a times divisor := mul(20, 11)

Mobius inversion ORIGINAL inverse F(n/1) f(11) ORIGINAL a times divisor = 220

Mobius inversion ORIGINAL inverse F(n/1) f(11) plus ORIGINAL b := sum(220, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(11) plus ORIGINAL b = 221

Mobius inversion ORIGINAL inverse F(n/1) f(14) ORIGINAL a times divisor := mul(20, 14)

Mobius inversion ORIGINAL inverse F(n/1) f(14) ORIGINAL a times divisor = 280

Mobius inversion ORIGINAL inverse F(n/1) f(14) plus ORIGINAL b := sum(280, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(14) plus ORIGINAL b = 281

Mobius inversion ORIGINAL inverse F(n/1) f(21) ORIGINAL a times divisor := mul(20, 21)

Mobius inversion ORIGINAL inverse F(n/1) f(21) ORIGINAL a times divisor = 420

Mobius inversion ORIGINAL inverse F(n/1) f(21) plus ORIGINAL b := sum(420, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(21) plus ORIGINAL b = 421

Mobius inversion ORIGINAL inverse F(n/1) f(22) ORIGINAL a times divisor := mul(20, 22)

Mobius inversion ORIGINAL inverse F(n/1) f(22) ORIGINAL a times divisor = 440

Mobius inversion ORIGINAL inverse F(n/1) f(22) plus ORIGINAL b := sum(440, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(22) plus ORIGINAL b = 441

Mobius inversion ORIGINAL inverse F(n/1) f(33) ORIGINAL a times divisor := mul(20, 33)

Mobius inversion ORIGINAL inverse F(n/1) f(33) ORIGINAL a times divisor = 660

Mobius inversion ORIGINAL inverse F(n/1) f(33) plus ORIGINAL b := sum(660, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(33) plus ORIGINAL b = 661

Mobius inversion ORIGINAL inverse F(n/1) f(42) ORIGINAL a times divisor := mul(20, 42)

Mobius inversion ORIGINAL inverse F(n/1) f(42) ORIGINAL a times divisor = 840

Mobius inversion ORIGINAL inverse F(n/1) f(42) plus ORIGINAL b := sum(840, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(42) plus ORIGINAL b = 841

Mobius inversion ORIGINAL inverse F(n/1) f(66) ORIGINAL a times divisor := mul(20, 66)

Mobius inversion ORIGINAL inverse F(n/1) f(66) ORIGINAL a times divisor = 1320

Mobius inversion ORIGINAL inverse F(n/1) f(66) plus ORIGINAL b := sum(1320, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(66) plus ORIGINAL b = 1321

Mobius inversion ORIGINAL inverse F(n/1) f(77) ORIGINAL a times divisor := mul(20, 77)

Mobius inversion ORIGINAL inverse F(n/1) f(77) ORIGINAL a times divisor = 1540

Mobius inversion ORIGINAL inverse F(n/1) f(77) plus ORIGINAL b := sum(1540, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(77) plus ORIGINAL b = 1541

Mobius inversion ORIGINAL inverse F(n/1) f(154) ORIGINAL a times divisor := mul(20, 154)

Mobius inversion ORIGINAL inverse F(n/1) f(154) ORIGINAL a times divisor = 3080

Mobius inversion ORIGINAL inverse F(n/1) f(154) plus ORIGINAL b := sum(3080, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(154) plus ORIGINAL b = 3081

Mobius inversion ORIGINAL inverse F(n/1) f(231) ORIGINAL a times divisor := mul(20, 231)

Mobius inversion ORIGINAL inverse F(n/1) f(231) ORIGINAL a times divisor = 4620

Mobius inversion ORIGINAL inverse F(n/1) f(231) plus ORIGINAL b := sum(4620, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(231) plus ORIGINAL b = 4621

Mobius inversion ORIGINAL inverse F(n/1) f(462) ORIGINAL a times divisor := mul(20, 462)

Mobius inversion ORIGINAL inverse F(n/1) f(462) ORIGINAL a times divisor = 9240

Mobius inversion ORIGINAL inverse F(n/1) f(462) plus ORIGINAL b := sum(9240, 1)

Mobius inversion ORIGINAL inverse F(n/1) f(462) plus ORIGINAL b = 9241

Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum := sum(21, 41, 61, 121, 141, 221, 281, 421, 441, 661, 841, 1321, 1541, 3081, 4621, 9241)

Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum = 23056

Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1) := mul(1, 23056)

Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1) = 23056

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

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

upf canonical complete product factor0 := mul(1, 2)

upf canonical complete product factor0 = 2

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

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor2:input=2;COMPLETE prime multiset=[2];distinct primes=[2]

mu=-1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2 := div(462, 2)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2 = 231

Mobius inversion ORIGINAL inverse F(n/2):actual positive input=231;check complete integer range1..231

ALL positive divisors INCREASING=[1, 3, 7, 11, 21, 33, 77, 231];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/2) f(3) ORIGINAL a times divisor := mul(20, 3)

Mobius inversion ORIGINAL inverse F(n/2) f(3) ORIGINAL a times divisor = 60

Mobius inversion ORIGINAL inverse F(n/2) f(3) plus ORIGINAL b := sum(60, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(3) plus ORIGINAL b = 61

Mobius inversion ORIGINAL inverse F(n/2) f(7) ORIGINAL a times divisor := mul(20, 7)

Mobius inversion ORIGINAL inverse F(n/2) f(7) ORIGINAL a times divisor = 140

Mobius inversion ORIGINAL inverse F(n/2) f(7) plus ORIGINAL b := sum(140, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(7) plus ORIGINAL b = 141

Mobius inversion ORIGINAL inverse F(n/2) f(11) ORIGINAL a times divisor := mul(20, 11)

Mobius inversion ORIGINAL inverse F(n/2) f(11) ORIGINAL a times divisor = 220

Mobius inversion ORIGINAL inverse F(n/2) f(11) plus ORIGINAL b := sum(220, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(11) plus ORIGINAL b = 221

Mobius inversion ORIGINAL inverse F(n/2) f(21) ORIGINAL a times divisor := mul(20, 21)

Mobius inversion ORIGINAL inverse F(n/2) f(21) ORIGINAL a times divisor = 420

Mobius inversion ORIGINAL inverse F(n/2) f(21) plus ORIGINAL b := sum(420, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(21) plus ORIGINAL b = 421

Mobius inversion ORIGINAL inverse F(n/2) f(33) ORIGINAL a times divisor := mul(20, 33)

Mobius inversion ORIGINAL inverse F(n/2) f(33) ORIGINAL a times divisor = 660

Mobius inversion ORIGINAL inverse F(n/2) f(33) plus ORIGINAL b := sum(660, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(33) plus ORIGINAL b = 661

Mobius inversion ORIGINAL inverse F(n/2) f(77) ORIGINAL a times divisor := mul(20, 77)

Mobius inversion ORIGINAL inverse F(n/2) f(77) ORIGINAL a times divisor = 1540

Mobius inversion ORIGINAL inverse F(n/2) f(77) plus ORIGINAL b := sum(1540, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(77) plus ORIGINAL b = 1541

Mobius inversion ORIGINAL inverse F(n/2) f(231) ORIGINAL a times divisor := mul(20, 231)

Mobius inversion ORIGINAL inverse F(n/2) f(231) ORIGINAL a times divisor = 4620

Mobius inversion ORIGINAL inverse F(n/2) f(231) plus ORIGINAL b := sum(4620, 1)

Mobius inversion ORIGINAL inverse F(n/2) f(231) plus ORIGINAL b = 4621

Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum := sum(21, 61, 141, 221, 421, 661, 1541, 4621)

Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum = 7688

Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2) := mul(-1, 7688)

Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2) = -7688

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor3:actual positive input for mu=3

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=3>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

upf canonical complete product factor0 := mul(1, 3)

upf canonical complete product factor0 = 3

exhausted trial divisors below2;terminal remaining=3;d*d>remaining;ORIGINAL n=3

complete increasing prime multiset=[3];full product=3;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor3:input=3;COMPLETE prime multiset=[3];distinct primes=[3]

mu=-1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor3 := div(462, 3)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor3 = 154

Mobius inversion ORIGINAL inverse F(n/3):actual positive input=154;check complete integer range1..154

ALL positive divisors INCREASING=[1, 2, 7, 11, 14, 22, 77, 154];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/3) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/3) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/3) f(2) ORIGINAL a times divisor := mul(20, 2)

Mobius inversion ORIGINAL inverse F(n/3) f(2) ORIGINAL a times divisor = 40

Mobius inversion ORIGINAL inverse F(n/3) f(2) plus ORIGINAL b := sum(40, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(2) plus ORIGINAL b = 41

Mobius inversion ORIGINAL inverse F(n/3) f(7) ORIGINAL a times divisor := mul(20, 7)

Mobius inversion ORIGINAL inverse F(n/3) f(7) ORIGINAL a times divisor = 140

Mobius inversion ORIGINAL inverse F(n/3) f(7) plus ORIGINAL b := sum(140, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(7) plus ORIGINAL b = 141

Mobius inversion ORIGINAL inverse F(n/3) f(11) ORIGINAL a times divisor := mul(20, 11)

Mobius inversion ORIGINAL inverse F(n/3) f(11) ORIGINAL a times divisor = 220

Mobius inversion ORIGINAL inverse F(n/3) f(11) plus ORIGINAL b := sum(220, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(11) plus ORIGINAL b = 221

Mobius inversion ORIGINAL inverse F(n/3) f(14) ORIGINAL a times divisor := mul(20, 14)

Mobius inversion ORIGINAL inverse F(n/3) f(14) ORIGINAL a times divisor = 280

Mobius inversion ORIGINAL inverse F(n/3) f(14) plus ORIGINAL b := sum(280, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(14) plus ORIGINAL b = 281

Mobius inversion ORIGINAL inverse F(n/3) f(22) ORIGINAL a times divisor := mul(20, 22)

Mobius inversion ORIGINAL inverse F(n/3) f(22) ORIGINAL a times divisor = 440

Mobius inversion ORIGINAL inverse F(n/3) f(22) plus ORIGINAL b := sum(440, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(22) plus ORIGINAL b = 441

Mobius inversion ORIGINAL inverse F(n/3) f(77) ORIGINAL a times divisor := mul(20, 77)

Mobius inversion ORIGINAL inverse F(n/3) f(77) ORIGINAL a times divisor = 1540

Mobius inversion ORIGINAL inverse F(n/3) f(77) plus ORIGINAL b := sum(1540, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(77) plus ORIGINAL b = 1541

Mobius inversion ORIGINAL inverse F(n/3) f(154) ORIGINAL a times divisor := mul(20, 154)

Mobius inversion ORIGINAL inverse F(n/3) f(154) ORIGINAL a times divisor = 3080

Mobius inversion ORIGINAL inverse F(n/3) f(154) plus ORIGINAL b := sum(3080, 1)

Mobius inversion ORIGINAL inverse F(n/3) f(154) plus ORIGINAL b = 3081

Mobius inversion ORIGINAL inverse F(n/3) full forward divisor sum := sum(21, 41, 141, 221, 281, 441, 1541, 3081)

Mobius inversion ORIGINAL inverse F(n/3) full forward divisor sum = 5768

Mobius inversion ORIGINAL inverse mu(3) times SAME F(n/3) := mul(-1, 5768)

Mobius inversion ORIGINAL inverse mu(3) times SAME F(n/3) = -5768

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor6:actual positive input for mu=6

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=6>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

upf extract divisor2 occurrence0 := div(6, 2)

upf extract divisor2 occurrence0 = 3

next divisor=2;previous remaining=6;all smaller divisors exhausted

extracted multiplicity=1;next remaining=3;remaining modulo2=1;extracted multiset=[2]

upf canonical complete product factor0 := mul(1, 2)

upf canonical complete product factor0 = 2

upf canonical complete product factor1 := mul(2, 3)

upf canonical complete product factor1 = 6

exhausted trial divisors below3;terminal remaining=3;d*d>remaining;ORIGINAL n=6

complete increasing prime multiset=[2, 3];full product=6;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor6:input=6;COMPLETE prime multiset=[2, 3];distinct primes=[2, 3]

mu=1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor6 := div(462, 6)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor6 = 77

Mobius inversion ORIGINAL inverse F(n/6):actual positive input=77;check complete integer range1..77

ALL positive divisors INCREASING=[1, 7, 11, 77];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/6) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/6) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/6) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/6) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/6) f(7) ORIGINAL a times divisor := mul(20, 7)

Mobius inversion ORIGINAL inverse F(n/6) f(7) ORIGINAL a times divisor = 140

Mobius inversion ORIGINAL inverse F(n/6) f(7) plus ORIGINAL b := sum(140, 1)

Mobius inversion ORIGINAL inverse F(n/6) f(7) plus ORIGINAL b = 141

Mobius inversion ORIGINAL inverse F(n/6) f(11) ORIGINAL a times divisor := mul(20, 11)

Mobius inversion ORIGINAL inverse F(n/6) f(11) ORIGINAL a times divisor = 220

Mobius inversion ORIGINAL inverse F(n/6) f(11) plus ORIGINAL b := sum(220, 1)

Mobius inversion ORIGINAL inverse F(n/6) f(11) plus ORIGINAL b = 221

Mobius inversion ORIGINAL inverse F(n/6) f(77) ORIGINAL a times divisor := mul(20, 77)

Mobius inversion ORIGINAL inverse F(n/6) f(77) ORIGINAL a times divisor = 1540

Mobius inversion ORIGINAL inverse F(n/6) f(77) plus ORIGINAL b := sum(1540, 1)

Mobius inversion ORIGINAL inverse F(n/6) f(77) plus ORIGINAL b = 1541

Mobius inversion ORIGINAL inverse F(n/6) full forward divisor sum := sum(21, 141, 221, 1541)

Mobius inversion ORIGINAL inverse F(n/6) full forward divisor sum = 1924

Mobius inversion ORIGINAL inverse mu(6) times SAME F(n/6) := mul(1, 1924)

Mobius inversion ORIGINAL inverse mu(6) times SAME F(n/6) = 1924

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor7:actual positive input for mu=7

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=7>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

next divisor=2;previous remaining=7;all smaller divisors exhausted

extracted multiplicity=0;next remaining=7;remaining modulo2=1;extracted multiset=[]

upf canonical complete product factor0 := mul(1, 7)

upf canonical complete product factor0 = 7

exhausted trial divisors below3;terminal remaining=7;d*d>remaining;ORIGINAL n=7

complete increasing prime multiset=[7];full product=7;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor7:input=7;COMPLETE prime multiset=[7];distinct primes=[7]

mu=-1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor7 := div(462, 7)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor7 = 66

Mobius inversion ORIGINAL inverse F(n/7):actual positive input=66;check complete integer range1..66

ALL positive divisors INCREASING=[1, 2, 3, 6, 11, 22, 33, 66];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/7) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/7) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/7) f(2) ORIGINAL a times divisor := mul(20, 2)

Mobius inversion ORIGINAL inverse F(n/7) f(2) ORIGINAL a times divisor = 40

Mobius inversion ORIGINAL inverse F(n/7) f(2) plus ORIGINAL b := sum(40, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(2) plus ORIGINAL b = 41

Mobius inversion ORIGINAL inverse F(n/7) f(3) ORIGINAL a times divisor := mul(20, 3)

Mobius inversion ORIGINAL inverse F(n/7) f(3) ORIGINAL a times divisor = 60

Mobius inversion ORIGINAL inverse F(n/7) f(3) plus ORIGINAL b := sum(60, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(3) plus ORIGINAL b = 61

Mobius inversion ORIGINAL inverse F(n/7) f(6) ORIGINAL a times divisor := mul(20, 6)

Mobius inversion ORIGINAL inverse F(n/7) f(6) ORIGINAL a times divisor = 120

Mobius inversion ORIGINAL inverse F(n/7) f(6) plus ORIGINAL b := sum(120, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(6) plus ORIGINAL b = 121

Mobius inversion ORIGINAL inverse F(n/7) f(11) ORIGINAL a times divisor := mul(20, 11)

Mobius inversion ORIGINAL inverse F(n/7) f(11) ORIGINAL a times divisor = 220

Mobius inversion ORIGINAL inverse F(n/7) f(11) plus ORIGINAL b := sum(220, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(11) plus ORIGINAL b = 221

Mobius inversion ORIGINAL inverse F(n/7) f(22) ORIGINAL a times divisor := mul(20, 22)

Mobius inversion ORIGINAL inverse F(n/7) f(22) ORIGINAL a times divisor = 440

Mobius inversion ORIGINAL inverse F(n/7) f(22) plus ORIGINAL b := sum(440, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(22) plus ORIGINAL b = 441

Mobius inversion ORIGINAL inverse F(n/7) f(33) ORIGINAL a times divisor := mul(20, 33)

Mobius inversion ORIGINAL inverse F(n/7) f(33) ORIGINAL a times divisor = 660

Mobius inversion ORIGINAL inverse F(n/7) f(33) plus ORIGINAL b := sum(660, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(33) plus ORIGINAL b = 661

Mobius inversion ORIGINAL inverse F(n/7) f(66) ORIGINAL a times divisor := mul(20, 66)

Mobius inversion ORIGINAL inverse F(n/7) f(66) ORIGINAL a times divisor = 1320

Mobius inversion ORIGINAL inverse F(n/7) f(66) plus ORIGINAL b := sum(1320, 1)

Mobius inversion ORIGINAL inverse F(n/7) f(66) plus ORIGINAL b = 1321

Mobius inversion ORIGINAL inverse F(n/7) full forward divisor sum := sum(21, 41, 61, 121, 221, 441, 661, 1321)

Mobius inversion ORIGINAL inverse F(n/7) full forward divisor sum = 2888

Mobius inversion ORIGINAL inverse mu(7) times SAME F(n/7) := mul(-1, 2888)

Mobius inversion ORIGINAL inverse mu(7) times SAME F(n/7) = -2888

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor11:actual positive input for mu=11

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=11>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

next divisor=2;previous remaining=11;all smaller divisors exhausted

extracted multiplicity=0;next remaining=11;remaining modulo2=1;extracted multiset=[]

next divisor=3;previous remaining=11;all smaller divisors exhausted

extracted multiplicity=0;next remaining=11;remaining modulo3=2;extracted multiset=[]

upf canonical complete product factor0 := mul(1, 11)

upf canonical complete product factor0 = 11

exhausted trial divisors below4;terminal remaining=11;d*d>remaining;ORIGINAL n=11

complete increasing prime multiset=[11];full product=11;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor11:input=11;COMPLETE prime multiset=[11];distinct primes=[11]

mu=-1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor11 := div(462, 11)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor11 = 42

Mobius inversion ORIGINAL inverse F(n/11):actual positive input=42;check complete integer range1..42

ALL positive divisors INCREASING=[1, 2, 3, 6, 7, 14, 21, 42];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/11) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/11) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/11) f(2) ORIGINAL a times divisor := mul(20, 2)

Mobius inversion ORIGINAL inverse F(n/11) f(2) ORIGINAL a times divisor = 40

Mobius inversion ORIGINAL inverse F(n/11) f(2) plus ORIGINAL b := sum(40, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(2) plus ORIGINAL b = 41

Mobius inversion ORIGINAL inverse F(n/11) f(3) ORIGINAL a times divisor := mul(20, 3)

Mobius inversion ORIGINAL inverse F(n/11) f(3) ORIGINAL a times divisor = 60

Mobius inversion ORIGINAL inverse F(n/11) f(3) plus ORIGINAL b := sum(60, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(3) plus ORIGINAL b = 61

Mobius inversion ORIGINAL inverse F(n/11) f(6) ORIGINAL a times divisor := mul(20, 6)

Mobius inversion ORIGINAL inverse F(n/11) f(6) ORIGINAL a times divisor = 120

Mobius inversion ORIGINAL inverse F(n/11) f(6) plus ORIGINAL b := sum(120, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(6) plus ORIGINAL b = 121

Mobius inversion ORIGINAL inverse F(n/11) f(7) ORIGINAL a times divisor := mul(20, 7)

Mobius inversion ORIGINAL inverse F(n/11) f(7) ORIGINAL a times divisor = 140

Mobius inversion ORIGINAL inverse F(n/11) f(7) plus ORIGINAL b := sum(140, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(7) plus ORIGINAL b = 141

Mobius inversion ORIGINAL inverse F(n/11) f(14) ORIGINAL a times divisor := mul(20, 14)

Mobius inversion ORIGINAL inverse F(n/11) f(14) ORIGINAL a times divisor = 280

Mobius inversion ORIGINAL inverse F(n/11) f(14) plus ORIGINAL b := sum(280, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(14) plus ORIGINAL b = 281

Mobius inversion ORIGINAL inverse F(n/11) f(21) ORIGINAL a times divisor := mul(20, 21)

Mobius inversion ORIGINAL inverse F(n/11) f(21) ORIGINAL a times divisor = 420

Mobius inversion ORIGINAL inverse F(n/11) f(21) plus ORIGINAL b := sum(420, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(21) plus ORIGINAL b = 421

Mobius inversion ORIGINAL inverse F(n/11) f(42) ORIGINAL a times divisor := mul(20, 42)

Mobius inversion ORIGINAL inverse F(n/11) f(42) ORIGINAL a times divisor = 840

Mobius inversion ORIGINAL inverse F(n/11) f(42) plus ORIGINAL b := sum(840, 1)

Mobius inversion ORIGINAL inverse F(n/11) f(42) plus ORIGINAL b = 841

Mobius inversion ORIGINAL inverse F(n/11) full forward divisor sum := sum(21, 41, 61, 121, 141, 281, 421, 841)

Mobius inversion ORIGINAL inverse F(n/11) full forward divisor sum = 1928

Mobius inversion ORIGINAL inverse mu(11) times SAME F(n/11) := mul(-1, 1928)

Mobius inversion ORIGINAL inverse mu(11) times SAME F(n/11) = -1928

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor14:actual positive input for mu=14

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=14>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

upf extract divisor2 occurrence0 := div(14, 2)

upf extract divisor2 occurrence0 = 7

next divisor=2;previous remaining=14;all smaller divisors exhausted

extracted multiplicity=1;next remaining=7;remaining modulo2=1;extracted multiset=[2]

upf canonical complete product factor0 := mul(1, 2)

upf canonical complete product factor0 = 2

upf canonical complete product factor1 := mul(2, 7)

upf canonical complete product factor1 = 14

exhausted trial divisors below3;terminal remaining=7;d*d>remaining;ORIGINAL n=14

complete increasing prime multiset=[2, 7];full product=14;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor14:input=14;COMPLETE prime multiset=[2, 7];distinct primes=[2, 7]

mu=1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor14 := div(462, 14)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor14 = 33

Mobius inversion ORIGINAL inverse F(n/14):actual positive input=33;check complete integer range1..33

ALL positive divisors INCREASING=[1, 3, 11, 33];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/14) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/14) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/14) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/14) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/14) f(3) ORIGINAL a times divisor := mul(20, 3)

Mobius inversion ORIGINAL inverse F(n/14) f(3) ORIGINAL a times divisor = 60

Mobius inversion ORIGINAL inverse F(n/14) f(3) plus ORIGINAL b := sum(60, 1)

Mobius inversion ORIGINAL inverse F(n/14) f(3) plus ORIGINAL b = 61

Mobius inversion ORIGINAL inverse F(n/14) f(11) ORIGINAL a times divisor := mul(20, 11)

Mobius inversion ORIGINAL inverse F(n/14) f(11) ORIGINAL a times divisor = 220

Mobius inversion ORIGINAL inverse F(n/14) f(11) plus ORIGINAL b := sum(220, 1)

Mobius inversion ORIGINAL inverse F(n/14) f(11) plus ORIGINAL b = 221

Mobius inversion ORIGINAL inverse F(n/14) f(33) ORIGINAL a times divisor := mul(20, 33)

Mobius inversion ORIGINAL inverse F(n/14) f(33) ORIGINAL a times divisor = 660

Mobius inversion ORIGINAL inverse F(n/14) f(33) plus ORIGINAL b := sum(660, 1)

Mobius inversion ORIGINAL inverse F(n/14) f(33) plus ORIGINAL b = 661

Mobius inversion ORIGINAL inverse F(n/14) full forward divisor sum := sum(21, 61, 221, 661)

Mobius inversion ORIGINAL inverse F(n/14) full forward divisor sum = 964

Mobius inversion ORIGINAL inverse mu(14) times SAME F(n/14) := mul(1, 964)

Mobius inversion ORIGINAL inverse mu(14) times SAME F(n/14) = 964

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor21:actual positive input for mu=21

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=21>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

next divisor=2;previous remaining=21;all smaller divisors exhausted

extracted multiplicity=0;next remaining=21;remaining modulo2=1;extracted multiset=[]

upf extract divisor3 occurrence0 := div(21, 3)

upf extract divisor3 occurrence0 = 7

next divisor=3;previous remaining=21;all smaller divisors exhausted

extracted multiplicity=1;next remaining=7;remaining modulo3=1;extracted multiset=[3]

upf canonical complete product factor0 := mul(1, 3)

upf canonical complete product factor0 = 3

upf canonical complete product factor1 := mul(3, 7)

upf canonical complete product factor1 = 21

exhausted trial divisors below4;terminal remaining=7;d*d>remaining;ORIGINAL n=21

complete increasing prime multiset=[3, 7];full product=21;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor21:input=21;COMPLETE prime multiset=[3, 7];distinct primes=[3, 7]

mu=1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor21 := div(462, 21)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor21 = 22

Mobius inversion ORIGINAL inverse F(n/21):actual positive input=22;check complete integer range1..22

ALL positive divisors INCREASING=[1, 2, 11, 22];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/21) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/21) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/21) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/21) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/21) f(2) ORIGINAL a times divisor := mul(20, 2)

Mobius inversion ORIGINAL inverse F(n/21) f(2) ORIGINAL a times divisor = 40

Mobius inversion ORIGINAL inverse F(n/21) f(2) plus ORIGINAL b := sum(40, 1)

Mobius inversion ORIGINAL inverse F(n/21) f(2) plus ORIGINAL b = 41

Mobius inversion ORIGINAL inverse F(n/21) f(11) ORIGINAL a times divisor := mul(20, 11)

Mobius inversion ORIGINAL inverse F(n/21) f(11) ORIGINAL a times divisor = 220

Mobius inversion ORIGINAL inverse F(n/21) f(11) plus ORIGINAL b := sum(220, 1)

Mobius inversion ORIGINAL inverse F(n/21) f(11) plus ORIGINAL b = 221

Mobius inversion ORIGINAL inverse F(n/21) f(22) ORIGINAL a times divisor := mul(20, 22)

Mobius inversion ORIGINAL inverse F(n/21) f(22) ORIGINAL a times divisor = 440

Mobius inversion ORIGINAL inverse F(n/21) f(22) plus ORIGINAL b := sum(440, 1)

Mobius inversion ORIGINAL inverse F(n/21) f(22) plus ORIGINAL b = 441

Mobius inversion ORIGINAL inverse F(n/21) full forward divisor sum := sum(21, 41, 221, 441)

Mobius inversion ORIGINAL inverse F(n/21) full forward divisor sum = 724

Mobius inversion ORIGINAL inverse mu(21) times SAME F(n/21) := mul(1, 724)

Mobius inversion ORIGINAL inverse mu(21) times SAME F(n/21) = 724

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor22:actual positive input for mu=22

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=22>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

upf extract divisor2 occurrence0 := div(22, 2)

upf extract divisor2 occurrence0 = 11

next divisor=2;previous remaining=22;all smaller divisors exhausted

extracted multiplicity=1;next remaining=11;remaining modulo2=1;extracted multiset=[2]

next divisor=3;previous remaining=11;all smaller divisors exhausted

extracted multiplicity=0;next remaining=11;remaining modulo3=2;extracted multiset=[2]

upf canonical complete product factor0 := mul(1, 2)

upf canonical complete product factor0 = 2

upf canonical complete product factor1 := mul(2, 11)

upf canonical complete product factor1 = 22

exhausted trial divisors below4;terminal remaining=11;d*d>remaining;ORIGINAL n=22

complete increasing prime multiset=[2, 11];full product=22;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor22:input=22;COMPLETE prime multiset=[2, 11];distinct primes=[2, 11]

mu=1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor22 := div(462, 22)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor22 = 21

Mobius inversion ORIGINAL inverse F(n/22):actual positive input=21;check complete integer range1..21

ALL positive divisors INCREASING=[1, 3, 7, 21];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/22) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/22) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/22) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/22) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/22) f(3) ORIGINAL a times divisor := mul(20, 3)

Mobius inversion ORIGINAL inverse F(n/22) f(3) ORIGINAL a times divisor = 60

Mobius inversion ORIGINAL inverse F(n/22) f(3) plus ORIGINAL b := sum(60, 1)

Mobius inversion ORIGINAL inverse F(n/22) f(3) plus ORIGINAL b = 61

Mobius inversion ORIGINAL inverse F(n/22) f(7) ORIGINAL a times divisor := mul(20, 7)

Mobius inversion ORIGINAL inverse F(n/22) f(7) ORIGINAL a times divisor = 140

Mobius inversion ORIGINAL inverse F(n/22) f(7) plus ORIGINAL b := sum(140, 1)

Mobius inversion ORIGINAL inverse F(n/22) f(7) plus ORIGINAL b = 141

Mobius inversion ORIGINAL inverse F(n/22) f(21) ORIGINAL a times divisor := mul(20, 21)

Mobius inversion ORIGINAL inverse F(n/22) f(21) ORIGINAL a times divisor = 420

Mobius inversion ORIGINAL inverse F(n/22) f(21) plus ORIGINAL b := sum(420, 1)

Mobius inversion ORIGINAL inverse F(n/22) f(21) plus ORIGINAL b = 421

Mobius inversion ORIGINAL inverse F(n/22) full forward divisor sum := sum(21, 61, 141, 421)

Mobius inversion ORIGINAL inverse F(n/22) full forward divisor sum = 644

Mobius inversion ORIGINAL inverse mu(22) times SAME F(n/22) := mul(1, 644)

Mobius inversion ORIGINAL inverse mu(22) times SAME F(n/22) = 644

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor33:actual positive input for mu=33

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=33>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

next divisor=2;previous remaining=33;all smaller divisors exhausted

extracted multiplicity=0;next remaining=33;remaining modulo2=1;extracted multiset=[]

upf extract divisor3 occurrence0 := div(33, 3)

upf extract divisor3 occurrence0 = 11

next divisor=3;previous remaining=33;all smaller divisors exhausted

extracted multiplicity=1;next remaining=11;remaining modulo3=2;extracted multiset=[3]

upf canonical complete product factor0 := mul(1, 3)

upf canonical complete product factor0 = 3

upf canonical complete product factor1 := mul(3, 11)

upf canonical complete product factor1 = 33

exhausted trial divisors below4;terminal remaining=11;d*d>remaining;ORIGINAL n=33

complete increasing prime multiset=[3, 11];full product=33;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor33:input=33;COMPLETE prime multiset=[3, 11];distinct primes=[3, 11]

mu=1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor33 := div(462, 33)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor33 = 14

Mobius inversion ORIGINAL inverse F(n/33):actual positive input=14;check complete integer range1..14

ALL positive divisors INCREASING=[1, 2, 7, 14];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/33) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/33) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/33) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/33) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/33) f(2) ORIGINAL a times divisor := mul(20, 2)

Mobius inversion ORIGINAL inverse F(n/33) f(2) ORIGINAL a times divisor = 40

Mobius inversion ORIGINAL inverse F(n/33) f(2) plus ORIGINAL b := sum(40, 1)

Mobius inversion ORIGINAL inverse F(n/33) f(2) plus ORIGINAL b = 41

Mobius inversion ORIGINAL inverse F(n/33) f(7) ORIGINAL a times divisor := mul(20, 7)

Mobius inversion ORIGINAL inverse F(n/33) f(7) ORIGINAL a times divisor = 140

Mobius inversion ORIGINAL inverse F(n/33) f(7) plus ORIGINAL b := sum(140, 1)

Mobius inversion ORIGINAL inverse F(n/33) f(7) plus ORIGINAL b = 141

Mobius inversion ORIGINAL inverse F(n/33) f(14) ORIGINAL a times divisor := mul(20, 14)

Mobius inversion ORIGINAL inverse F(n/33) f(14) ORIGINAL a times divisor = 280

Mobius inversion ORIGINAL inverse F(n/33) f(14) plus ORIGINAL b := sum(280, 1)

Mobius inversion ORIGINAL inverse F(n/33) f(14) plus ORIGINAL b = 281

Mobius inversion ORIGINAL inverse F(n/33) full forward divisor sum := sum(21, 41, 141, 281)

Mobius inversion ORIGINAL inverse F(n/33) full forward divisor sum = 484

Mobius inversion ORIGINAL inverse mu(33) times SAME F(n/33) := mul(1, 484)

Mobius inversion ORIGINAL inverse mu(33) times SAME F(n/33) = 484

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor42:actual positive input for mu=42

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=42>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

upf extract divisor2 occurrence0 := div(42, 2)

upf extract divisor2 occurrence0 = 21

next divisor=2;previous remaining=42;all smaller divisors exhausted

extracted multiplicity=1;next remaining=21;remaining modulo2=1;extracted multiset=[2]

upf extract divisor3 occurrence1 := div(21, 3)

upf extract divisor3 occurrence1 = 7

next divisor=3;previous remaining=21;all smaller divisors exhausted

extracted multiplicity=1;next remaining=7;remaining modulo3=1;extracted multiset=[2, 3]

upf canonical complete product factor0 := mul(1, 2)

upf canonical complete product factor0 = 2

upf canonical complete product factor1 := mul(2, 3)

upf canonical complete product factor1 = 6

upf canonical complete product factor2 := mul(6, 7)

upf canonical complete product factor2 = 42

exhausted trial divisors below4;terminal remaining=7;d*d>remaining;ORIGINAL n=42

complete increasing prime multiset=[2, 3, 7];full product=42;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor42:input=42;COMPLETE prime multiset=[2, 3, 7];distinct primes=[2, 3, 7]

mu=-1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor42 := div(462, 42)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor42 = 11

Mobius inversion ORIGINAL inverse F(n/42):actual positive input=11;check complete integer range1..11

ALL positive divisors INCREASING=[1, 11];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/42) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/42) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/42) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/42) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/42) f(11) ORIGINAL a times divisor := mul(20, 11)

Mobius inversion ORIGINAL inverse F(n/42) f(11) ORIGINAL a times divisor = 220

Mobius inversion ORIGINAL inverse F(n/42) f(11) plus ORIGINAL b := sum(220, 1)

Mobius inversion ORIGINAL inverse F(n/42) f(11) plus ORIGINAL b = 221

Mobius inversion ORIGINAL inverse F(n/42) full forward divisor sum := sum(21, 221)

Mobius inversion ORIGINAL inverse F(n/42) full forward divisor sum = 242

Mobius inversion ORIGINAL inverse mu(42) times SAME F(n/42) := mul(-1, 242)

Mobius inversion ORIGINAL inverse mu(42) times SAME F(n/42) = -242

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor66:actual positive input for mu=66

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=66>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

upf extract divisor2 occurrence0 := div(66, 2)

upf extract divisor2 occurrence0 = 33

next divisor=2;previous remaining=66;all smaller divisors exhausted

extracted multiplicity=1;next remaining=33;remaining modulo2=1;extracted multiset=[2]

upf extract divisor3 occurrence1 := div(33, 3)

upf extract divisor3 occurrence1 = 11

next divisor=3;previous remaining=33;all smaller divisors exhausted

extracted multiplicity=1;next remaining=11;remaining modulo3=2;extracted multiset=[2, 3]

upf canonical complete product factor0 := mul(1, 2)

upf canonical complete product factor0 = 2

upf canonical complete product factor1 := mul(2, 3)

upf canonical complete product factor1 = 6

upf canonical complete product factor2 := mul(6, 11)

upf canonical complete product factor2 = 66

exhausted trial divisors below4;terminal remaining=11;d*d>remaining;ORIGINAL n=66

complete increasing prime multiset=[2, 3, 11];full product=66;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor66:input=66;COMPLETE prime multiset=[2, 3, 11];distinct primes=[2, 3, 11]

mu=-1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor66 := div(462, 66)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor66 = 7

Mobius inversion ORIGINAL inverse F(n/66):actual positive input=7;check complete integer range1..7

ALL positive divisors INCREASING=[1, 7];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/66) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/66) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/66) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/66) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/66) f(7) ORIGINAL a times divisor := mul(20, 7)

Mobius inversion ORIGINAL inverse F(n/66) f(7) ORIGINAL a times divisor = 140

Mobius inversion ORIGINAL inverse F(n/66) f(7) plus ORIGINAL b := sum(140, 1)

Mobius inversion ORIGINAL inverse F(n/66) f(7) plus ORIGINAL b = 141

Mobius inversion ORIGINAL inverse F(n/66) full forward divisor sum := sum(21, 141)

Mobius inversion ORIGINAL inverse F(n/66) full forward divisor sum = 162

Mobius inversion ORIGINAL inverse mu(66) times SAME F(n/66) := mul(-1, 162)

Mobius inversion ORIGINAL inverse mu(66) times SAME F(n/66) = -162

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor77:actual positive input for mu=77

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=77>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

next divisor=2;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo2=1;extracted multiset=[]

next divisor=3;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo3=2;extracted multiset=[]

next divisor=4;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo4=1;extracted multiset=[]

next divisor=5;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo5=2;extracted multiset=[]

next divisor=6;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo6=5;extracted multiset=[]

upf extract divisor7 occurrence0 := div(77, 7)

upf extract divisor7 occurrence0 = 11

next divisor=7;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=1;next remaining=11;remaining modulo7=4;extracted multiset=[7]

upf canonical complete product factor0 := mul(1, 7)

upf canonical complete product factor0 = 7

upf canonical complete product factor1 := mul(7, 11)

upf canonical complete product factor1 = 77

exhausted trial divisors below8;terminal remaining=11;d*d>remaining;ORIGINAL n=77

complete increasing prime multiset=[7, 11];full product=77;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor77:input=77;COMPLETE prime multiset=[7, 11];distinct primes=[7, 11]

mu=1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor77 := div(462, 77)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor77 = 6

Mobius inversion ORIGINAL inverse F(n/77):actual positive input=6;check complete integer range1..6

ALL positive divisors INCREASING=[1, 2, 3, 6];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/77) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/77) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/77) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/77) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/77) f(2) ORIGINAL a times divisor := mul(20, 2)

Mobius inversion ORIGINAL inverse F(n/77) f(2) ORIGINAL a times divisor = 40

Mobius inversion ORIGINAL inverse F(n/77) f(2) plus ORIGINAL b := sum(40, 1)

Mobius inversion ORIGINAL inverse F(n/77) f(2) plus ORIGINAL b = 41

Mobius inversion ORIGINAL inverse F(n/77) f(3) ORIGINAL a times divisor := mul(20, 3)

Mobius inversion ORIGINAL inverse F(n/77) f(3) ORIGINAL a times divisor = 60

Mobius inversion ORIGINAL inverse F(n/77) f(3) plus ORIGINAL b := sum(60, 1)

Mobius inversion ORIGINAL inverse F(n/77) f(3) plus ORIGINAL b = 61

Mobius inversion ORIGINAL inverse F(n/77) f(6) ORIGINAL a times divisor := mul(20, 6)

Mobius inversion ORIGINAL inverse F(n/77) f(6) ORIGINAL a times divisor = 120

Mobius inversion ORIGINAL inverse F(n/77) f(6) plus ORIGINAL b := sum(120, 1)

Mobius inversion ORIGINAL inverse F(n/77) f(6) plus ORIGINAL b = 121

Mobius inversion ORIGINAL inverse F(n/77) full forward divisor sum := sum(21, 41, 61, 121)

Mobius inversion ORIGINAL inverse F(n/77) full forward divisor sum = 244

Mobius inversion ORIGINAL inverse mu(77) times SAME F(n/77) := mul(1, 244)

Mobius inversion ORIGINAL inverse mu(77) times SAME F(n/77) = 244

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor154:actual positive input for mu=154

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=154>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

upf extract divisor2 occurrence0 := div(154, 2)

upf extract divisor2 occurrence0 = 77

next divisor=2;previous remaining=154;all smaller divisors exhausted

extracted multiplicity=1;next remaining=77;remaining modulo2=1;extracted multiset=[2]

next divisor=3;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo3=2;extracted multiset=[2]

next divisor=4;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo4=1;extracted multiset=[2]

next divisor=5;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo5=2;extracted multiset=[2]

next divisor=6;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo6=5;extracted multiset=[2]

upf extract divisor7 occurrence1 := div(77, 7)

upf extract divisor7 occurrence1 = 11

next divisor=7;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=1;next remaining=11;remaining modulo7=4;extracted multiset=[2, 7]

upf canonical complete product factor0 := mul(1, 2)

upf canonical complete product factor0 = 2

upf canonical complete product factor1 := mul(2, 7)

upf canonical complete product factor1 = 14

upf canonical complete product factor2 := mul(14, 11)

upf canonical complete product factor2 = 154

exhausted trial divisors below8;terminal remaining=11;d*d>remaining;ORIGINAL n=154

complete increasing prime multiset=[2, 7, 11];full product=154;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor154:input=154;COMPLETE prime multiset=[2, 7, 11];distinct primes=[2, 7, 11]

mu=-1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor154 := div(462, 154)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor154 = 3

Mobius inversion ORIGINAL inverse F(n/154):actual positive input=3;check complete integer range1..3

ALL positive divisors INCREASING=[1, 3];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/154) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/154) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/154) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/154) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/154) f(3) ORIGINAL a times divisor := mul(20, 3)

Mobius inversion ORIGINAL inverse F(n/154) f(3) ORIGINAL a times divisor = 60

Mobius inversion ORIGINAL inverse F(n/154) f(3) plus ORIGINAL b := sum(60, 1)

Mobius inversion ORIGINAL inverse F(n/154) f(3) plus ORIGINAL b = 61

Mobius inversion ORIGINAL inverse F(n/154) full forward divisor sum := sum(21, 61)

Mobius inversion ORIGINAL inverse F(n/154) full forward divisor sum = 82

Mobius inversion ORIGINAL inverse mu(154) times SAME F(n/154) := mul(-1, 82)

Mobius inversion ORIGINAL inverse mu(154) times SAME F(n/154) = -82

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor231:actual positive input for mu=231

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=231>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

next divisor=2;previous remaining=231;all smaller divisors exhausted

extracted multiplicity=0;next remaining=231;remaining modulo2=1;extracted multiset=[]

upf extract divisor3 occurrence0 := div(231, 3)

upf extract divisor3 occurrence0 = 77

next divisor=3;previous remaining=231;all smaller divisors exhausted

extracted multiplicity=1;next remaining=77;remaining modulo3=2;extracted multiset=[3]

next divisor=4;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo4=1;extracted multiset=[3]

next divisor=5;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo5=2;extracted multiset=[3]

next divisor=6;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo6=5;extracted multiset=[3]

upf extract divisor7 occurrence1 := div(77, 7)

upf extract divisor7 occurrence1 = 11

next divisor=7;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=1;next remaining=11;remaining modulo7=4;extracted multiset=[3, 7]

upf canonical complete product factor0 := mul(1, 3)

upf canonical complete product factor0 = 3

upf canonical complete product factor1 := mul(3, 7)

upf canonical complete product factor1 = 21

upf canonical complete product factor2 := mul(21, 11)

upf canonical complete product factor2 = 231

exhausted trial divisors below8;terminal remaining=11;d*d>remaining;ORIGINAL n=231

complete increasing prime multiset=[3, 7, 11];full product=231;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor231:input=231;COMPLETE prime multiset=[3, 7, 11];distinct primes=[3, 7, 11]

mu=-1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor231 := div(462, 231)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor231 = 2

Mobius inversion ORIGINAL inverse F(n/231):actual positive input=2;check complete integer range1..2

ALL positive divisors INCREASING=[1, 2];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/231) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/231) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/231) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/231) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/231) f(2) ORIGINAL a times divisor := mul(20, 2)

Mobius inversion ORIGINAL inverse F(n/231) f(2) ORIGINAL a times divisor = 40

Mobius inversion ORIGINAL inverse F(n/231) f(2) plus ORIGINAL b := sum(40, 1)

Mobius inversion ORIGINAL inverse F(n/231) f(2) plus ORIGINAL b = 41

Mobius inversion ORIGINAL inverse F(n/231) full forward divisor sum := sum(21, 41)

Mobius inversion ORIGINAL inverse F(n/231) full forward divisor sum = 62

Mobius inversion ORIGINAL inverse mu(231) times SAME F(n/231) := mul(-1, 62)

Mobius inversion ORIGINAL inverse mu(231) times SAME F(n/231) = -62

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor462:actual positive input for mu=462

complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search

ORIGINAL positive integer absolute magnitude=462>1

initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted

upf extract divisor2 occurrence0 := div(462, 2)

upf extract divisor2 occurrence0 = 231

next divisor=2;previous remaining=462;all smaller divisors exhausted

extracted multiplicity=1;next remaining=231;remaining modulo2=1;extracted multiset=[2]

upf extract divisor3 occurrence1 := div(231, 3)

upf extract divisor3 occurrence1 = 77

next divisor=3;previous remaining=231;all smaller divisors exhausted

extracted multiplicity=1;next remaining=77;remaining modulo3=2;extracted multiset=[2, 3]

next divisor=4;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo4=1;extracted multiset=[2, 3]

next divisor=5;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo5=2;extracted multiset=[2, 3]

next divisor=6;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=0;next remaining=77;remaining modulo6=5;extracted multiset=[2, 3]

upf extract divisor7 occurrence2 := div(77, 7)

upf extract divisor7 occurrence2 = 11

next divisor=7;previous remaining=77;all smaller divisors exhausted

extracted multiplicity=1;next remaining=11;remaining modulo7=4;extracted multiset=[2, 3, 7]

upf canonical complete product factor0 := mul(1, 2)

upf canonical complete product factor0 = 2

upf canonical complete product factor1 := mul(2, 3)

upf canonical complete product factor1 = 6

upf canonical complete product factor2 := mul(6, 7)

upf canonical complete product factor2 = 42

upf canonical complete product factor3 := mul(42, 11)

upf canonical complete product factor3 = 462

exhausted trial divisors below8;terminal remaining=11;d*d>remaining;ORIGINAL n=462

complete increasing prime multiset=[2, 3, 7, 11];full product=462;a composite terminal remainder would have an already tested smaller divisor

Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor462:input=462;COMPLETE prime multiset=[2, 3, 7, 11];distinct primes=[2, 3, 7, 11]

mu=1;empty product case=否;repeated prime=否

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor462 := div(462, 462)

Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor462 = 1

Mobius inversion ORIGINAL inverse F(n/462):actual positive input=1;check complete integer range1..1

ALL positive divisors INCREASING=[1];not only primes/proper divisors or all integers<=n

Mobius inversion ORIGINAL inverse F(n/462) f(1) ORIGINAL a times divisor := mul(20, 1)

Mobius inversion ORIGINAL inverse F(n/462) f(1) ORIGINAL a times divisor = 20

Mobius inversion ORIGINAL inverse F(n/462) f(1) plus ORIGINAL b := sum(20, 1)

Mobius inversion ORIGINAL inverse F(n/462) f(1) plus ORIGINAL b = 21

Mobius inversion ORIGINAL inverse F(n/462) full forward divisor sum := sum(21)

Mobius inversion ORIGINAL inverse F(n/462) full forward divisor sum = 21

Mobius inversion ORIGINAL inverse mu(462) times SAME F(n/462) := mul(1, 21)

Mobius inversion ORIGINAL inverse mu(462) times SAME F(n/462) = 21

Mobius inversion ORIGINAL inverse complete inverse-term sum := sum(23056, -7688, -5768, 1924, -2888, -1928, 964, 724, 644, 484, -242, -162, 244, -82, -62, 21)

Mobius inversion ORIGINAL inverse complete inverse-term sum = 9241

Mobius inversion ORIGINAL inverse direct ORIGINAL a times n := mul(20, 462)

Mobius inversion ORIGINAL inverse direct ORIGINAL a times n = 9240

Mobius inversion ORIGINAL inverse direct plus ORIGINAL b := sum(9240, 1)

Mobius inversion ORIGINAL inverse direct plus ORIGINAL b = 9241

Mobius inversion ORIGINAL inverse:actual n=462;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 462, 23056, 23056], [2, -1, 231, 7688, -7688], [3, -1, 154, 5768, -5768], [6, 1, 77, 1924, 1924], [7, -1, 66, 2888, -2888], [11, -1, 42, 1928, -1928], [14, 1, 33, 964, 964], [21, 1, 22, 724, 724], [22, 1, 21, 644, 644], [33, 1, 14, 484, 484], [42, -1, 11, 242, -242], [66, -1, 7, 162, -162], [77, 1, 6, 244, 244], [154, -1, 3, 82, -82], [231, -1, 2, 62, -62], [462, 1, 1, 21, 21]]

complete reconstructed=9241;direct f(n)=9241;sum_d mu(d)sum_e|n/d f(e)=sum_e|n f(e)sum_d|n/e mu(d)=f(n)

Mobius inversion ORIGINAL omitted-divisor partial sum := sum(-7688, -5768, 1924, -2888, -1928, 964, 724, 644, 484, -242, -162, 244, -82, -62, 21)

Mobius inversion ORIGINAL omitted-divisor partial sum = -13815

Mobius inversion complete minus partial := sub(9241, -13815)

Mobius inversion complete minus partial = 23056

ORIGINAL full divisors=[1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462];actual omitted divisor=1;remaining ORIGINAL-order divisors=[2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462]

complete=9241=f(n)=9241;partial=-13815;lost term=23056!=0;incomplete_certificate fixed No

逐步反向核對

• S385 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S384 · premise_and_result_audit — 以精確有理數重算 Mobius inversion complete minus partial，不以小數近似替代。
• S383 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL omitted-divisor partial sum，不以小數近似替代。
• S382 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S381 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse direct plus ORIGINAL b，不以小數近似替代。
• S380 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse direct ORIGINAL a times n，不以小數近似替代。
• S379 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse complete inverse-term sum，不以小數近似替代。
• S378 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(462) times SAME F(n/462)，不以小數近似替代。
• S377 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/462) full forward divisor sum，不以小數近似替代。
• S376 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/462) f(1) plus ORIGINAL b，不以小數近似替代。
• S375 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/462) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S374 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S373 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor462，不以小數近似替代。
• S372 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S371 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S370 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor3，不以小數近似替代。
• S369 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• S368 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S367 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S366 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S365 · premise_and_result_audit — 以精確有理數重算 upf extract divisor7 occurrence2，不以小數近似替代。
• S364 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S363 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S362 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S361 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S360 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence1，不以小數近似替代。
• S359 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S358 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S357 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S356 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S355 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(231) times SAME F(n/231)，不以小數近似替代。
• S354 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/231) full forward divisor sum，不以小數近似替代。
• S353 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/231) f(2) plus ORIGINAL b，不以小數近似替代。
• S352 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/231) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S351 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/231) f(1) plus ORIGINAL b，不以小數近似替代。
• S350 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/231) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S349 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S348 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor231，不以小數近似替代。
• S347 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S346 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S345 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• S344 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S343 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S342 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S341 · premise_and_result_audit — 以精確有理數重算 upf extract divisor7 occurrence1，不以小數近似替代。
• S340 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S339 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S338 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S337 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S336 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence0，不以小數近似替代。
• S335 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S334 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S333 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S332 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(154) times SAME F(n/154)，不以小數近似替代。
• S331 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/154) full forward divisor sum，不以小數近似替代。
• S330 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/154) f(3) plus ORIGINAL b，不以小數近似替代。
• S329 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/154) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S328 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/154) f(1) plus ORIGINAL b，不以小數近似替代。
• S327 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/154) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S326 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S325 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor154，不以小數近似替代。
• S324 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S323 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S322 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• S321 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S320 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S319 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S318 · premise_and_result_audit — 以精確有理數重算 upf extract divisor7 occurrence1，不以小數近似替代。
• S317 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S316 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S315 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S314 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S313 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S312 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S311 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S310 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S309 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(77) times SAME F(n/77)，不以小數近似替代。
• S308 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) full forward divisor sum，不以小數近似替代。
• S307 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) f(6) plus ORIGINAL b，不以小數近似替代。
• S306 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) f(6) ORIGINAL a times divisor，不以小數近似替代。
• S305 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) f(3) plus ORIGINAL b，不以小數近似替代。
• S304 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S303 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) f(2) plus ORIGINAL b，不以小數近似替代。
• S302 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S301 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) f(1) plus ORIGINAL b，不以小數近似替代。
• S300 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/77) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S299 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S298 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor77，不以小數近似替代。
• S297 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S296 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S295 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S294 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S293 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S292 · premise_and_result_audit — 以精確有理數重算 upf extract divisor7 occurrence0，不以小數近似替代。
• S291 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S290 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S289 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S288 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S287 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S286 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S285 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S284 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(66) times SAME F(n/66)，不以小數近似替代。
• S283 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/66) full forward divisor sum，不以小數近似替代。
• S282 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/66) f(7) plus ORIGINAL b，不以小數近似替代。
• S281 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/66) f(7) ORIGINAL a times divisor，不以小數近似替代。
• S280 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/66) f(1) plus ORIGINAL b，不以小數近似替代。
• S279 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/66) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S278 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S277 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor66，不以小數近似替代。
• S276 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S275 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S274 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• S273 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S272 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S271 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S270 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence1，不以小數近似替代。
• S269 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S268 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S267 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S266 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S265 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(42) times SAME F(n/42)，不以小數近似替代。
• S264 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/42) full forward divisor sum，不以小數近似替代。
• S263 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/42) f(11) plus ORIGINAL b，不以小數近似替代。
• S262 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/42) f(11) ORIGINAL a times divisor，不以小數近似替代。
• S261 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/42) f(1) plus ORIGINAL b，不以小數近似替代。
• S260 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/42) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S259 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S258 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor42，不以小數近似替代。
• S257 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S256 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S255 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• S254 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S253 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S252 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S251 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence1，不以小數近似替代。
• S250 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S249 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S248 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S247 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S246 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(33) times SAME F(n/33)，不以小數近似替代。
• S245 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) full forward divisor sum，不以小數近似替代。
• S244 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) f(14) plus ORIGINAL b，不以小數近似替代。
• S243 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) f(14) ORIGINAL a times divisor，不以小數近似替代。
• S242 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) f(7) plus ORIGINAL b，不以小數近似替代。
• S241 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) f(7) ORIGINAL a times divisor，不以小數近似替代。
• S240 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) f(2) plus ORIGINAL b，不以小數近似替代。
• S239 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S238 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) f(1) plus ORIGINAL b，不以小數近似替代。
• S237 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/33) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S236 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S235 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor33，不以小數近似替代。
• S234 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S233 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S232 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S231 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S230 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S229 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence0，不以小數近似替代。
• S228 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S227 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S226 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S225 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(22) times SAME F(n/22)，不以小數近似替代。
• S224 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) full forward divisor sum，不以小數近似替代。
• S223 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) f(21) plus ORIGINAL b，不以小數近似替代。
• S222 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) f(21) ORIGINAL a times divisor，不以小數近似替代。
• S221 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) f(7) plus ORIGINAL b，不以小數近似替代。
• S220 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) f(7) ORIGINAL a times divisor，不以小數近似替代。
• S219 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) f(3) plus ORIGINAL b，不以小數近似替代。
• S218 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S217 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) f(1) plus ORIGINAL b，不以小數近似替代。
• S216 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/22) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S215 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S214 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor22，不以小數近似替代。
• S213 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S212 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S211 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S210 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S209 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S208 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S207 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S206 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S205 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S204 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(21) times SAME F(n/21)，不以小數近似替代。
• S203 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) full forward divisor sum，不以小數近似替代。
• S202 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) f(22) plus ORIGINAL b，不以小數近似替代。
• S201 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) f(22) ORIGINAL a times divisor，不以小數近似替代。
• S200 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) f(11) plus ORIGINAL b，不以小數近似替代。
• S199 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) f(11) ORIGINAL a times divisor，不以小數近似替代。
• S198 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) f(2) plus ORIGINAL b，不以小數近似替代。
• S197 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S196 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) f(1) plus ORIGINAL b，不以小數近似替代。
• S195 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/21) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S194 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S193 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor21，不以小數近似替代。
• S192 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S191 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S190 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S189 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S188 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S187 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence0，不以小數近似替代。
• S186 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S185 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S184 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S183 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(14) times SAME F(n/14)，不以小數近似替代。
• S182 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) full forward divisor sum，不以小數近似替代。
• S181 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) f(33) plus ORIGINAL b，不以小數近似替代。
• S180 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) f(33) ORIGINAL a times divisor，不以小數近似替代。
• S179 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) f(11) plus ORIGINAL b，不以小數近似替代。
• S178 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) f(11) ORIGINAL a times divisor，不以小數近似替代。
• S177 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) f(3) plus ORIGINAL b，不以小數近似替代。
• S176 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S175 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) f(1) plus ORIGINAL b，不以小數近似替代。
• S174 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/14) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S173 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S172 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor14，不以小數近似替代。
• S171 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S170 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S169 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S168 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S167 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S166 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S165 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S164 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S163 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(11) times SAME F(n/11)，不以小數近似替代。
• S162 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) full forward divisor sum，不以小數近似替代。
• S161 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(42) plus ORIGINAL b，不以小數近似替代。
• S160 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(42) ORIGINAL a times divisor，不以小數近似替代。
• S159 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(21) plus ORIGINAL b，不以小數近似替代。
• S158 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(21) ORIGINAL a times divisor，不以小數近似替代。
• S157 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(14) plus ORIGINAL b，不以小數近似替代。
• S156 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(14) ORIGINAL a times divisor，不以小數近似替代。
• S155 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(7) plus ORIGINAL b，不以小數近似替代。
• S154 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(7) ORIGINAL a times divisor，不以小數近似替代。
• S153 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(6) plus ORIGINAL b，不以小數近似替代。
• S152 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(6) ORIGINAL a times divisor，不以小數近似替代。
• S151 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(3) plus ORIGINAL b，不以小數近似替代。
• S150 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S149 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(2) plus ORIGINAL b，不以小數近似替代。
• S148 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S147 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(1) plus ORIGINAL b，不以小數近似替代。
• S146 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/11) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S145 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S144 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor11，不以小數近似替代。
• S143 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S142 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S141 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S140 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S139 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S138 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S137 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S136 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(7) times SAME F(n/7)，不以小數近似替代。
• S135 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) full forward divisor sum，不以小數近似替代。
• S134 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(66) plus ORIGINAL b，不以小數近似替代。
• S133 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(66) ORIGINAL a times divisor，不以小數近似替代。
• S132 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(33) plus ORIGINAL b，不以小數近似替代。
• S131 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(33) ORIGINAL a times divisor，不以小數近似替代。
• S130 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(22) plus ORIGINAL b，不以小數近似替代。
• S129 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(22) ORIGINAL a times divisor，不以小數近似替代。
• S128 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(11) plus ORIGINAL b，不以小數近似替代。
• S127 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(11) ORIGINAL a times divisor，不以小數近似替代。
• S126 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(6) plus ORIGINAL b，不以小數近似替代。
• S125 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(6) ORIGINAL a times divisor，不以小數近似替代。
• S124 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(3) plus ORIGINAL b，不以小數近似替代。
• S123 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S122 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(2) plus ORIGINAL b，不以小數近似替代。
• S121 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S120 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(1) plus ORIGINAL b，不以小數近似替代。
• S119 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/7) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S118 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S117 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor7，不以小數近似替代。
• S116 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S115 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S114 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S113 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S112 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S111 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S110 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(6) times SAME F(n/6)，不以小數近似替代。
• S109 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) full forward divisor sum，不以小數近似替代。
• S108 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) f(77) plus ORIGINAL b，不以小數近似替代。
• S107 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) f(77) ORIGINAL a times divisor，不以小數近似替代。
• S106 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) f(11) plus ORIGINAL b，不以小數近似替代。
• S105 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) f(11) ORIGINAL a times divisor，不以小數近似替代。
• S104 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) f(7) plus ORIGINAL b，不以小數近似替代。
• S103 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) f(7) ORIGINAL a times divisor，不以小數近似替代。
• S102 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) f(1) plus ORIGINAL b，不以小數近似替代。
• S101 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/6) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S100 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S099 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor6，不以小數近似替代。
• S098 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S097 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S096 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S095 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S094 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S093 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S092 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S091 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S090 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(3) times SAME F(n/3)，不以小數近似替代。
• S089 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) full forward divisor sum，不以小數近似替代。
• S088 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(154) plus ORIGINAL b，不以小數近似替代。
• S087 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(154) ORIGINAL a times divisor，不以小數近似替代。
• S086 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(77) plus ORIGINAL b，不以小數近似替代。
• S085 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(77) ORIGINAL a times divisor，不以小數近似替代。
• S084 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(22) plus ORIGINAL b，不以小數近似替代。
• S083 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(22) ORIGINAL a times divisor，不以小數近似替代。
• S082 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(14) plus ORIGINAL b，不以小數近似替代。
• S081 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(14) ORIGINAL a times divisor，不以小數近似替代。
• S080 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(11) plus ORIGINAL b，不以小數近似替代。
• S079 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(11) ORIGINAL a times divisor，不以小數近似替代。
• S078 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(7) plus ORIGINAL b，不以小數近似替代。
• S077 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(7) ORIGINAL a times divisor，不以小數近似替代。
• S076 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(2) plus ORIGINAL b，不以小數近似替代。
• S075 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S074 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(1) plus ORIGINAL b，不以小數近似替代。
• S073 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/3) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S072 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S071 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor3，不以小數近似替代。
• S070 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S069 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S068 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S067 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S066 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S065 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2)，不以小數近似替代。
• S064 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum，不以小數近似替代。
• S063 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(231) plus ORIGINAL b，不以小數近似替代。
• S062 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(231) ORIGINAL a times divisor，不以小數近似替代。
• S061 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(77) plus ORIGINAL b，不以小數近似替代。
• S060 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(77) ORIGINAL a times divisor，不以小數近似替代。
• S059 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(33) plus ORIGINAL b，不以小數近似替代。
• S058 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(33) ORIGINAL a times divisor，不以小數近似替代。
• S057 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(21) plus ORIGINAL b，不以小數近似替代。
• S056 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(21) ORIGINAL a times divisor，不以小數近似替代。
• S055 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(11) plus ORIGINAL b，不以小數近似替代。
• S054 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(11) ORIGINAL a times divisor，不以小數近似替代。
• S053 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(7) plus ORIGINAL b，不以小數近似替代。
• S052 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(7) ORIGINAL a times divisor，不以小數近似替代。
• S051 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(3) plus ORIGINAL b，不以小數近似替代。
• S050 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S049 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b，不以小數近似替代。
• S048 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S047 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S046 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2，不以小數近似替代。
• S045 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S044 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S043 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S042 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S041 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S040 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S039 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S038 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(462) plus ORIGINAL b，不以小數近似替代。
• S037 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(462) ORIGINAL a times divisor，不以小數近似替代。
• S036 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(231) plus ORIGINAL b，不以小數近似替代。
• S035 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(231) ORIGINAL a times divisor，不以小數近似替代。
• S034 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(154) plus ORIGINAL b，不以小數近似替代。
• S033 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(154) ORIGINAL a times divisor，不以小數近似替代。
• S032 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(77) plus ORIGINAL b，不以小數近似替代。
• S031 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(77) ORIGINAL a times divisor，不以小數近似替代。
• S030 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(66) plus ORIGINAL b，不以小數近似替代。
• S029 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(66) ORIGINAL a times divisor，不以小數近似替代。
• S028 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(42) plus ORIGINAL b，不以小數近似替代。
• S027 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(42) ORIGINAL a times divisor，不以小數近似替代。
• S026 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(33) plus ORIGINAL b，不以小數近似替代。
• S025 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(33) ORIGINAL a times divisor，不以小數近似替代。
• S024 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(22) plus ORIGINAL b，不以小數近似替代。
• S023 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(22) ORIGINAL a times divisor，不以小數近似替代。
• S022 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(21) plus ORIGINAL b，不以小數近似替代。
• S021 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(21) ORIGINAL a times divisor，不以小數近似替代。
• S020 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(14) plus ORIGINAL b，不以小數近似替代。
• S019 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(14) ORIGINAL a times divisor，不以小數近似替代。
• S018 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(11) plus ORIGINAL b，不以小數近似替代。
• S017 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(11) ORIGINAL a times divisor，不以小數近似替代。
• S016 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(7) plus ORIGINAL b，不以小數近似替代。
• S015 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(7) ORIGINAL a times divisor，不以小數近似替代。
• S014 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(6) plus ORIGINAL b，不以小數近似替代。
• S013 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(6) ORIGINAL a times divisor，不以小數近似替代。
• S012 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(3) plus ORIGINAL b，不以小數近似替代。
• S011 · premise_and_result_audit — 以精確有理數重算 Mobius inversion ORIGINAL inverse F(n/1) f(3) 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 — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

(462, [1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462], 1, [2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462], 9241, -13815, 9241, 否, all_positive_divisors_and_consistent_d_to_n_over_d_indexing_required)

依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。

本題覆核與來源綁定

覆核日期：2026-10-26

原題、答案、步驟表達式、數值 AST 與既有歷史保持原樣；原來的候選狀態屬於來源歷史，不覆寫為形式化證明。