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

原題與已知條件

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

• G001 — positive integer domain、完整positive divisor set與完整UPF-derived Mobius values。操作=mobinv-roundtrip-table；資料={"n":16,"a":1,"b":3}。請依 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=16;check complete integer range1..16

ALL positive divisors INCREASING=[1, 2, 4, 8, 16];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(1, 1)

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

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

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

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

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

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(1, 1)

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

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

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

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

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

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

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

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

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

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

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

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

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

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, 4, 4]]

complete reconstructed=4;direct f(n)=4;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(1, 1)

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

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

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

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

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

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

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

Mobius roundtrip m=2 forward full forward divisor sum := sum(4, 5)

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

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(1, 1)

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

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

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

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

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

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

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

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

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

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

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

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(1, 1)

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

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

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

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

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

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

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

Mobius roundtrip m=2 inverse complete inverse-term sum := sum(9, -4)

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

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

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

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

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

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, 9, 9], [2, -1, 1, 4, -4]]

complete reconstructed=5;direct f(n)=5;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=4 forward:actual positive input=4;check complete integer range1..4

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=4 forward f(4) plus ORIGINAL b = 7

Mobius roundtrip m=4 forward full forward divisor sum := sum(4, 5, 7)

Mobius roundtrip m=4 forward full forward divisor sum = 16

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=4 inverse F(n/1) full forward divisor sum := sum(4, 5, 7)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=4 inverse F(n/2) f(2) plus ORIGINAL b = 5

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

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

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

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

Mobius roundtrip m=4 inverse Mobius at ORIGINAL divisor4:actual positive input for mu=4

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

ORIGINAL positive integer absolute magnitude=4>1

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

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

upf extract divisor2 occurrence0 = 2

upf extract divisor2 occurrence1 := div(2, 2)

upf extract divisor2 occurrence1 = 1

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

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

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

upf canonical complete product factor0 = 2

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

upf canonical complete product factor1 = 4

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

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

Mobius roundtrip m=4 inverse Mobius at ORIGINAL divisor4:input=4;COMPLETE prime multiset=[2, 2];distinct primes=[2]

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

Mobius roundtrip m=4 inverse n divided by ORIGINAL divisor4 := div(4, 4)

Mobius roundtrip m=4 inverse n divided by ORIGINAL divisor4 = 1

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

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

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

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

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

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

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

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

Mobius roundtrip m=4 inverse complete inverse-term sum := sum(16, -9, 0)

Mobius roundtrip m=4 inverse complete inverse-term sum = 7

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

Mobius roundtrip m=4 inverse direct ORIGINAL a times n = 4

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

Mobius roundtrip m=4 inverse direct plus ORIGINAL b = 7

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

complete reconstructed=7;direct f(n)=7;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=8 forward:actual positive input=8;check complete integer range1..8

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=8 forward f(4) ORIGINAL a times divisor = 4

Mobius roundtrip m=8 forward f(4) plus ORIGINAL b := sum(4, 3)

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

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

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

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

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

Mobius roundtrip m=8 forward full forward divisor sum := sum(4, 5, 7, 11)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor2 = 4

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=8 inverse Mobius at ORIGINAL divisor4:actual positive input for mu=4

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

ORIGINAL positive integer absolute magnitude=4>1

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

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

upf extract divisor2 occurrence0 = 2

upf extract divisor2 occurrence1 := div(2, 2)

upf extract divisor2 occurrence1 = 1

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

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

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

upf canonical complete product factor0 = 2

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

upf canonical complete product factor1 = 4

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

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

Mobius roundtrip m=8 inverse Mobius at ORIGINAL divisor4:input=4;COMPLETE prime multiset=[2, 2];distinct primes=[2]

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

Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor4 := div(8, 4)

Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor4 = 2

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=8 inverse Mobius at ORIGINAL divisor8:actual positive input for mu=8

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

ORIGINAL positive integer absolute magnitude=8>1

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

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

upf extract divisor2 occurrence0 = 4

upf extract divisor2 occurrence1 := div(4, 2)

upf extract divisor2 occurrence1 = 2

upf extract divisor2 occurrence2 := div(2, 2)

upf extract divisor2 occurrence2 = 1

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

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

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

