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

原題與已知條件

positive integer domain、完整positive divisor set與完整UPF-derived Mobius values。操作=mobinv-roundtrip-table；資料={"n":18,"a":3,"b":5}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

• G001 — positive integer domain、完整positive divisor set與完整UPF-derived Mobius values。操作=mobinv-roundtrip-table；資料={"n":18,"a":3,"b":5}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

定義與適用範圍

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

• mko-mobius-inversion-finite-divisors

逐步推導

source operation=mobinv-roundtrip-table;original snapshot and mathematics retained

explicit ordered source output fields=[n, roundtrip_rows, all_equal, boundary]

Mobius inversion ORIGINAL roundtrip:actual positive input=18;check complete integer range1..18

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

Mobius roundtrip m=1 forward:actual positive input=1;check complete integer range1..1

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

Mobius roundtrip m=1 forward f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=1 forward f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=1 forward f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=1 forward f(1) plus ORIGINAL b = 8

Mobius roundtrip m=1 forward full forward divisor sum := sum(8)

Mobius roundtrip m=1 forward full forward divisor sum = 8

Mobius roundtrip m=1 inverse:actual positive input=1;check complete integer range1..1

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

Mobius roundtrip m=1 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 roundtrip m=1 inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[]

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

Mobius roundtrip m=1 inverse n divided by ORIGINAL divisor1 := div(1, 1)

Mobius roundtrip m=1 inverse n divided by ORIGINAL divisor1 = 1

Mobius roundtrip m=1 inverse F(n/1):actual positive input=1;check complete integer range1..1

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

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

Mobius roundtrip m=1 inverse F(n/1) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=1 inverse F(n/1) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=1 inverse F(n/1) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=1 inverse F(n/1) full forward divisor sum := sum(8)

Mobius roundtrip m=1 inverse F(n/1) full forward divisor sum = 8

Mobius roundtrip m=1 inverse mu(1) times SAME F(n/1) := mul(1, 8)

Mobius roundtrip m=1 inverse mu(1) times SAME F(n/1) = 8

Mobius roundtrip m=1 inverse complete inverse-term sum := sum(8)

Mobius roundtrip m=1 inverse complete inverse-term sum = 8

Mobius roundtrip m=1 inverse direct ORIGINAL a times n := mul(3, 1)

Mobius roundtrip m=1 inverse direct ORIGINAL a times n = 3

Mobius roundtrip m=1 inverse direct plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=1 inverse direct plus ORIGINAL b = 8

Mobius roundtrip m=1 inverse:actual n=1;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 1, 8, 8]]

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

Mobius roundtrip m=2 forward: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 roundtrip m=2 forward f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=2 forward f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=2 forward f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=2 forward f(1) plus ORIGINAL b = 8

Mobius roundtrip m=2 forward f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=2 forward f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=2 forward f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=2 forward f(2) plus ORIGINAL b = 11

Mobius roundtrip m=2 forward full forward divisor sum := sum(8, 11)

Mobius roundtrip m=2 forward full forward divisor sum = 19

Mobius roundtrip m=2 inverse: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 roundtrip m=2 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 roundtrip m=2 inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[]

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

Mobius roundtrip m=2 inverse n divided by ORIGINAL divisor1 := div(2, 1)

Mobius roundtrip m=2 inverse n divided by ORIGINAL divisor1 = 2

Mobius roundtrip m=2 inverse F(n/1):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 roundtrip m=2 inverse F(n/1) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=2 inverse F(n/1) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=2 inverse F(n/1) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=2 inverse F(n/1) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=2 inverse F(n/1) f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=2 inverse F(n/1) f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=2 inverse F(n/1) f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=2 inverse F(n/1) f(2) plus ORIGINAL b = 11

Mobius roundtrip m=2 inverse F(n/1) full forward divisor sum := sum(8, 11)

Mobius roundtrip m=2 inverse F(n/1) full forward divisor sum = 19

Mobius roundtrip m=2 inverse mu(1) times SAME F(n/1) := mul(1, 19)

Mobius roundtrip m=2 inverse mu(1) times SAME F(n/1) = 19

Mobius roundtrip m=2 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 roundtrip m=2 inverse Mobius at ORIGINAL divisor2:input=2;COMPLETE prime multiset=[2];distinct primes=[2]

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

Mobius roundtrip m=2 inverse n divided by ORIGINAL divisor2 := div(2, 2)

Mobius roundtrip m=2 inverse n divided by ORIGINAL divisor2 = 1

Mobius roundtrip m=2 inverse F(n/2):actual positive input=1;check complete integer range1..1

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

Mobius roundtrip m=2 inverse F(n/2) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=2 inverse F(n/2) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=2 inverse F(n/2) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=2 inverse F(n/2) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=2 inverse F(n/2) full forward divisor sum := sum(8)

Mobius roundtrip m=2 inverse F(n/2) full forward divisor sum = 8

Mobius roundtrip m=2 inverse mu(2) times SAME F(n/2) := mul(-1, 8)

Mobius roundtrip m=2 inverse mu(2) times SAME F(n/2) = -8

Mobius roundtrip m=2 inverse complete inverse-term sum := sum(19, -8)

Mobius roundtrip m=2 inverse complete inverse-term sum = 11

Mobius roundtrip m=2 inverse direct ORIGINAL a times n := mul(3, 2)

Mobius roundtrip m=2 inverse direct ORIGINAL a times n = 6

Mobius roundtrip m=2 inverse direct plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=2 inverse direct plus ORIGINAL b = 11

Mobius roundtrip m=2 inverse:actual n=2;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 2, 19, 19], [2, -1, 1, 8, -8]]

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

