Question 22195: Every Divisor Row Recovers Its Original Arithmetic Value

Original question and givens

Use positive integer n=20, exact integer arithmetic function f(k)=a*k+b with a=5, b=7. F(m) sums f(d) over every positive divisor d of m. Inversion uses mu(d)*F(m/d); complete prime multiplicities determine mu, with mu(1)=1. Do not replace d|m by d≤m or use only prime/proper divisors. Give (n, roundtrip_rows, all_equal, boundary).

• G001 — Use positive integer n=20, exact integer arithmetic function f(k)=a*k+b with a=5, b=7. F(m) sums f(d) over every positive divisor d of m. Inversion uses mu(d)*F(m/d); complete prime multiplicities determine mu, with mu(1)=1. Do not replace d|m by d≤m or use only prime/proper divisors. Give (n, roundtrip_rows, all_equal, boundary).

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

• mko-mobius-inversion-finite-divisors

Step-by-step derivation

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=20;check complete integer range1..20

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

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

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

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

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

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

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=Yes;repeated prime=No

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=2 forward full forward divisor sum := sum(12, 17)

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

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=Yes;repeated prime=No

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

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

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

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

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

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

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

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

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

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

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

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

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=No;repeated prime=No

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

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

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

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

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

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

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

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

Mobius roundtrip m=2 inverse complete inverse-term sum := sum(29, -12)

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

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

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

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

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

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, 29, 29], [2, -1, 1, 12, -12]]

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=4 forward full forward divisor sum := sum(12, 17, 27)

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

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=Yes;repeated prime=No

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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=No;repeated prime=No

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

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

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

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

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

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

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

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

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

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

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

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

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=No;repeated prime=Yes

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

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

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

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

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

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

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

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

Mobius roundtrip m=4 inverse complete inverse-term sum := sum(56, -29, 0)

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

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

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

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

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

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, 56, 56], [2, -1, 2, 29, -29], [4, 0, 1, 12, 0]]

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

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

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

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

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

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

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

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

Mobius roundtrip m=5 forward f(5) plus ORIGINAL b := sum(25, 7)

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

Mobius roundtrip m=5 forward full forward divisor sum := sum(12, 32)

Mobius roundtrip m=5 forward full forward divisor sum = 44

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

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

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

mu=1;empty product case=Yes;repeated prime=No

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=5 inverse Mobius at ORIGINAL divisor5:actual positive input for mu=5

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

ORIGINAL positive integer absolute magnitude=5>1

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

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

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

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

upf canonical complete product factor0 = 5

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

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

Mobius roundtrip m=5 inverse Mobius at ORIGINAL divisor5:input=5;COMPLETE prime multiset=[5];distinct primes=[5]

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

Mobius roundtrip m=5 inverse n divided by ORIGINAL divisor5 := div(5, 5)

Mobius roundtrip m=5 inverse n divided by ORIGINAL divisor5 = 1

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

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

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

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

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

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

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

Mobius roundtrip m=5 inverse mu(5) times SAME F(n/5) = -12

Mobius roundtrip m=5 inverse complete inverse-term sum := sum(44, -12)

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

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

Mobius roundtrip m=5 inverse direct ORIGINAL a times n = 25

Mobius roundtrip m=5 inverse direct plus ORIGINAL b := sum(25, 7)

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=10 forward f(5) ORIGINAL a times divisor = 25

Mobius roundtrip m=10 forward f(5) plus ORIGINAL b := sum(25, 7)

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

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

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

Mobius roundtrip m=10 forward f(10) plus ORIGINAL b := sum(50, 7)

Mobius roundtrip m=10 forward f(10) plus ORIGINAL b = 57

Mobius roundtrip m=10 forward full forward divisor sum := sum(12, 17, 32, 57)

Mobius roundtrip m=10 forward full forward divisor sum = 118

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

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

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

mu=1;empty product case=Yes;repeated prime=No

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=10 inverse F(n/1) full forward divisor sum := sum(12, 17, 32, 57)

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

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

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

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

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

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

Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor2 = 5

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

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

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

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

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

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

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

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

Mobius roundtrip m=10 inverse F(n/2) f(5) plus ORIGINAL b := sum(25, 7)

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