upf canonical complete product factor0 = 2

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

upf canonical complete product factor1 = 4

upf canonical complete product factor2 := mul(4, 2)

upf canonical complete product factor2 = 8

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

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

Mobius roundtrip m=8 inverse Mobius at ORIGINAL divisor8:input=8;COMPLETE prime multiset=[2, 2, 2];distinct primes=[2]

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

Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor8 := div(8, 8)

Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor8 = 1

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

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

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

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

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

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

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

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

Mobius roundtrip m=8 inverse complete inverse-term sum := sum(27, -16, 0, 0)

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

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

Mobius roundtrip m=8 inverse direct ORIGINAL a times n = 8

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

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

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

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=16 forward:actual positive input=16;check complete integer range1..16

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=16 forward f(4) ORIGINAL a times divisor = 4

Mobius roundtrip m=16 forward f(4) plus ORIGINAL b := sum(4, 3)

Mobius roundtrip m=16 forward f(4) plus ORIGINAL b = 7

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

Mobius roundtrip m=16 forward f(8) ORIGINAL a times divisor = 8

Mobius roundtrip m=16 forward f(8) plus ORIGINAL b := sum(8, 3)

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

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

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

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

Mobius roundtrip m=16 forward f(16) plus ORIGINAL b = 19

Mobius roundtrip m=16 forward full forward divisor sum := sum(4, 5, 7, 11, 19)

Mobius roundtrip m=16 forward full forward divisor sum = 46

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=16 inverse F(n/1) f(4) plus ORIGINAL b = 7

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

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

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

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

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

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

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

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

Mobius roundtrip m=16 inverse F(n/1) full forward divisor sum := sum(4, 5, 7, 11, 19)

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

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

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

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

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

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

Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor2 = 8

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=16 inverse F(n/2) f(2) plus ORIGINAL b = 5

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

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

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

Mobius roundtrip m=16 inverse F(n/2) f(4) plus ORIGINAL b = 7

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

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

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

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

Mobius roundtrip m=16 inverse F(n/2) full forward divisor sum := sum(4, 5, 7, 11)

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

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

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

Mobius roundtrip m=16 inverse Mobius at ORIGINAL divisor4:actual positive input for mu=4

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

ORIGINAL positive integer absolute magnitude=4>1

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

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

upf extract divisor2 occurrence0 = 2

upf extract divisor2 occurrence1 := div(2, 2)

upf extract divisor2 occurrence1 = 1

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

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

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

upf canonical complete product factor0 = 2

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

upf canonical complete product factor1 = 4

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

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

Mobius roundtrip m=16 inverse Mobius at ORIGINAL divisor4:input=4;COMPLETE prime multiset=[2, 2];distinct primes=[2]

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

Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor4 := div(16, 4)

Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor4 = 4

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=16 inverse F(n/4) f(2) plus ORIGINAL b = 5

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

Mobius roundtrip m=16 inverse F(n/4) f(4) ORIGINAL a times divisor = 4

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

Mobius roundtrip m=16 inverse F(n/4) f(4) plus ORIGINAL b = 7

Mobius roundtrip m=16 inverse F(n/4) full forward divisor sum := sum(4, 5, 7)

Mobius roundtrip m=16 inverse F(n/4) full forward divisor sum = 16

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

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

Mobius roundtrip m=16 inverse Mobius at ORIGINAL divisor8:actual positive input for mu=8

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

ORIGINAL positive integer absolute magnitude=8>1

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

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

upf extract divisor2 occurrence0 = 4

upf extract divisor2 occurrence1 := div(4, 2)

upf extract divisor2 occurrence1 = 2

upf extract divisor2 occurrence2 := div(2, 2)

upf extract divisor2 occurrence2 = 1

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

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

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

upf canonical complete product factor0 = 2

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

upf canonical complete product factor1 = 4

upf canonical complete product factor2 := mul(4, 2)

upf canonical complete product factor2 = 8

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

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

Mobius roundtrip m=16 inverse Mobius at ORIGINAL divisor8:input=8;COMPLETE prime multiset=[2, 2, 2];distinct primes=[2]

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

Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor8 := div(16, 8)

Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor8 = 2

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

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

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

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

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

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

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

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