Mobius roundtrip m=3 forward: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 roundtrip m=3 forward f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=3 forward f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=3 forward f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=3 forward f(1) plus ORIGINAL b = 8

Mobius roundtrip m=3 forward f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=3 forward f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=3 forward f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=3 forward f(3) plus ORIGINAL b = 14

Mobius roundtrip m=3 forward full forward divisor sum := sum(8, 14)

Mobius roundtrip m=3 forward full forward divisor sum = 22

Mobius roundtrip m=3 inverse: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 roundtrip m=3 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 roundtrip m=3 inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[]

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

Mobius roundtrip m=3 inverse n divided by ORIGINAL divisor1 := div(3, 1)

Mobius roundtrip m=3 inverse n divided by ORIGINAL divisor1 = 3

Mobius roundtrip m=3 inverse F(n/1):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 roundtrip m=3 inverse F(n/1) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=3 inverse F(n/1) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=3 inverse F(n/1) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=3 inverse F(n/1) f(1) plus ORIGINAL b = 8

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

Mobius roundtrip m=3 inverse F(n/1) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=3 inverse F(n/1) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=3 inverse F(n/1) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=3 inverse F(n/1) full forward divisor sum := sum(8, 14)

Mobius roundtrip m=3 inverse F(n/1) full forward divisor sum = 22

Mobius roundtrip m=3 inverse mu(1) times SAME F(n/1) := mul(1, 22)

Mobius roundtrip m=3 inverse mu(1) times SAME F(n/1) = 22

Mobius roundtrip m=3 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 roundtrip m=3 inverse Mobius at ORIGINAL divisor3:input=3;COMPLETE prime multiset=[3];distinct primes=[3]

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

Mobius roundtrip m=3 inverse n divided by ORIGINAL divisor3 := div(3, 3)

Mobius roundtrip m=3 inverse n divided by ORIGINAL divisor3 = 1

Mobius roundtrip m=3 inverse F(n/3):actual positive input=1;check complete integer range1..1

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

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

Mobius roundtrip m=3 inverse F(n/3) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=3 inverse F(n/3) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=3 inverse F(n/3) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=3 inverse F(n/3) full forward divisor sum := sum(8)

Mobius roundtrip m=3 inverse F(n/3) full forward divisor sum = 8

Mobius roundtrip m=3 inverse mu(3) times SAME F(n/3) := mul(-1, 8)

Mobius roundtrip m=3 inverse mu(3) times SAME F(n/3) = -8

Mobius roundtrip m=3 inverse complete inverse-term sum := sum(22, -8)

Mobius roundtrip m=3 inverse complete inverse-term sum = 14

Mobius roundtrip m=3 inverse direct ORIGINAL a times n := mul(3, 3)

Mobius roundtrip m=3 inverse direct ORIGINAL a times n = 9

Mobius roundtrip m=3 inverse direct plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=3 inverse direct plus ORIGINAL b = 14

Mobius roundtrip m=3 inverse:actual n=3;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 3, 22, 22], [3, -1, 1, 8, -8]]

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

Mobius roundtrip m=6 forward: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 roundtrip m=6 forward f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=6 forward f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=6 forward f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=6 forward f(1) plus ORIGINAL b = 8

Mobius roundtrip m=6 forward f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=6 forward f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=6 forward f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=6 forward f(2) plus ORIGINAL b = 11

Mobius roundtrip m=6 forward f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=6 forward f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=6 forward f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=6 forward f(3) plus ORIGINAL b = 14

Mobius roundtrip m=6 forward f(6) ORIGINAL a times divisor := mul(3, 6)

Mobius roundtrip m=6 forward f(6) ORIGINAL a times divisor = 18

Mobius roundtrip m=6 forward f(6) plus ORIGINAL b := sum(18, 5)

Mobius roundtrip m=6 forward f(6) plus ORIGINAL b = 23

Mobius roundtrip m=6 forward full forward divisor sum := sum(8, 11, 14, 23)

Mobius roundtrip m=6 forward full forward divisor sum = 56

Mobius roundtrip m=6 inverse: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 roundtrip m=6 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 roundtrip m=6 inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[]

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

Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor1 := div(6, 1)

Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor1 = 6

Mobius roundtrip m=6 inverse F(n/1):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 roundtrip m=6 inverse F(n/1) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=6 inverse F(n/1) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=6 inverse F(n/1) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=6 inverse F(n/1) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=6 inverse F(n/1) f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=6 inverse F(n/1) f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=6 inverse F(n/1) f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=6 inverse F(n/1) f(2) plus ORIGINAL b = 11

Mobius roundtrip m=6 inverse F(n/1) f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=6 inverse F(n/1) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=6 inverse F(n/1) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=6 inverse F(n/1) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=6 inverse F(n/1) f(6) ORIGINAL a times divisor := mul(3, 6)

Mobius roundtrip m=6 inverse F(n/1) f(6) ORIGINAL a times divisor = 18

Mobius roundtrip m=6 inverse F(n/1) f(6) plus ORIGINAL b := sum(18, 5)

Mobius roundtrip m=6 inverse F(n/1) f(6) plus ORIGINAL b = 23

Mobius roundtrip m=6 inverse F(n/1) full forward divisor sum := sum(8, 11, 14, 23)

Mobius roundtrip m=6 inverse F(n/1) full forward divisor sum = 56

Mobius roundtrip m=6 inverse mu(1) times SAME F(n/1) := mul(1, 56)

Mobius roundtrip m=6 inverse mu(1) times SAME F(n/1) = 56

Mobius roundtrip m=6 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 roundtrip m=6 inverse Mobius at ORIGINAL divisor2:input=2;COMPLETE prime multiset=[2];distinct primes=[2]

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

Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor2 := div(6, 2)

Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor2 = 3