Mobius roundtrip m=10 inverse F(n/2) full forward divisor sum := sum(12, 32)

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

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

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

Mobius roundtrip m=10 inverse Mobius at ORIGINAL divisor5:actual positive input for mu=5

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

ORIGINAL positive integer absolute magnitude=5>1

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

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

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

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

upf canonical complete product factor0 = 5

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

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

Mobius roundtrip m=10 inverse Mobius at ORIGINAL divisor5:input=5;COMPLETE prime multiset=[5];distinct primes=[5]

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

Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor5 := div(10, 5)

Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor5 = 2

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

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

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

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

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

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

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

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

Mobius roundtrip m=10 inverse F(n/5) full forward divisor sum := sum(12, 17)

Mobius roundtrip m=10 inverse F(n/5) full forward divisor sum = 29

Mobius roundtrip m=10 inverse mu(5) times SAME F(n/5) := mul(-1, 29)

Mobius roundtrip m=10 inverse mu(5) times SAME F(n/5) = -29

Mobius roundtrip m=10 inverse Mobius at ORIGINAL divisor10:actual positive input for mu=10

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

ORIGINAL positive integer absolute magnitude=10>1

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

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

upf extract divisor2 occurrence0 = 5

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

extracted multiplicity=1;next remaining=5;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, 5)

upf canonical complete product factor1 = 10

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

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

Mobius roundtrip m=10 inverse Mobius at ORIGINAL divisor10:input=10;COMPLETE prime multiset=[2, 5];distinct primes=[2, 5]

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

Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor10 := div(10, 10)

Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor10 = 1

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

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

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

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

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

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

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

Mobius roundtrip m=10 inverse mu(10) times SAME F(n/10) = 12

Mobius roundtrip m=10 inverse complete inverse-term sum := sum(118, -44, -29, 12)

Mobius roundtrip m=10 inverse complete inverse-term sum = 57

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

Mobius roundtrip m=10 inverse direct ORIGINAL a times n = 50

Mobius roundtrip m=10 inverse direct plus ORIGINAL b := sum(50, 7)

Mobius roundtrip m=10 inverse direct plus ORIGINAL b = 57

Mobius roundtrip m=10 inverse:actual n=10;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 10, 118, 118], [2, -1, 5, 44, -44], [5, -1, 2, 29, -29], [10, 1, 1, 12, 12]]

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

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

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

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

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

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

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

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

Mobius roundtrip m=20 forward f(2) plus ORIGINAL b := sum(10, 7)

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

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

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

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

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

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

Mobius roundtrip m=20 forward f(5) ORIGINAL a times divisor = 25

Mobius roundtrip m=20 forward f(5) plus ORIGINAL b := sum(25, 7)

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

Mobius roundtrip m=20 forward f(10) ORIGINAL a times divisor := mul(5, 10)

Mobius roundtrip m=20 forward f(10) ORIGINAL a times divisor = 50

Mobius roundtrip m=20 forward f(10) plus ORIGINAL b := sum(50, 7)

Mobius roundtrip m=20 forward f(10) plus ORIGINAL b = 57

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

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

Mobius roundtrip m=20 forward f(20) plus ORIGINAL b := sum(100, 7)

Mobius roundtrip m=20 forward f(20) plus ORIGINAL b = 107

Mobius roundtrip m=20 forward full forward divisor sum := sum(12, 17, 27, 32, 57, 107)

Mobius roundtrip m=20 forward full forward divisor sum = 252

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

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

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

mu=1;empty product case=Yes;repeated prime=No

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mobius roundtrip m=20 inverse F(n/1) f(10) plus ORIGINAL b := sum(50, 7)

Mobius roundtrip m=20 inverse F(n/1) f(10) plus ORIGINAL b = 57

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

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

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

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

Mobius roundtrip m=20 inverse F(n/1) full forward divisor sum := sum(12, 17, 27, 32, 57, 107)

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

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

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

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

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

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

Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor2 = 10

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

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

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

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

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

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

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

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

Mobius roundtrip m=20 inverse F(n/2) f(2) plus ORIGINAL b := sum(10, 7)

Mobius roundtrip m=20 inverse F(n/2) f(2) plus ORIGINAL b = 17

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

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