Mobius roundtrip m=16 inverse F(n/8) full forward divisor sum := sum(4, 5)

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

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

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

Mobius roundtrip m=16 inverse Mobius at ORIGINAL divisor16:actual positive input for mu=16

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

ORIGINAL positive integer absolute magnitude=16>1

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

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

upf extract divisor2 occurrence0 = 8

upf extract divisor2 occurrence1 := div(8, 2)

upf extract divisor2 occurrence1 = 4

upf extract divisor2 occurrence2 := div(4, 2)

upf extract divisor2 occurrence2 = 2

upf extract divisor2 occurrence3 := div(2, 2)

upf extract divisor2 occurrence3 = 1

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

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

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

upf canonical complete product factor0 = 2

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

upf canonical complete product factor1 = 4

upf canonical complete product factor2 := mul(4, 2)

upf canonical complete product factor2 = 8

upf canonical complete product factor3 := mul(8, 2)

upf canonical complete product factor3 = 16

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

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

Mobius roundtrip m=16 inverse Mobius at ORIGINAL divisor16:input=16;COMPLETE prime multiset=[2, 2, 2, 2];distinct primes=[2]

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

Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor16 := div(16, 16)

Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor16 = 1

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

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

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

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

Mobius roundtrip m=16 inverse F(n/16) full forward divisor sum := sum(4)

Mobius roundtrip m=16 inverse F(n/16) full forward divisor sum = 4

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

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

Mobius roundtrip m=16 inverse complete inverse-term sum := sum(46, -27, 0, 0, 0)

Mobius roundtrip m=16 inverse complete inverse-term sum = 19

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

Mobius roundtrip m=16 inverse direct ORIGINAL a times n = 16

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

Mobius roundtrip m=16 inverse direct plus ORIGINAL b = 19

Mobius roundtrip m=16 inverse:actual n=16;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 16, 46, 46], [2, -1, 8, 27, -27], [4, 0, 4, 16, 0], [8, 0, 2, 9, 0], [16, 0, 1, 4, 0]]

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

逐步反向核對