Mobius roundtrip m=6 inverse F(n/2):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 roundtrip m=6 inverse F(n/2) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=6 inverse F(n/2) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=6 inverse F(n/2) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=6 inverse F(n/2) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=6 inverse F(n/2) f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=6 inverse F(n/2) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=6 inverse F(n/2) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=6 inverse F(n/2) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=6 inverse F(n/2) full forward divisor sum := sum(8, 14)

Mobius roundtrip m=6 inverse F(n/2) full forward divisor sum = 22

Mobius roundtrip m=6 inverse mu(2) times SAME F(n/2) := mul(-1, 22)

Mobius roundtrip m=6 inverse mu(2) times SAME F(n/2) = -22

Mobius roundtrip m=6 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 roundtrip m=6 inverse Mobius at ORIGINAL divisor3:input=3;COMPLETE prime multiset=[3];distinct primes=[3]

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

Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor3 := div(6, 3)

Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor3 = 2

Mobius roundtrip m=6 inverse F(n/3):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 roundtrip m=6 inverse F(n/3) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=6 inverse F(n/3) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=6 inverse F(n/3) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=6 inverse F(n/3) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=6 inverse F(n/3) f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=6 inverse F(n/3) f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=6 inverse F(n/3) f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=6 inverse F(n/3) f(2) plus ORIGINAL b = 11

Mobius roundtrip m=6 inverse F(n/3) full forward divisor sum := sum(8, 11)

Mobius roundtrip m=6 inverse F(n/3) full forward divisor sum = 19

Mobius roundtrip m=6 inverse mu(3) times SAME F(n/3) := mul(-1, 19)

Mobius roundtrip m=6 inverse mu(3) times SAME F(n/3) = -19

Mobius roundtrip m=6 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 roundtrip m=6 inverse Mobius at ORIGINAL divisor6:input=6;COMPLETE prime multiset=[2, 3];distinct primes=[2, 3]

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

Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor6 := div(6, 6)

Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor6 = 1

Mobius roundtrip m=6 inverse F(n/6):actual positive input=1;check complete integer range1..1

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

Mobius roundtrip m=6 inverse F(n/6) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=6 inverse F(n/6) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=6 inverse F(n/6) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=6 inverse F(n/6) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=6 inverse F(n/6) full forward divisor sum := sum(8)

Mobius roundtrip m=6 inverse F(n/6) full forward divisor sum = 8

Mobius roundtrip m=6 inverse mu(6) times SAME F(n/6) := mul(1, 8)

Mobius roundtrip m=6 inverse mu(6) times SAME F(n/6) = 8

Mobius roundtrip m=6 inverse complete inverse-term sum := sum(56, -22, -19, 8)

Mobius roundtrip m=6 inverse complete inverse-term sum = 23

Mobius roundtrip m=6 inverse direct ORIGINAL a times n := mul(3, 6)

Mobius roundtrip m=6 inverse direct ORIGINAL a times n = 18

Mobius roundtrip m=6 inverse direct plus ORIGINAL b := sum(18, 5)

Mobius roundtrip m=6 inverse direct plus ORIGINAL b = 23

Mobius roundtrip m=6 inverse:actual n=6;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 6, 56, 56], [2, -1, 3, 22, -22], [3, -1, 2, 19, -19], [6, 1, 1, 8, 8]]

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

Mobius roundtrip m=9 forward:actual positive input=9;check complete integer range1..9

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

Mobius roundtrip m=9 forward f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=9 forward f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=9 forward f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=9 forward f(1) plus ORIGINAL b = 8

Mobius roundtrip m=9 forward f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=9 forward f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=9 forward f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=9 forward f(3) plus ORIGINAL b = 14

Mobius roundtrip m=9 forward f(9) ORIGINAL a times divisor := mul(3, 9)

Mobius roundtrip m=9 forward f(9) ORIGINAL a times divisor = 27

Mobius roundtrip m=9 forward f(9) plus ORIGINAL b := sum(27, 5)

Mobius roundtrip m=9 forward f(9) plus ORIGINAL b = 32

Mobius roundtrip m=9 forward full forward divisor sum := sum(8, 14, 32)

Mobius roundtrip m=9 forward full forward divisor sum = 54

Mobius roundtrip m=9 inverse:actual positive input=9;check complete integer range1..9

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

Mobius roundtrip m=9 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 roundtrip m=9 inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[]

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

Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor1 := div(9, 1)

Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor1 = 9

Mobius roundtrip m=9 inverse F(n/1):actual positive input=9;check complete integer range1..9

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

Mobius roundtrip m=9 inverse F(n/1) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=9 inverse F(n/1) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=9 inverse F(n/1) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=9 inverse F(n/1) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=9 inverse F(n/1) f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=9 inverse F(n/1) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=9 inverse F(n/1) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=9 inverse F(n/1) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=9 inverse F(n/1) f(9) ORIGINAL a times divisor := mul(3, 9)

Mobius roundtrip m=9 inverse F(n/1) f(9) ORIGINAL a times divisor = 27

Mobius roundtrip m=9 inverse F(n/1) f(9) plus ORIGINAL b := sum(27, 5)

Mobius roundtrip m=9 inverse F(n/1) f(9) plus ORIGINAL b = 32

Mobius roundtrip m=9 inverse F(n/1) full forward divisor sum := sum(8, 14, 32)

Mobius roundtrip m=9 inverse F(n/1) full forward divisor sum = 54

Mobius roundtrip m=9 inverse mu(1) times SAME F(n/1) := mul(1, 54)

Mobius roundtrip m=9 inverse mu(1) times SAME F(n/1) = 54