Mobius roundtrip m=20 inverse F(n/2) f(5) plus ORIGINAL b := sum(25, 7)

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

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

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

Mobius roundtrip m=20 inverse F(n/2) f(10) plus ORIGINAL b := sum(50, 7)

Mobius roundtrip m=20 inverse F(n/2) f(10) plus ORIGINAL b = 57

Mobius roundtrip m=20 inverse F(n/2) full forward divisor sum := sum(12, 17, 32, 57)

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

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

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

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

mu=0;empty product case=No;repeated prime=Yes

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

Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor4 = 5

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

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

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

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

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

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

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

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

Mobius roundtrip m=20 inverse F(n/4) f(5) plus ORIGINAL b := sum(25, 7)

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

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

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

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

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

Mobius roundtrip m=20 inverse Mobius at ORIGINAL divisor5:actual positive input for mu=5

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

ORIGINAL positive integer absolute magnitude=5>1

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

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

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

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

upf canonical complete product factor0 = 5

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

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

Mobius roundtrip m=20 inverse Mobius at ORIGINAL divisor5:input=5;COMPLETE prime multiset=[5];distinct primes=[5]

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

Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor5 := div(20, 5)

Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor5 = 4

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

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

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

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

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

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

Mobius roundtrip m=20 inverse F(n/5) f(2) plus ORIGINAL b := sum(10, 7)

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

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

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

Mobius roundtrip m=20 inverse F(n/5) f(4) plus ORIGINAL b := sum(20, 7)

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

Mobius roundtrip m=20 inverse F(n/5) full forward divisor sum := sum(12, 17, 27)

Mobius roundtrip m=20 inverse F(n/5) full forward divisor sum = 56

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

Mobius roundtrip m=20 inverse mu(5) times SAME F(n/5) = -56

Mobius roundtrip m=20 inverse Mobius at ORIGINAL divisor10:actual positive input for mu=10

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

ORIGINAL positive integer absolute magnitude=10>1

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

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

upf extract divisor2 occurrence0 = 5

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

extracted multiplicity=1;next remaining=5;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, 5)

upf canonical complete product factor1 = 10

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

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

Mobius roundtrip m=20 inverse Mobius at ORIGINAL divisor10:input=10;COMPLETE prime multiset=[2, 5];distinct primes=[2, 5]

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

Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor10 := div(20, 10)

Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor10 = 2

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

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

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

Mobius roundtrip m=20 inverse F(n/10) f(1) plus ORIGINAL b = 12

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

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

Mobius roundtrip m=20 inverse F(n/10) f(2) plus ORIGINAL b := sum(10, 7)

Mobius roundtrip m=20 inverse F(n/10) f(2) plus ORIGINAL b = 17

Mobius roundtrip m=20 inverse F(n/10) full forward divisor sum := sum(12, 17)

Mobius roundtrip m=20 inverse F(n/10) full forward divisor sum = 29

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

Mobius roundtrip m=20 inverse mu(10) times SAME F(n/10) = 29

Mobius roundtrip m=20 inverse Mobius at ORIGINAL divisor20:actual positive input for mu=20

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

ORIGINAL positive integer absolute magnitude=20>1

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

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

upf extract divisor2 occurrence0 = 10

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

upf extract divisor2 occurrence1 = 5

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

extracted multiplicity=2;next remaining=5;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

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

upf canonical complete product factor2 = 20

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

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

Mobius roundtrip m=20 inverse Mobius at ORIGINAL divisor20:input=20;COMPLETE prime multiset=[2, 2, 5];distinct primes=[2, 5]

mu=0;empty product case=No;repeated prime=Yes

Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor20 := div(20, 20)

Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor20 = 1

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

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

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

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

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

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

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

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

Mobius roundtrip m=20 inverse complete inverse-term sum := sum(252, -118, 0, -56, 29, 0)

Mobius roundtrip m=20 inverse complete inverse-term sum = 107

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

Mobius roundtrip m=20 inverse direct ORIGINAL a times n = 100

Mobius roundtrip m=20 inverse direct plus ORIGINAL b := sum(100, 7)

Mobius roundtrip m=20 inverse direct plus ORIGINAL b = 107