• S289 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S288 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse direct plus ORIGINAL b，不以小數近似替代。
• S287 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse direct ORIGINAL a times n，不以小數近似替代。
• S286 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse complete inverse-term sum，不以小數近似替代。
• S285 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse mu(16) times SAME F(n/16)，不以小數近似替代。
• S284 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/16) full forward divisor sum，不以小數近似替代。
• S283 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/16) f(1) plus ORIGINAL b，不以小數近似替代。
• S282 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/16) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S281 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S280 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor16，不以小數近似替代。
• S279 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S278 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S277 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor3，不以小數近似替代。
• S276 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• S275 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S274 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S273 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S272 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence3，不以小數近似替代。
• S271 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence2，不以小數近似替代。
• S270 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence1，不以小數近似替代。
• S269 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S268 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S267 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S266 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse mu(8) times SAME F(n/8)，不以小數近似替代。
• S265 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/8) full forward divisor sum，不以小數近似替代。
• S264 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/8) f(2) plus ORIGINAL b，不以小數近似替代。
• S263 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/8) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S262 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/8) f(1) plus ORIGINAL b，不以小數近似替代。
• S261 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/8) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S260 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S259 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor8，不以小數近似替代。
• S258 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S257 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S256 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• S255 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S254 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S253 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S252 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence2，不以小數近似替代。
• S251 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence1，不以小數近似替代。
• S250 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S249 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S248 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S247 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse mu(4) times SAME F(n/4)，不以小數近似替代。
• S246 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/4) full forward divisor sum，不以小數近似替代。
• S245 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/4) f(4) plus ORIGINAL b，不以小數近似替代。
• S244 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/4) f(4) ORIGINAL a times divisor，不以小數近似替代。
• S243 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/4) f(2) plus ORIGINAL b，不以小數近似替代。
• S242 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/4) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S241 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/4) f(1) plus ORIGINAL b，不以小數近似替代。
• S240 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/4) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S239 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S238 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor4，不以小數近似替代。
• S237 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S236 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S235 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S234 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S233 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S232 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence1，不以小數近似替代。
• S231 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S230 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S229 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S228 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse mu(2) times SAME F(n/2)，不以小數近似替代。
• S227 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) full forward divisor sum，不以小數近似替代。
• S226 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) f(8) plus ORIGINAL b，不以小數近似替代。
• S225 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) f(8) ORIGINAL a times divisor，不以小數近似替代。
• S224 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) f(4) plus ORIGINAL b，不以小數近似替代。
• S223 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) f(4) ORIGINAL a times divisor，不以小數近似替代。
• S222 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) f(2) plus ORIGINAL b，不以小數近似替代。
• S221 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S220 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) f(1) plus ORIGINAL b，不以小數近似替代。
• S219 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/2) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S218 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S217 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor2，不以小數近似替代。
• S216 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S215 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S214 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S213 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S212 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S211 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S210 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S209 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(16) plus ORIGINAL b，不以小數近似替代。
• S208 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(16) ORIGINAL a times divisor，不以小數近似替代。
• S207 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(8) plus ORIGINAL b，不以小數近似替代。
• S206 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(8) ORIGINAL a times divisor，不以小數近似替代。
• S205 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(4) plus ORIGINAL b，不以小數近似替代。
• S204 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(4) ORIGINAL a times divisor，不以小數近似替代。
• S203 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(2) plus ORIGINAL b，不以小數近似替代。
• S202 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S201 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S200 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S199 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S198 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S197 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S196 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S195 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S194 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward full forward divisor sum，不以小數近似替代。
• S193 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(16) plus ORIGINAL b，不以小數近似替代。
• S192 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(16) ORIGINAL a times divisor，不以小數近似替代。
• S191 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(8) plus ORIGINAL b，不以小數近似替代。
• S190 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(8) ORIGINAL a times divisor，不以小數近似替代。
• S189 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(4) plus ORIGINAL b，不以小數近似替代。
• S188 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(4) ORIGINAL a times divisor，不以小數近似替代。
• S187 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(2) plus ORIGINAL b，不以小數近似替代。
• S186 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(2) ORIGINAL a times divisor，不以小數近似替代。
• S185 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S184 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=16 forward f(1) ORIGINAL a times divisor，不以小數近似替代。
• S183 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S182 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S181 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse direct plus ORIGINAL b，不以小數近似替代。
• S180 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse direct ORIGINAL a times n，不以小數近似替代。
• S179 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse complete inverse-term sum，不以小數近似替代。
• S178 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse mu(8) times SAME F(n/8)，不以小數近似替代。
• S177 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/8) full forward divisor sum，不以小數近似替代。
• S176 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/8) f(1) plus ORIGINAL b，不以小數近似替代。
• S175 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/8) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S174 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S173 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor8，不以小數近似替代。
• S172 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S171 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S170 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor2，不以小數近似替代。
• 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 occurrence2，不以小數近似替代。
• S165 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence1，不以小數近似替代。
• S164 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S163 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S162 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S161 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse mu(4) times SAME F(n/4)，不以小數近似替代。
• S160 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/4) full forward divisor sum，不以小數近似替代。
• S159 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/4) f(2) plus ORIGINAL b，不以小數近似替代。
• S158 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/4) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S157 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/4) f(1) plus ORIGINAL b，不以小數近似替代。
• S156 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/4) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S155 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S154 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor4，不以小數近似替代。
• S153 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S152 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S151 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S150 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S149 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S148 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence1，不以小數近似替代。
• S147 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S146 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S145 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S144 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse mu(2) times SAME F(n/2)，不以小數近似替代。
• S143 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/2) full forward divisor sum，不以小數近似替代。
• S142 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/2) f(4) plus ORIGINAL b，不以小數近似替代。
• S141 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/2) f(4) ORIGINAL a times divisor，不以小數近似替代。
• S140 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/2) f(2) plus ORIGINAL b，不以小數近似替代。
• S139 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/2) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S138 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/2) f(1) plus ORIGINAL b，不以小數近似替代。
• S137 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/2) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S136 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S135 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor2，不以小數近似替代。
• S134 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S133 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S132 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S131 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S130 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S129 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S128 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S127 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) f(8) plus ORIGINAL b，不以小數近似替代。
• S126 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) f(8) ORIGINAL a times divisor，不以小數近似替代。
• S125 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) f(4) plus ORIGINAL b，不以小數近似替代。
• S124 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) f(4) ORIGINAL a times divisor，不以小數近似替代。
• S123 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) f(2) plus ORIGINAL b，不以小數近似替代。
• S122 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S121 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S120 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S119 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S118 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S117 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S116 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S115 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S114 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward full forward divisor sum，不以小數近似替代。
• S113 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward f(8) plus ORIGINAL b，不以小數近似替代。
• S112 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward f(8) ORIGINAL a times divisor，不以小數近似替代。
• S111 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward f(4) plus ORIGINAL b，不以小數近似替代。
• S110 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward f(4) ORIGINAL a times divisor，不以小數近似替代。
• S109 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward f(2) plus ORIGINAL b，不以小數近似替代。
• S108 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward f(2) ORIGINAL a times divisor，不以小數近似替代。
• S107 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S106 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=8 forward f(1) ORIGINAL a times divisor，不以小數近似替代。
• S105 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S104 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S103 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse direct plus ORIGINAL b，不以小數近似替代。
• S102 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse direct ORIGINAL a times n，不以小數近似替代。
• S101 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse complete inverse-term sum，不以小數近似替代。
• S100 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse mu(4) times SAME F(n/4)，不以小數近似替代。
• S099 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/4) full forward divisor sum，不以小數近似替代。
• S098 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/4) f(1) plus ORIGINAL b，不以小數近似替代。
• S097 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/4) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S096 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S095 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse n divided by ORIGINAL divisor4，不以小數近似替代。
• S094 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S093 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S092 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor1，不以小數近似替代。
• S091 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S090 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S089 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence1，不以小數近似替代。
• S088 · premise_and_result_audit — 以精確有理數重算 upf extract divisor2 occurrence0，不以小數近似替代。
• S087 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S086 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S085 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse mu(2) times SAME F(n/2)，不以小數近似替代。
• S084 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/2) full forward divisor sum，不以小數近似替代。
• S083 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/2) f(2) plus ORIGINAL b，不以小數近似替代。
• S082 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/2) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S081 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/2) f(1) plus ORIGINAL b，不以小數近似替代。
• S080 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/2) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S079 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S078 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse n divided by ORIGINAL divisor2，不以小數近似替代。
• S077 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S076 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S075 · premise_and_result_audit — 以精確有理數重算 upf canonical complete product factor0，不以小數近似替代。
• S074 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S073 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S072 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse mu(1) times SAME F(n/1)，不以小數近似替代。
• S071 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/1) full forward divisor sum，不以小數近似替代。
• S070 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/1) f(4) plus ORIGINAL b，不以小數近似替代。
• S069 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/1) f(4) ORIGINAL a times divisor，不以小數近似替代。
• S068 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/1) f(2) plus ORIGINAL b，不以小數近似替代。
• S067 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/1) f(2) ORIGINAL a times divisor，不以小數近似替代。
• S066 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/1) f(1) plus ORIGINAL b，不以小數近似替代。
• S065 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse F(n/1) f(1) ORIGINAL a times divisor，不以小數近似替代。
• S064 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S063 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 inverse n divided by ORIGINAL divisor1，不以小數近似替代。
• S062 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S061 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S060 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S059 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 forward full forward divisor sum，不以小數近似替代。
• S058 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 forward f(4) plus ORIGINAL b，不以小數近似替代。
• S057 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 forward f(4) ORIGINAL a times divisor，不以小數近似替代。
• S056 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 forward f(2) plus ORIGINAL b，不以小數近似替代。
• S055 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 forward f(2) ORIGINAL a times divisor，不以小數近似替代。
• S054 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 forward f(1) plus ORIGINAL b，不以小數近似替代。
• S053 · premise_and_result_audit — 以精確有理數重算 Mobius roundtrip m=4 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 — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

(16, [[1, 4, 4, 4], [2, 9, 5, 5], [4, 16, 7, 7], [8, 27, 11, 11], [16, 46, 19, 19]], 是, finite_divisor_poset_roundtrip)

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

本題覆核與來源綁定

覆核日期：2026-10-26

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