Mobius roundtrip m=9 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 roundtrip m=9 inverse Mobius at ORIGINAL divisor3:input=3;COMPLETE prime multiset=[3];distinct primes=[3]

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

Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor3 := div(9, 3)

Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor3 = 3

Mobius roundtrip m=9 inverse F(n/3):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 roundtrip m=9 inverse F(n/3) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=9 inverse F(n/3) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=9 inverse F(n/3) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=9 inverse F(n/3) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=9 inverse F(n/3) f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=9 inverse F(n/3) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=9 inverse F(n/3) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=9 inverse F(n/3) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=9 inverse F(n/3) full forward divisor sum := sum(8, 14)

Mobius roundtrip m=9 inverse F(n/3) full forward divisor sum = 22

Mobius roundtrip m=9 inverse mu(3) times SAME F(n/3) := mul(-1, 22)

Mobius roundtrip m=9 inverse mu(3) times SAME F(n/3) = -22

Mobius roundtrip m=9 inverse Mobius at ORIGINAL divisor9:actual positive input for mu=9

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

ORIGINAL positive integer absolute magnitude=9>1

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

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

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

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

upf extract divisor3 occurrence0 = 3

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

upf extract divisor3 occurrence1 = 1

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

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

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

upf canonical complete product factor0 = 3

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

upf canonical complete product factor1 = 9

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

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

Mobius roundtrip m=9 inverse Mobius at ORIGINAL divisor9:input=9;COMPLETE prime multiset=[3, 3];distinct primes=[3]

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

Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor9 := div(9, 9)

Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor9 = 1

Mobius roundtrip m=9 inverse F(n/9):actual positive input=1;check complete integer range1..1

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

Mobius roundtrip m=9 inverse F(n/9) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=9 inverse F(n/9) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=9 inverse F(n/9) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=9 inverse F(n/9) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=9 inverse F(n/9) full forward divisor sum := sum(8)

Mobius roundtrip m=9 inverse F(n/9) full forward divisor sum = 8

Mobius roundtrip m=9 inverse mu(9) times SAME F(n/9) := mul(0, 8)

Mobius roundtrip m=9 inverse mu(9) times SAME F(n/9) = 0

Mobius roundtrip m=9 inverse complete inverse-term sum := sum(54, -22, 0)

Mobius roundtrip m=9 inverse complete inverse-term sum = 32

Mobius roundtrip m=9 inverse direct ORIGINAL a times n := mul(3, 9)

Mobius roundtrip m=9 inverse direct ORIGINAL a times n = 27

Mobius roundtrip m=9 inverse direct plus ORIGINAL b := sum(27, 5)

Mobius roundtrip m=9 inverse direct plus ORIGINAL b = 32

Mobius roundtrip m=9 inverse:actual n=9;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 9, 54, 54], [3, -1, 3, 22, -22], [9, 0, 1, 8, 0]]

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

Mobius roundtrip m=18 forward:actual positive input=18;check complete integer range1..18

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

Mobius roundtrip m=18 forward f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=18 forward f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=18 forward f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=18 forward f(1) plus ORIGINAL b = 8

Mobius roundtrip m=18 forward f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=18 forward f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=18 forward f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=18 forward f(2) plus ORIGINAL b = 11

Mobius roundtrip m=18 forward f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=18 forward f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=18 forward f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=18 forward f(3) plus ORIGINAL b = 14

Mobius roundtrip m=18 forward f(6) ORIGINAL a times divisor := mul(3, 6)

Mobius roundtrip m=18 forward f(6) ORIGINAL a times divisor = 18

Mobius roundtrip m=18 forward f(6) plus ORIGINAL b := sum(18, 5)

Mobius roundtrip m=18 forward f(6) plus ORIGINAL b = 23

Mobius roundtrip m=18 forward f(9) ORIGINAL a times divisor := mul(3, 9)

Mobius roundtrip m=18 forward f(9) ORIGINAL a times divisor = 27

Mobius roundtrip m=18 forward f(9) plus ORIGINAL b := sum(27, 5)

Mobius roundtrip m=18 forward f(9) plus ORIGINAL b = 32

Mobius roundtrip m=18 forward f(18) ORIGINAL a times divisor := mul(3, 18)

Mobius roundtrip m=18 forward f(18) ORIGINAL a times divisor = 54

Mobius roundtrip m=18 forward f(18) plus ORIGINAL b := sum(54, 5)

Mobius roundtrip m=18 forward f(18) plus ORIGINAL b = 59

Mobius roundtrip m=18 forward full forward divisor sum := sum(8, 11, 14, 23, 32, 59)

Mobius roundtrip m=18 forward full forward divisor sum = 147

Mobius roundtrip m=18 inverse:actual positive input=18;check complete integer range1..18

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

Mobius roundtrip m=18 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 roundtrip m=18 inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[]

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

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor1 := div(18, 1)

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor1 = 18

Mobius roundtrip m=18 inverse F(n/1):actual positive input=18;check complete integer range1..18

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

Mobius roundtrip m=18 inverse F(n/1) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=18 inverse F(n/1) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=18 inverse F(n/1) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=18 inverse F(n/1) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=18 inverse F(n/1) f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=18 inverse F(n/1) f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=18 inverse F(n/1) f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=18 inverse F(n/1) f(2) plus ORIGINAL b = 11

Mobius roundtrip m=18 inverse F(n/1) f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=18 inverse F(n/1) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=18 inverse F(n/1) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=18 inverse F(n/1) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=18 inverse F(n/1) f(6) ORIGINAL a times divisor := mul(3, 6)

Mobius roundtrip m=18 inverse F(n/1) f(6) ORIGINAL a times divisor = 18