Mobius roundtrip m=20 inverse:actual n=20;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 20, 252, 252], [2, -1, 10, 118, -118], [4, 0, 5, 44, 0], [5, -1, 4, 56, -56], [10, 1, 2, 29, 29], [20, 0, 1, 12, 0]]

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

Reverse checks

• S326 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S325 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse direct plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S324 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse direct ORIGINAL a times n with exact rational arithmetic, not rounded decimals.
• S323 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse complete inverse-term sum with exact rational arithmetic, not rounded decimals.
• S322 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse mu(20) times SAME F(n/20) with exact rational arithmetic, not rounded decimals.
• S321 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/20) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S320 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/20) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S319 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/20) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S318 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S317 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor20 with exact rational arithmetic, not rounded decimals.
• S316 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S315 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S314 · premise_and_result_audit — Recompute upf canonical complete product factor2 with exact rational arithmetic, not rounded decimals.
• S313 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals.
• S312 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S311 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S310 · premise_and_result_audit — Recompute upf extract divisor2 occurrence1 with exact rational arithmetic, not rounded decimals.
• S309 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals.
• S308 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S307 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S306 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse mu(10) times SAME F(n/10) with exact rational arithmetic, not rounded decimals.
• S305 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/10) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S304 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/10) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S303 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/10) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S302 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/10) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S301 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/10) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S300 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S299 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor10 with exact rational arithmetic, not rounded decimals.
• S298 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S297 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S296 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals.
• S295 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S294 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S293 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals.
• S292 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S291 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S290 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse mu(5) times SAME F(n/5) with exact rational arithmetic, not rounded decimals.
• S289 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/5) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S288 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/5) f(4) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S287 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/5) f(4) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S286 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/5) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S285 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/5) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S284 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/5) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S283 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/5) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S282 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S281 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor5 with exact rational arithmetic, not rounded decimals.
• S280 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S279 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S278 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S277 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S276 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S275 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S274 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse mu(4) times SAME F(n/4) with exact rational arithmetic, not rounded decimals.
• S273 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/4) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S272 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/4) f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S271 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/4) f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S270 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/4) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S269 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/4) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S268 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S267 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor4 with exact rational arithmetic, not rounded decimals.
• S266 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S265 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S264 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals.
• S263 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S262 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S261 · premise_and_result_audit — Recompute upf extract divisor2 occurrence1 with exact rational arithmetic, not rounded decimals.
• S260 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals.
• S259 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S258 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S257 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse mu(2) times SAME F(n/2) with exact rational arithmetic, not rounded decimals.
• S256 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S255 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) f(10) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S254 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) f(10) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S253 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S252 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S251 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S250 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S249 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S248 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/2) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S247 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S246 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor2 with exact rational arithmetic, not rounded decimals.
• S245 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S244 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S243 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S242 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S241 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S240 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse mu(1) times SAME F(n/1) with exact rational arithmetic, not rounded decimals.
• S239 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S238 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(20) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S237 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(20) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S236 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(10) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S235 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(10) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S234 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S233 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S232 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(4) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S231 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(4) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S230 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S229 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S228 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S227 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse F(n/1) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S226 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S225 · premise_and_result_audit — Recompute Mobius roundtrip m=20 inverse n divided by ORIGINAL divisor1 with exact rational arithmetic, not rounded decimals.
• S224 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S223 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S222 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S221 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S220 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(20) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S219 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(20) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S218 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(10) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S217 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(10) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S216 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S215 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S214 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(4) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S213 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(4) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S212 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S211 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S210 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S209 · premise_and_result_audit — Recompute Mobius roundtrip m=20 forward f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S208 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S207 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S206 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse direct plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S205 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse direct ORIGINAL a times n with exact rational arithmetic, not rounded decimals.
• S204 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse complete inverse-term sum with exact rational arithmetic, not rounded decimals.
• S203 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse mu(10) times SAME F(n/10) with exact rational arithmetic, not rounded decimals.
• S202 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/10) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S201 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/10) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S200 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/10) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S199 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S198 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor10 with exact rational arithmetic, not rounded decimals.
• S197 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S196 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S195 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals.
• S194 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S193 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S192 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals.
• S191 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S190 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S189 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse mu(5) times SAME F(n/5) with exact rational arithmetic, not rounded decimals.
• S188 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/5) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S187 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/5) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S186 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/5) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S185 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/5) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S184 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/5) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S183 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S182 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor5 with exact rational arithmetic, not rounded decimals.
• S181 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S180 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S179 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S178 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S177 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S176 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S175 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse mu(2) times SAME F(n/2) with exact rational arithmetic, not rounded decimals.
• S174 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/2) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S173 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/2) f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S172 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/2) f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S171 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/2) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S170 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/2) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S169 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S168 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor2 with exact rational arithmetic, not rounded decimals.
• S167 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S166 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S165 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S164 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S163 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S162 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse mu(1) times SAME F(n/1) with exact rational arithmetic, not rounded decimals.
• S161 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S160 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) f(10) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S159 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) f(10) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S158 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S157 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S156 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S155 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S154 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S153 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse F(n/1) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S152 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S151 · premise_and_result_audit — Recompute Mobius roundtrip m=10 inverse n divided by ORIGINAL divisor1 with exact rational arithmetic, not rounded decimals.
• S150 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S149 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S148 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S147 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S146 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward f(10) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S145 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward f(10) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S144 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S143 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S142 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S141 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S140 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S139 · premise_and_result_audit — Recompute Mobius roundtrip m=10 forward f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S138 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S137 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S136 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse direct plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S135 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse direct ORIGINAL a times n with exact rational arithmetic, not rounded decimals.
• S134 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse complete inverse-term sum with exact rational arithmetic, not rounded decimals.
• S133 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse mu(5) times SAME F(n/5) with exact rational arithmetic, not rounded decimals.
• S132 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse F(n/5) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S131 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse F(n/5) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S130 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse F(n/5) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S129 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S128 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse n divided by ORIGINAL divisor5 with exact rational arithmetic, not rounded decimals.
• S127 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S126 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S125 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S124 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S123 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S122 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S121 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse mu(1) times SAME F(n/1) with exact rational arithmetic, not rounded decimals.
• S120 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse F(n/1) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S119 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse F(n/1) f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S118 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse F(n/1) f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S117 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse F(n/1) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S116 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse F(n/1) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S115 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S114 · premise_and_result_audit — Recompute Mobius roundtrip m=5 inverse n divided by ORIGINAL divisor1 with exact rational arithmetic, not rounded decimals.
• S113 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S112 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S111 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S110 · premise_and_result_audit — Recompute Mobius roundtrip m=5 forward full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S109 · premise_and_result_audit — Recompute Mobius roundtrip m=5 forward f(5) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S108 · premise_and_result_audit — Recompute Mobius roundtrip m=5 forward f(5) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S107 · premise_and_result_audit — Recompute Mobius roundtrip m=5 forward f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S106 · premise_and_result_audit — Recompute Mobius roundtrip m=5 forward f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S105 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S104 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S103 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse direct plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S102 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse direct ORIGINAL a times n with exact rational arithmetic, not rounded decimals.
• S101 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse complete inverse-term sum with exact rational arithmetic, not rounded decimals.
• S100 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse mu(4) times SAME F(n/4) with exact rational arithmetic, not rounded decimals.
• S099 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/4) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S098 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/4) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S097 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/4) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S096 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S095 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse n divided by ORIGINAL divisor4 with exact rational arithmetic, not rounded decimals.
• S094 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S093 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S092 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals.
• S091 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S090 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S089 · premise_and_result_audit — Recompute upf extract divisor2 occurrence1 with exact rational arithmetic, not rounded decimals.
• S088 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals.
• S087 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S086 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S085 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse mu(2) times SAME F(n/2) with exact rational arithmetic, not rounded decimals.
• S084 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/2) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S083 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/2) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S082 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/2) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S081 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/2) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S080 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/2) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S079 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S078 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse n divided by ORIGINAL divisor2 with exact rational arithmetic, not rounded decimals.
• S077 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S076 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S075 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S074 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S073 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S072 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse mu(1) times SAME F(n/1) with exact rational arithmetic, not rounded decimals.
• S071 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/1) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S070 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/1) f(4) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S069 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/1) f(4) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S068 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/1) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S067 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/1) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S066 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/1) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S065 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse F(n/1) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S064 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S063 · premise_and_result_audit — Recompute Mobius roundtrip m=4 inverse n divided by ORIGINAL divisor1 with exact rational arithmetic, not rounded decimals.
• S062 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S061 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S060 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S059 · premise_and_result_audit — Recompute Mobius roundtrip m=4 forward full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S058 · premise_and_result_audit — Recompute Mobius roundtrip m=4 forward f(4) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S057 · premise_and_result_audit — Recompute Mobius roundtrip m=4 forward f(4) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S056 · premise_and_result_audit — Recompute Mobius roundtrip m=4 forward f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S055 · premise_and_result_audit — Recompute Mobius roundtrip m=4 forward f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S054 · premise_and_result_audit — Recompute Mobius roundtrip m=4 forward f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S053 · premise_and_result_audit — Recompute Mobius roundtrip m=4 forward f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S052 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S051 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S050 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse direct plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S049 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse direct ORIGINAL a times n with exact rational arithmetic, not rounded decimals.
• S048 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse complete inverse-term sum with exact rational arithmetic, not rounded decimals.
• S047 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse mu(2) times SAME F(n/2) with exact rational arithmetic, not rounded decimals.
• S046 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse F(n/2) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S045 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse F(n/2) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S044 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse F(n/2) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S043 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S042 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse n divided by ORIGINAL divisor2 with exact rational arithmetic, not rounded decimals.
• S041 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S040 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S039 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals.
• S038 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S037 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S036 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse mu(1) times SAME F(n/1) with exact rational arithmetic, not rounded decimals.
• S035 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse F(n/1) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S034 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse F(n/1) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S033 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse F(n/1) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S032 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse F(n/1) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S031 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse F(n/1) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S030 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S029 · premise_and_result_audit — Recompute Mobius roundtrip m=2 inverse n divided by ORIGINAL divisor1 with exact rational arithmetic, not rounded decimals.
• S028 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S027 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S026 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S025 · premise_and_result_audit — Recompute Mobius roundtrip m=2 forward full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S024 · premise_and_result_audit — Recompute Mobius roundtrip m=2 forward f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S023 · premise_and_result_audit — Recompute Mobius roundtrip m=2 forward f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S022 · premise_and_result_audit — Recompute Mobius roundtrip m=2 forward f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S021 · premise_and_result_audit — Recompute Mobius roundtrip m=2 forward f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S020 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S018 · premise_and_result_audit — Recompute Mobius roundtrip m=1 inverse direct plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S017 · premise_and_result_audit — Recompute Mobius roundtrip m=1 inverse direct ORIGINAL a times n with exact rational arithmetic, not rounded decimals.
• S016 · premise_and_result_audit — Recompute Mobius roundtrip m=1 inverse complete inverse-term sum with exact rational arithmetic, not rounded decimals.
• S015 · premise_and_result_audit — Recompute Mobius roundtrip m=1 inverse mu(1) times SAME F(n/1) with exact rational arithmetic, not rounded decimals.
• S014 · premise_and_result_audit — Recompute Mobius roundtrip m=1 inverse F(n/1) full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S013 · premise_and_result_audit — Recompute Mobius roundtrip m=1 inverse F(n/1) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S012 · premise_and_result_audit — Recompute Mobius roundtrip m=1 inverse F(n/1) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S010 · premise_and_result_audit — Recompute Mobius roundtrip m=1 inverse n divided by ORIGINAL divisor1 with exact rational arithmetic, not rounded decimals.
• S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S006 · premise_and_result_audit — Recompute Mobius roundtrip m=1 forward full forward divisor sum with exact rational arithmetic, not rounded decimals.
• S005 · premise_and_result_audit — Recompute Mobius roundtrip m=1 forward f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals.
• S004 · premise_and_result_audit — Recompute Mobius roundtrip m=1 forward f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals.
• S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

(20, [[1, 12, 12, 12], [2, 29, 17, 17], [4, 56, 27, 27], [5, 44, 32, 32], [10, 118, 57, 57], [20, 252, 107, 107]], Yes, finite_divisor_poset_roundtrip)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.