Mobius roundtrip m=18 inverse F(n/1) f(6) plus ORIGINAL b := sum(18, 5)

Mobius roundtrip m=18 inverse F(n/1) f(6) plus ORIGINAL b = 23

Mobius roundtrip m=18 inverse F(n/1) f(9) ORIGINAL a times divisor := mul(3, 9)

Mobius roundtrip m=18 inverse F(n/1) f(9) ORIGINAL a times divisor = 27

Mobius roundtrip m=18 inverse F(n/1) f(9) plus ORIGINAL b := sum(27, 5)

Mobius roundtrip m=18 inverse F(n/1) f(9) plus ORIGINAL b = 32

Mobius roundtrip m=18 inverse F(n/1) f(18) ORIGINAL a times divisor := mul(3, 18)

Mobius roundtrip m=18 inverse F(n/1) f(18) ORIGINAL a times divisor = 54

Mobius roundtrip m=18 inverse F(n/1) f(18) plus ORIGINAL b := sum(54, 5)

Mobius roundtrip m=18 inverse F(n/1) f(18) plus ORIGINAL b = 59

Mobius roundtrip m=18 inverse F(n/1) full forward divisor sum := sum(8, 11, 14, 23, 32, 59)

Mobius roundtrip m=18 inverse F(n/1) full forward divisor sum = 147

Mobius roundtrip m=18 inverse mu(1) times SAME F(n/1) := mul(1, 147)

Mobius roundtrip m=18 inverse mu(1) times SAME F(n/1) = 147

Mobius roundtrip m=18 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 roundtrip m=18 inverse Mobius at ORIGINAL divisor2:input=2;COMPLETE prime multiset=[2];distinct primes=[2]

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

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor2 := div(18, 2)

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor2 = 9

Mobius roundtrip m=18 inverse F(n/2):actual positive input=9;check complete integer range1..9

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

Mobius roundtrip m=18 inverse F(n/2) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=18 inverse F(n/2) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=18 inverse F(n/2) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=18 inverse F(n/2) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=18 inverse F(n/2) f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=18 inverse F(n/2) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=18 inverse F(n/2) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=18 inverse F(n/2) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=18 inverse F(n/2) f(9) ORIGINAL a times divisor := mul(3, 9)

Mobius roundtrip m=18 inverse F(n/2) f(9) ORIGINAL a times divisor = 27

Mobius roundtrip m=18 inverse F(n/2) f(9) plus ORIGINAL b := sum(27, 5)

Mobius roundtrip m=18 inverse F(n/2) f(9) plus ORIGINAL b = 32

Mobius roundtrip m=18 inverse F(n/2) full forward divisor sum := sum(8, 14, 32)

Mobius roundtrip m=18 inverse F(n/2) full forward divisor sum = 54

Mobius roundtrip m=18 inverse mu(2) times SAME F(n/2) := mul(-1, 54)

Mobius roundtrip m=18 inverse mu(2) times SAME F(n/2) = -54

Mobius roundtrip m=18 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 roundtrip m=18 inverse Mobius at ORIGINAL divisor3:input=3;COMPLETE prime multiset=[3];distinct primes=[3]

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

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor3 := div(18, 3)

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor3 = 6

Mobius roundtrip m=18 inverse F(n/3):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 roundtrip m=18 inverse F(n/3) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=18 inverse F(n/3) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=18 inverse F(n/3) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=18 inverse F(n/3) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=18 inverse F(n/3) f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=18 inverse F(n/3) f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=18 inverse F(n/3) f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=18 inverse F(n/3) f(2) plus ORIGINAL b = 11

Mobius roundtrip m=18 inverse F(n/3) f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=18 inverse F(n/3) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=18 inverse F(n/3) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=18 inverse F(n/3) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=18 inverse F(n/3) f(6) ORIGINAL a times divisor := mul(3, 6)

Mobius roundtrip m=18 inverse F(n/3) f(6) ORIGINAL a times divisor = 18

Mobius roundtrip m=18 inverse F(n/3) f(6) plus ORIGINAL b := sum(18, 5)

Mobius roundtrip m=18 inverse F(n/3) f(6) plus ORIGINAL b = 23

Mobius roundtrip m=18 inverse F(n/3) full forward divisor sum := sum(8, 11, 14, 23)

Mobius roundtrip m=18 inverse F(n/3) full forward divisor sum = 56

Mobius roundtrip m=18 inverse mu(3) times SAME F(n/3) := mul(-1, 56)

Mobius roundtrip m=18 inverse mu(3) times SAME F(n/3) = -56

Mobius roundtrip m=18 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 roundtrip m=18 inverse Mobius at ORIGINAL divisor6:input=6;COMPLETE prime multiset=[2, 3];distinct primes=[2, 3]

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

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor6 := div(18, 6)

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor6 = 3

Mobius roundtrip m=18 inverse F(n/6):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 roundtrip m=18 inverse F(n/6) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=18 inverse F(n/6) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=18 inverse F(n/6) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=18 inverse F(n/6) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=18 inverse F(n/6) f(3) ORIGINAL a times divisor := mul(3, 3)

Mobius roundtrip m=18 inverse F(n/6) f(3) ORIGINAL a times divisor = 9

Mobius roundtrip m=18 inverse F(n/6) f(3) plus ORIGINAL b := sum(9, 5)

Mobius roundtrip m=18 inverse F(n/6) f(3) plus ORIGINAL b = 14

Mobius roundtrip m=18 inverse F(n/6) full forward divisor sum := sum(8, 14)

Mobius roundtrip m=18 inverse F(n/6) full forward divisor sum = 22

Mobius roundtrip m=18 inverse mu(6) times SAME F(n/6) := mul(1, 22)

Mobius roundtrip m=18 inverse mu(6) times SAME F(n/6) = 22

Mobius roundtrip m=18 inverse Mobius at ORIGINAL divisor9:actual positive input for mu=9

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

ORIGINAL positive integer absolute magnitude=9>1

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

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

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

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

upf extract divisor3 occurrence0 = 3

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

upf extract divisor3 occurrence1 = 1

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

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

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

upf canonical complete product factor0 = 3

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

upf canonical complete product factor1 = 9

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

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

Mobius roundtrip m=18 inverse Mobius at ORIGINAL divisor9:input=9;COMPLETE prime multiset=[3, 3];distinct primes=[3]

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

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor9 := div(18, 9)

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor9 = 2

Mobius roundtrip m=18 inverse F(n/9):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 roundtrip m=18 inverse F(n/9) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=18 inverse F(n/9) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=18 inverse F(n/9) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=18 inverse F(n/9) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=18 inverse F(n/9) f(2) ORIGINAL a times divisor := mul(3, 2)

Mobius roundtrip m=18 inverse F(n/9) f(2) ORIGINAL a times divisor = 6

Mobius roundtrip m=18 inverse F(n/9) f(2) plus ORIGINAL b := sum(6, 5)

Mobius roundtrip m=18 inverse F(n/9) f(2) plus ORIGINAL b = 11

Mobius roundtrip m=18 inverse F(n/9) full forward divisor sum := sum(8, 11)

Mobius roundtrip m=18 inverse F(n/9) full forward divisor sum = 19

Mobius roundtrip m=18 inverse mu(9) times SAME F(n/9) := mul(0, 19)

Mobius roundtrip m=18 inverse mu(9) times SAME F(n/9) = 0

Mobius roundtrip m=18 inverse Mobius at ORIGINAL divisor18:actual positive input for mu=18

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

ORIGINAL positive integer absolute magnitude=18>1

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

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

upf extract divisor2 occurrence0 = 9

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

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

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

upf extract divisor3 occurrence1 = 3

upf extract divisor3 occurrence2 := div(3, 3)

upf extract divisor3 occurrence2 = 1

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

extracted multiplicity=2;next remaining=1;remaining modulo3=1;extracted multiset=[2, 3, 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, 3)

upf canonical complete product factor2 = 18

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

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

Mobius roundtrip m=18 inverse Mobius at ORIGINAL divisor18:input=18;COMPLETE prime multiset=[2, 3, 3];distinct primes=[2, 3]

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

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor18 := div(18, 18)

Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor18 = 1

Mobius roundtrip m=18 inverse F(n/18):actual positive input=1;check complete integer range1..1

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

Mobius roundtrip m=18 inverse F(n/18) f(1) ORIGINAL a times divisor := mul(3, 1)

Mobius roundtrip m=18 inverse F(n/18) f(1) ORIGINAL a times divisor = 3

Mobius roundtrip m=18 inverse F(n/18) f(1) plus ORIGINAL b := sum(3, 5)

Mobius roundtrip m=18 inverse F(n/18) f(1) plus ORIGINAL b = 8

Mobius roundtrip m=18 inverse F(n/18) full forward divisor sum := sum(8)

Mobius roundtrip m=18 inverse F(n/18) full forward divisor sum = 8

Mobius roundtrip m=18 inverse mu(18) times SAME F(n/18) := mul(0, 8)

Mobius roundtrip m=18 inverse mu(18) times SAME F(n/18) = 0

Mobius roundtrip m=18 inverse complete inverse-term sum := sum(147, -54, -56, 22, 0, 0)

Mobius roundtrip m=18 inverse complete inverse-term sum = 59

Mobius roundtrip m=18 inverse direct ORIGINAL a times n := mul(3, 18)

Mobius roundtrip m=18 inverse direct ORIGINAL a times n = 54

Mobius roundtrip m=18 inverse direct plus ORIGINAL b := sum(54, 5)

Mobius roundtrip m=18 inverse direct plus ORIGINAL b = 59

Mobius roundtrip m=18 inverse:actual n=18;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 18, 147, 147], [2, -1, 9, 54, -54], [3, -1, 6, 56, -56], [6, 1, 3, 22, 22], [9, 0, 2, 19, 0], [18, 0, 1, 8, 0]]

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

逐步反向核對

• S327 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S326 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse direct plus ORIGINAL b，不以小數近似替代。
• S325 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse direct ORIGINAL a times n，不以小數近似替代。
• S324 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse complete inverse-term sum，不以小數近似替代。
• S323 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse mu(18) times SAME F(n/18)，不以小數近似替代。
• S322 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/18) full forward divisor sum，不以小數近似替代。
• S321 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/18) f(1) plus ORIGINAL b，不以小數近似替代。
• S320 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/18) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S319 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S318 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor18，不以小數近似替代。
• S317 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S316 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S315 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• S314 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S313 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S312 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S311 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence2，不以小數近似替代。
• S310 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence1，不以小數近似替代。
• S309 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S308 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S307 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S306 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S305 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse mu(9) times SAME F(n/9)，不以小數近似替代。
• S304 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/9) full forward divisor sum，不以小數近似替代。
• S303 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/9) f(2) plus ORIGINAL b，不以小數近似替代。
• S302 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/9) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S301 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/9) f(1) plus ORIGINAL b，不以小數近似替代。
• S300 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/9) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S299 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S298 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor9，不以小數近似替代。
• 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 divisor3 occurrence1，不以小數近似替代。
• S291 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence0，不以小數近似替代。
• S290 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S289 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S288 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S287 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse mu(6) times SAME F(n/6)，不以小數近似替代。
• S286 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/6) full forward divisor sum，不以小數近似替代。
• S285 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/6) f(3) plus ORIGINAL b，不以小數近似替代。
• S284 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/6) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S283 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/6) f(1) plus ORIGINAL b，不以小數近似替代。
• S282 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/6) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S281 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S280 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor6，不以小數近似替代。
• S279 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S278 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S277 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S276 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S275 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S274 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S273 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S272 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S271 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse mu(3) times SAME F(n/3)，不以小數近似替代。
• S270 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) full forward divisor sum，不以小數近似替代。
• S269 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) f(6) plus ORIGINAL b，不以小數近似替代。
• S268 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) f(6) ORIGINAL a times divisor，不以小數近似替代。
• S267 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) f(3) plus ORIGINAL b，不以小數近似替代。
• S266 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S265 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) f(2) plus ORIGINAL b，不以小數近似替代。
• S264 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S263 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) f(1) plus ORIGINAL b，不以小數近似替代。
• S262 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/3) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S261 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S260 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor3，不以小數近似替代。
• S259 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S258 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S257 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S256 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S255 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S254 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse mu(2) times SAME F(n/2)，不以小數近似替代。
• S253 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/2) full forward divisor sum，不以小數近似替代。
• S252 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/2) f(9) plus ORIGINAL b，不以小數近似替代。
• S251 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/2) f(9) ORIGINAL a times divisor，不以小數近似替代。
• S250 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/2) f(3) plus ORIGINAL b，不以小數近似替代。
• S249 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/2) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S248 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/2) f(1) plus ORIGINAL b，不以小數近似替代。
• S247 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/2) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S246 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S245 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor2，不以小數近似替代。
• S244 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S243 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S242 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S241 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S240 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S239 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S238 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S237 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(18) plus ORIGINAL b，不以小數近似替代。
• S236 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(18) ORIGINAL a times divisor，不以小數近似替代。
• S235 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(9) plus ORIGINAL b，不以小數近似替代。
• S234 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(9) ORIGINAL a times divisor，不以小數近似替代。
• S233 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(6) plus ORIGINAL b，不以小數近似替代。
• S232 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(6) ORIGINAL a times divisor，不以小數近似替代。
• S231 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(3) plus ORIGINAL b，不以小數近似替代。
• S230 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S229 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(2) plus ORIGINAL b，不以小數近似替代。
• S228 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S227 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S226 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S225 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S224 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S223 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S222 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S221 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S220 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward full forward divisor sum，不以小數近似替代。
• S219 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(18) plus ORIGINAL b，不以小數近似替代。
• S218 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(18) ORIGINAL a times divisor，不以小數近似替代。
• S217 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(9) plus ORIGINAL b，不以小數近似替代。
• S216 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(9) ORIGINAL a times divisor，不以小數近似替代。
• S215 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(6) plus ORIGINAL b，不以小數近似替代。
• S214 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(6) ORIGINAL a times divisor，不以小數近似替代。
• S213 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(3) plus ORIGINAL b，不以小數近似替代。
• S212 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(3) ORIGINAL a times divisor，不以小數近似替代。
• S211 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(2) plus ORIGINAL b，不以小數近似替代。
• S210 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(2) ORIGINAL a times divisor，不以小數近似替代。
• S209 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S208 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=18 forward f(1) ORIGINAL a times divisor，不以小數近似替代。
• S207 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S206 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S205 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse direct plus ORIGINAL b，不以小數近似替代。
• S204 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse direct ORIGINAL a times n，不以小數近似替代。
• S203 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse complete inverse-term sum，不以小數近似替代。
• S202 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse mu(9) times SAME F(n/9)，不以小數近似替代。
• S201 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/9) full forward divisor sum，不以小數近似替代。
• S200 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/9) f(1) plus ORIGINAL b，不以小數近似替代。
• S199 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/9) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S198 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S197 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor9，不以小數近似替代。
• S196 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S195 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S194 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S193 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S192 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S191 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence1，不以小數近似替代。
• S190 · premise_and_result_audit — 以精確有理數重算 upf extract divisor3 occurrence0，不以小數近似替代。
• S189 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S188 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S187 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S186 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse mu(3) times SAME F(n/3)，不以小數近似替代。
• S185 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/3) full forward divisor sum，不以小數近似替代。
• S184 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/3) f(3) plus ORIGINAL b，不以小數近似替代。
• S183 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/3) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S182 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/3) f(1) plus ORIGINAL b，不以小數近似替代。
• S181 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/3) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S180 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S179 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor3，不以小數近似替代。
• S178 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S177 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S176 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S175 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S174 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S173 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S172 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S171 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/1) f(9) plus ORIGINAL b，不以小數近似替代。
• S170 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/1) f(9) ORIGINAL a times divisor，不以小數近似替代。
• S169 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/1) f(3) plus ORIGINAL b，不以小數近似替代。
• S168 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/1) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S167 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S166 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S165 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S164 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S163 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S162 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S161 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S160 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 forward full forward divisor sum，不以小數近似替代。
• S159 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 forward f(9) plus ORIGINAL b，不以小數近似替代。
• S158 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 forward f(9) ORIGINAL a times divisor，不以小數近似替代。
• S157 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 forward f(3) plus ORIGINAL b，不以小數近似替代。
• S156 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 forward f(3) ORIGINAL a times divisor，不以小數近似替代。
• S155 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S154 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=9 forward f(1) ORIGINAL a times divisor，不以小數近似替代。
• S153 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S152 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S151 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse direct plus ORIGINAL b，不以小數近似替代。
• S150 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse direct ORIGINAL a times n，不以小數近似替代。
• S149 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse complete inverse-term sum，不以小數近似替代。
• S148 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse mu(6) times SAME F(n/6)，不以小數近似替代。
• S147 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/6) full forward divisor sum，不以小數近似替代。
• S146 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/6) f(1) plus ORIGINAL b，不以小數近似替代。
• S145 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/6) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S144 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S143 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor6，不以小數近似替代。
• S142 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S141 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S140 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S139 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S138 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S137 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S136 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S135 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S134 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse mu(3) times SAME F(n/3)，不以小數近似替代。
• S133 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/3) full forward divisor sum，不以小數近似替代。
• S132 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/3) f(2) plus ORIGINAL b，不以小數近似替代。
• S131 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/3) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S130 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/3) f(1) plus ORIGINAL b，不以小數近似替代。
• S129 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/3) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S128 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S127 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor3，不以小數近似替代。
• S126 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S125 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S124 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S123 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S122 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S121 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse mu(2) times SAME F(n/2)，不以小數近似替代。
• S120 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/2) full forward divisor sum，不以小數近似替代。
• S119 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/2) f(3) plus ORIGINAL b，不以小數近似替代。
• S118 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/2) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S117 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/2) f(1) plus ORIGINAL b，不以小數近似替代。
• S116 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/2) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S115 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S114 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor2，不以小數近似替代。
• S113 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S112 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S111 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S110 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S109 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S108 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S107 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S106 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) f(6) plus ORIGINAL b，不以小數近似替代。
• S105 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) f(6) ORIGINAL a times divisor，不以小數近似替代。
• S104 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) f(3) plus ORIGINAL b，不以小數近似替代。
• S103 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S102 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) f(2) plus ORIGINAL b，不以小數近似替代。
• S101 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S100 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S099 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S098 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S097 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S096 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S095 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S094 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S093 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward full forward divisor sum，不以小數近似替代。
• S092 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward f(6) plus ORIGINAL b，不以小數近似替代。
• S091 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward f(6) ORIGINAL a times divisor，不以小數近似替代。
• S090 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward f(3) plus ORIGINAL b，不以小數近似替代。
• S089 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward f(3) ORIGINAL a times divisor，不以小數近似替代。
• S088 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward f(2) plus ORIGINAL b，不以小數近似替代。
• S087 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward f(2) ORIGINAL a times divisor，不以小數近似替代。
• S086 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S085 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=6 forward f(1) ORIGINAL a times divisor，不以小數近似替代。
• S084 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S083 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S082 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse direct plus ORIGINAL b，不以小數近似替代。
• S081 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse direct ORIGINAL a times n，不以小數近似替代。
• S080 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse complete inverse-term sum，不以小數近似替代。
• S079 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse mu(3) times SAME F(n/3)，不以小數近似替代。
• S078 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse F(n/3) full forward divisor sum，不以小數近似替代。
• S077 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse F(n/3) f(1) plus ORIGINAL b，不以小數近似替代。
• S076 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse F(n/3) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S075 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S074 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse n divided by ORIGINAL divisor3，不以小數近似替代。
• S073 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S072 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S071 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S070 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S069 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S068 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S067 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S066 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse F(n/1) f(3) plus ORIGINAL b，不以小數近似替代。
• S065 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse F(n/1) f(3) ORIGINAL a times divisor，不以小數近似替代。
• S064 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S063 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S062 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S061 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S060 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S059 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S058 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S057 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 forward full forward divisor sum，不以小數近似替代。
• S056 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 forward f(3) plus ORIGINAL b，不以小數近似替代。
• S055 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 forward f(3) ORIGINAL a times divisor，不以小數近似替代。
• S054 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S053 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=3 forward f(1) ORIGINAL a times divisor，不以小數近似替代。
• S052 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S051 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S050 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse direct plus ORIGINAL b，不以小數近似替代。
• S049 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse direct ORIGINAL a times n，不以小數近似替代。
• S048 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse complete inverse-term sum，不以小數近似替代。
• S047 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse mu(2) times SAME F(n/2)，不以小數近似替代。
• S046 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse F(n/2) full forward divisor sum，不以小數近似替代。
• S045 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse F(n/2) f(1) plus ORIGINAL b，不以小數近似替代。
• S044 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse F(n/2) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S043 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S042 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse n divided by ORIGINAL divisor2，不以小數近似替代。
• S041 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S040 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S039 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S038 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S037 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S036 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S035 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S034 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse F(n/1) f(2) plus ORIGINAL b，不以小數近似替代。
• S033 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse F(n/1) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S032 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S031 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S030 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S029 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S028 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S027 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S026 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S025 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 forward full forward divisor sum，不以小數近似替代。
• S024 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 forward f(2) plus ORIGINAL b，不以小數近似替代。
• S023 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 forward f(2) ORIGINAL a times divisor，不以小數近似替代。
• S022 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S021 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=2 forward f(1) ORIGINAL a times divisor，不以小數近似替代。
• S020 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S019 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S018 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 inverse direct plus ORIGINAL b，不以小數近似替代。
• S017 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 inverse direct ORIGINAL a times n，不以小數近似替代。
• S016 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 inverse complete inverse-term sum，不以小數近似替代。
• S015 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S014 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S013 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S012 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S011 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S010 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S009 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S008 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S007 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S006 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 forward full forward divisor sum，不以小數近似替代。
• S005 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S004 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=1 forward f(1) ORIGINAL a times divisor，不以小數近似替代。
• S003 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S002 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S001 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

(18, [[1, 8, 8, 8], [2, 19, 11, 11], [3, 22, 14, 14], [6, 56, 23, 23], [9, 54, 32, 32], [18, 147, 59, 59]], 是, finite_divisor_poset_roundtrip)

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

本題覆核與來源綁定

覆核日期：2026-10-26

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