# Question 22145: An Omitted Divisor Must Be a Discriminative Missing-Term Witness [Return to catalogue page 111](https://ocme.evemisslab.com/en/questions/page/111/) [← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261014-advance-20261110-r06-mobius-inversion-finite-divisors-foundations/#q-20261014-advance-20261110-r06-mobius-inversion-finite-divisors-0095) This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth. R0043-22145 · q-20261014-advance-20261110-r06-mobius-inversion-finite-divisors-0095 ## Original question and givens Use positive integer n=462, exact integer arithmetic function f(k)=a*k+b with a=20, b=1. 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. Omit divisor=1. Give (n, all_divisors, omitted_divisor, partial_divisors, complete_value, partial_value, f_n, incomplete_certificate, boundary). - G001 — Use positive integer n=462, exact integer arithmetic function f(k)=a*k+b with a=20, b=1. 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. Omit divisor=1. Give (n, all_divisors, omitted_divisor, partial_divisors, complete_value, partial_value, f_n, incomplete_certificate, 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](https://ocme.evemisslab.com/en/mko/mko-mobius-inversion-finite-divisors/) ## Step-by-step derivation S001 · impliesBefore source operation=mobinv-incomplete-divisor-boundary;original snapshot and mathematics retained After explicit ordered source output fields=[n, all_divisors, omitted_divisor, partial_divisors, complete_value, partial_value, f_n, incomplete_certificate, boundary] Conditions: none Retain the historical interface marker and list ordered source fields without JavaScript.MVT fields come from the original mode,without padding or answer-shape inference.Tags and fixed No markers retain their claim scope. Step identifiers and dependenciesRule: source_ordered_interface_explicit_without_javascript · Uses: G001 S002 · impliesBefore Mobius inversion ORIGINAL inverse:actual positive input=462;check complete integer range1..462 After ALL positive divisors INCREASING=[1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S001 S003 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor1:actual positive input for mu=1 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S002 S004 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor1:input=1;COMPLETE prime multiset=[];distinct primes=[] After mu=1;empty product case=Yes;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S003 S005 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor1 := div(462, 1) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor1 = 462 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S004 S006 · impliesBefore Mobius inversion ORIGINAL inverse F(n/1):actual positive input=462;check complete integer range1..462 After ALL positive divisors INCREASING=[1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S005 S007 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S006 S008 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S007 S009 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(2) ORIGINAL a times divisor := mul(20, 2) After Mobius inversion ORIGINAL inverse F(n/1) f(2) ORIGINAL a times divisor = 40 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S008 S010 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(2) plus ORIGINAL b := sum(40, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(2) plus ORIGINAL b = 41 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S009 S011 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(3) ORIGINAL a times divisor := mul(20, 3) After Mobius inversion ORIGINAL inverse F(n/1) f(3) ORIGINAL a times divisor = 60 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S010 S012 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(3) plus ORIGINAL b := sum(60, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(3) plus ORIGINAL b = 61 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S011 S013 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(6) ORIGINAL a times divisor := mul(20, 6) After Mobius inversion ORIGINAL inverse F(n/1) f(6) ORIGINAL a times divisor = 120 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S012 S014 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(6) plus ORIGINAL b := sum(120, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(6) plus ORIGINAL b = 121 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S013 S015 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(7) ORIGINAL a times divisor := mul(20, 7) After Mobius inversion ORIGINAL inverse F(n/1) f(7) ORIGINAL a times divisor = 140 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S014 S016 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(7) plus ORIGINAL b := sum(140, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(7) plus ORIGINAL b = 141 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S015 S017 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(11) ORIGINAL a times divisor := mul(20, 11) After Mobius inversion ORIGINAL inverse F(n/1) f(11) ORIGINAL a times divisor = 220 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S016 S018 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(11) plus ORIGINAL b := sum(220, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(11) plus ORIGINAL b = 221 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S017 S019 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(14) ORIGINAL a times divisor := mul(20, 14) After Mobius inversion ORIGINAL inverse F(n/1) f(14) ORIGINAL a times divisor = 280 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S018 S020 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(14) plus ORIGINAL b := sum(280, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(14) plus ORIGINAL b = 281 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S019 S021 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(21) ORIGINAL a times divisor := mul(20, 21) After Mobius inversion ORIGINAL inverse F(n/1) f(21) ORIGINAL a times divisor = 420 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S020 S022 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(21) plus ORIGINAL b := sum(420, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(21) plus ORIGINAL b = 421 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S021 S023 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(22) ORIGINAL a times divisor := mul(20, 22) After Mobius inversion ORIGINAL inverse F(n/1) f(22) ORIGINAL a times divisor = 440 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S022 S024 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(22) plus ORIGINAL b := sum(440, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(22) plus ORIGINAL b = 441 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S023 S025 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(33) ORIGINAL a times divisor := mul(20, 33) After Mobius inversion ORIGINAL inverse F(n/1) f(33) ORIGINAL a times divisor = 660 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S024 S026 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(33) plus ORIGINAL b := sum(660, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(33) plus ORIGINAL b = 661 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S025 S027 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(42) ORIGINAL a times divisor := mul(20, 42) After Mobius inversion ORIGINAL inverse F(n/1) f(42) ORIGINAL a times divisor = 840 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S026 S028 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(42) plus ORIGINAL b := sum(840, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(42) plus ORIGINAL b = 841 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S027 S029 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(66) ORIGINAL a times divisor := mul(20, 66) After Mobius inversion ORIGINAL inverse F(n/1) f(66) ORIGINAL a times divisor = 1320 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S028 S030 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(66) plus ORIGINAL b := sum(1320, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(66) plus ORIGINAL b = 1321 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S029 S031 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(77) ORIGINAL a times divisor := mul(20, 77) After Mobius inversion ORIGINAL inverse F(n/1) f(77) ORIGINAL a times divisor = 1540 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S030 S032 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(77) plus ORIGINAL b := sum(1540, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(77) plus ORIGINAL b = 1541 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S031 S033 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(154) ORIGINAL a times divisor := mul(20, 154) After Mobius inversion ORIGINAL inverse F(n/1) f(154) ORIGINAL a times divisor = 3080 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S032 S034 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(154) plus ORIGINAL b := sum(3080, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(154) plus ORIGINAL b = 3081 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S033 S035 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(231) ORIGINAL a times divisor := mul(20, 231) After Mobius inversion ORIGINAL inverse F(n/1) f(231) ORIGINAL a times divisor = 4620 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S034 S036 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(231) plus ORIGINAL b := sum(4620, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(231) plus ORIGINAL b = 4621 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S035 S037 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(462) ORIGINAL a times divisor := mul(20, 462) After Mobius inversion ORIGINAL inverse F(n/1) f(462) ORIGINAL a times divisor = 9240 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S036 S038 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) f(462) plus ORIGINAL b := sum(9240, 1) After Mobius inversion ORIGINAL inverse F(n/1) f(462) plus ORIGINAL b = 9241 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S037 S039 · calculationBefore Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum := sum(21, 41, 61, 121, 141, 221, 281, 421, 441, 661, 841, 1321, 1541, 3081, 4621, 9241) After Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum = 23056 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S038 S040 · calculationBefore Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1) := mul(1, 23056) After Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1) = 23056 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S039 S041 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor2:actual positive input for mu=2 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S040 S042 · impliesBefore ORIGINAL positive integer absolute magnitude=2>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S041 S043 · calculationBefore upf canonical complete product factor0 := mul(1, 2) After upf canonical complete product factor0 = 2 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S042 S044 · impliesBefore exhausted trial divisors below2;terminal remaining=2;d*d>remaining;ORIGINAL n=2 After complete increasing prime multiset=[2];full product=2;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S043 S045 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor2:input=2;COMPLETE prime multiset=[2];distinct primes=[2] After mu=-1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S044 S046 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2 := div(462, 2) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2 = 231 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S045 S047 · impliesBefore Mobius inversion ORIGINAL inverse F(n/2):actual positive input=231;check complete integer range1..231 After ALL positive divisors INCREASING=[1, 3, 7, 11, 21, 33, 77, 231];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S046 S048 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S047 S049 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S048 S050 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(3) ORIGINAL a times divisor := mul(20, 3) After Mobius inversion ORIGINAL inverse F(n/2) f(3) ORIGINAL a times divisor = 60 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S049 S051 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(3) plus ORIGINAL b := sum(60, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(3) plus ORIGINAL b = 61 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S050 S052 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(7) ORIGINAL a times divisor := mul(20, 7) After Mobius inversion ORIGINAL inverse F(n/2) f(7) ORIGINAL a times divisor = 140 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S051 S053 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(7) plus ORIGINAL b := sum(140, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(7) plus ORIGINAL b = 141 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S052 S054 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(11) ORIGINAL a times divisor := mul(20, 11) After Mobius inversion ORIGINAL inverse F(n/2) f(11) ORIGINAL a times divisor = 220 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S053 S055 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(11) plus ORIGINAL b := sum(220, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(11) plus ORIGINAL b = 221 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S054 S056 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(21) ORIGINAL a times divisor := mul(20, 21) After Mobius inversion ORIGINAL inverse F(n/2) f(21) ORIGINAL a times divisor = 420 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S055 S057 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(21) plus ORIGINAL b := sum(420, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(21) plus ORIGINAL b = 421 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S056 S058 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(33) ORIGINAL a times divisor := mul(20, 33) After Mobius inversion ORIGINAL inverse F(n/2) f(33) ORIGINAL a times divisor = 660 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S057 S059 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(33) plus ORIGINAL b := sum(660, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(33) plus ORIGINAL b = 661 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S058 S060 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(77) ORIGINAL a times divisor := mul(20, 77) After Mobius inversion ORIGINAL inverse F(n/2) f(77) ORIGINAL a times divisor = 1540 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S059 S061 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(77) plus ORIGINAL b := sum(1540, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(77) plus ORIGINAL b = 1541 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S060 S062 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(231) ORIGINAL a times divisor := mul(20, 231) After Mobius inversion ORIGINAL inverse F(n/2) f(231) ORIGINAL a times divisor = 4620 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S061 S063 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) f(231) plus ORIGINAL b := sum(4620, 1) After Mobius inversion ORIGINAL inverse F(n/2) f(231) plus ORIGINAL b = 4621 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S062 S064 · calculationBefore Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum := sum(21, 61, 141, 221, 421, 661, 1541, 4621) After Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum = 7688 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S063 S065 · calculationBefore Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2) := mul(-1, 7688) After Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2) = -7688 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S064 S066 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor3:actual positive input for mu=3 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S065 S067 · impliesBefore ORIGINAL positive integer absolute magnitude=3>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S066 S068 · calculationBefore upf canonical complete product factor0 := mul(1, 3) After upf canonical complete product factor0 = 3 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S067 S069 · impliesBefore exhausted trial divisors below2;terminal remaining=3;d*d>remaining;ORIGINAL n=3 After complete increasing prime multiset=[3];full product=3;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S068 S070 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor3:input=3;COMPLETE prime multiset=[3];distinct primes=[3] After mu=-1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S069 S071 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor3 := div(462, 3) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor3 = 154 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S070 S072 · impliesBefore Mobius inversion ORIGINAL inverse F(n/3):actual positive input=154;check complete integer range1..154 After ALL positive divisors INCREASING=[1, 2, 7, 11, 14, 22, 77, 154];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S071 S073 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S072 S074 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S073 S075 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(2) ORIGINAL a times divisor := mul(20, 2) After Mobius inversion ORIGINAL inverse F(n/3) f(2) ORIGINAL a times divisor = 40 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S074 S076 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(2) plus ORIGINAL b := sum(40, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(2) plus ORIGINAL b = 41 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S075 S077 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(7) ORIGINAL a times divisor := mul(20, 7) After Mobius inversion ORIGINAL inverse F(n/3) f(7) ORIGINAL a times divisor = 140 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S076 S078 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(7) plus ORIGINAL b := sum(140, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(7) plus ORIGINAL b = 141 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S077 S079 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(11) ORIGINAL a times divisor := mul(20, 11) After Mobius inversion ORIGINAL inverse F(n/3) f(11) ORIGINAL a times divisor = 220 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S078 S080 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(11) plus ORIGINAL b := sum(220, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(11) plus ORIGINAL b = 221 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S079 S081 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(14) ORIGINAL a times divisor := mul(20, 14) After Mobius inversion ORIGINAL inverse F(n/3) f(14) ORIGINAL a times divisor = 280 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S080 S082 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(14) plus ORIGINAL b := sum(280, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(14) plus ORIGINAL b = 281 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S081 S083 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(22) ORIGINAL a times divisor := mul(20, 22) After Mobius inversion ORIGINAL inverse F(n/3) f(22) ORIGINAL a times divisor = 440 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S082 S084 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(22) plus ORIGINAL b := sum(440, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(22) plus ORIGINAL b = 441 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S083 S085 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(77) ORIGINAL a times divisor := mul(20, 77) After Mobius inversion ORIGINAL inverse F(n/3) f(77) ORIGINAL a times divisor = 1540 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S084 S086 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(77) plus ORIGINAL b := sum(1540, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(77) plus ORIGINAL b = 1541 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S085 S087 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(154) ORIGINAL a times divisor := mul(20, 154) After Mobius inversion ORIGINAL inverse F(n/3) f(154) ORIGINAL a times divisor = 3080 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S086 S088 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) f(154) plus ORIGINAL b := sum(3080, 1) After Mobius inversion ORIGINAL inverse F(n/3) f(154) plus ORIGINAL b = 3081 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S087 S089 · calculationBefore Mobius inversion ORIGINAL inverse F(n/3) full forward divisor sum := sum(21, 41, 141, 221, 281, 441, 1541, 3081) After Mobius inversion ORIGINAL inverse F(n/3) full forward divisor sum = 5768 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S088 S090 · calculationBefore Mobius inversion ORIGINAL inverse mu(3) times SAME F(n/3) := mul(-1, 5768) After Mobius inversion ORIGINAL inverse mu(3) times SAME F(n/3) = -5768 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S089 S091 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor6:actual positive input for mu=6 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S090 S092 · impliesBefore ORIGINAL positive integer absolute magnitude=6>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S091 S093 · calculationBefore upf extract divisor2 occurrence0 := div(6, 2) After upf extract divisor2 occurrence0 = 3 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S092 S094 · impliesBefore next divisor=2;previous remaining=6;all smaller divisors exhausted After extracted multiplicity=1;next remaining=3;remaining modulo2=1;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S093 S095 · calculationBefore upf canonical complete product factor0 := mul(1, 2) After upf canonical complete product factor0 = 2 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S094 S096 · calculationBefore upf canonical complete product factor1 := mul(2, 3) After upf canonical complete product factor1 = 6 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S095 S097 · impliesBefore exhausted trial divisors below3;terminal remaining=3;d*d>remaining;ORIGINAL n=6 After complete increasing prime multiset=[2, 3];full product=6;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S096 S098 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor6:input=6;COMPLETE prime multiset=[2, 3];distinct primes=[2, 3] After mu=1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S097 S099 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor6 := div(462, 6) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor6 = 77 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S098 S100 · impliesBefore Mobius inversion ORIGINAL inverse F(n/6):actual positive input=77;check complete integer range1..77 After ALL positive divisors INCREASING=[1, 7, 11, 77];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S099 S101 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/6) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S100 S102 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/6) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S101 S103 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) f(7) ORIGINAL a times divisor := mul(20, 7) After Mobius inversion ORIGINAL inverse F(n/6) f(7) ORIGINAL a times divisor = 140 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S102 S104 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) f(7) plus ORIGINAL b := sum(140, 1) After Mobius inversion ORIGINAL inverse F(n/6) f(7) plus ORIGINAL b = 141 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S103 S105 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) f(11) ORIGINAL a times divisor := mul(20, 11) After Mobius inversion ORIGINAL inverse F(n/6) f(11) ORIGINAL a times divisor = 220 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S104 S106 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) f(11) plus ORIGINAL b := sum(220, 1) After Mobius inversion ORIGINAL inverse F(n/6) f(11) plus ORIGINAL b = 221 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S105 S107 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) f(77) ORIGINAL a times divisor := mul(20, 77) After Mobius inversion ORIGINAL inverse F(n/6) f(77) ORIGINAL a times divisor = 1540 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S106 S108 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) f(77) plus ORIGINAL b := sum(1540, 1) After Mobius inversion ORIGINAL inverse F(n/6) f(77) plus ORIGINAL b = 1541 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S107 S109 · calculationBefore Mobius inversion ORIGINAL inverse F(n/6) full forward divisor sum := sum(21, 141, 221, 1541) After Mobius inversion ORIGINAL inverse F(n/6) full forward divisor sum = 1924 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S108 S110 · calculationBefore Mobius inversion ORIGINAL inverse mu(6) times SAME F(n/6) := mul(1, 1924) After Mobius inversion ORIGINAL inverse mu(6) times SAME F(n/6) = 1924 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S109 S111 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor7:actual positive input for mu=7 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S110 S112 · impliesBefore ORIGINAL positive integer absolute magnitude=7>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S111 S113 · impliesBefore next divisor=2;previous remaining=7;all smaller divisors exhausted After extracted multiplicity=0;next remaining=7;remaining modulo2=1;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S112 S114 · calculationBefore upf canonical complete product factor0 := mul(1, 7) After upf canonical complete product factor0 = 7 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S113 S115 · impliesBefore exhausted trial divisors below3;terminal remaining=7;d*d>remaining;ORIGINAL n=7 After complete increasing prime multiset=[7];full product=7;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S114 S116 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor7:input=7;COMPLETE prime multiset=[7];distinct primes=[7] After mu=-1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S115 S117 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor7 := div(462, 7) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor7 = 66 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S116 S118 · impliesBefore Mobius inversion ORIGINAL inverse F(n/7):actual positive input=66;check complete integer range1..66 After ALL positive divisors INCREASING=[1, 2, 3, 6, 11, 22, 33, 66];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S117 S119 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S118 S120 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S119 S121 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(2) ORIGINAL a times divisor := mul(20, 2) After Mobius inversion ORIGINAL inverse F(n/7) f(2) ORIGINAL a times divisor = 40 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S120 S122 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(2) plus ORIGINAL b := sum(40, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(2) plus ORIGINAL b = 41 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S121 S123 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(3) ORIGINAL a times divisor := mul(20, 3) After Mobius inversion ORIGINAL inverse F(n/7) f(3) ORIGINAL a times divisor = 60 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S122 S124 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(3) plus ORIGINAL b := sum(60, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(3) plus ORIGINAL b = 61 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S123 S125 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(6) ORIGINAL a times divisor := mul(20, 6) After Mobius inversion ORIGINAL inverse F(n/7) f(6) ORIGINAL a times divisor = 120 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S124 S126 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(6) plus ORIGINAL b := sum(120, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(6) plus ORIGINAL b = 121 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S125 S127 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(11) ORIGINAL a times divisor := mul(20, 11) After Mobius inversion ORIGINAL inverse F(n/7) f(11) ORIGINAL a times divisor = 220 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S126 S128 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(11) plus ORIGINAL b := sum(220, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(11) plus ORIGINAL b = 221 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S127 S129 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(22) ORIGINAL a times divisor := mul(20, 22) After Mobius inversion ORIGINAL inverse F(n/7) f(22) ORIGINAL a times divisor = 440 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S128 S130 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(22) plus ORIGINAL b := sum(440, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(22) plus ORIGINAL b = 441 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S129 S131 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(33) ORIGINAL a times divisor := mul(20, 33) After Mobius inversion ORIGINAL inverse F(n/7) f(33) ORIGINAL a times divisor = 660 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S130 S132 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(33) plus ORIGINAL b := sum(660, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(33) plus ORIGINAL b = 661 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S131 S133 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(66) ORIGINAL a times divisor := mul(20, 66) After Mobius inversion ORIGINAL inverse F(n/7) f(66) ORIGINAL a times divisor = 1320 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S132 S134 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) f(66) plus ORIGINAL b := sum(1320, 1) After Mobius inversion ORIGINAL inverse F(n/7) f(66) plus ORIGINAL b = 1321 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S133 S135 · calculationBefore Mobius inversion ORIGINAL inverse F(n/7) full forward divisor sum := sum(21, 41, 61, 121, 221, 441, 661, 1321) After Mobius inversion ORIGINAL inverse F(n/7) full forward divisor sum = 2888 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S134 S136 · calculationBefore Mobius inversion ORIGINAL inverse mu(7) times SAME F(n/7) := mul(-1, 2888) After Mobius inversion ORIGINAL inverse mu(7) times SAME F(n/7) = -2888 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S135 S137 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor11:actual positive input for mu=11 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S136 S138 · impliesBefore ORIGINAL positive integer absolute magnitude=11>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S137 S139 · impliesBefore next divisor=2;previous remaining=11;all smaller divisors exhausted After extracted multiplicity=0;next remaining=11;remaining modulo2=1;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S138 S140 · impliesBefore next divisor=3;previous remaining=11;all smaller divisors exhausted After extracted multiplicity=0;next remaining=11;remaining modulo3=2;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S139 S141 · calculationBefore upf canonical complete product factor0 := mul(1, 11) After upf canonical complete product factor0 = 11 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S140 S142 · impliesBefore exhausted trial divisors below4;terminal remaining=11;d*d>remaining;ORIGINAL n=11 After complete increasing prime multiset=[11];full product=11;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S141 S143 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor11:input=11;COMPLETE prime multiset=[11];distinct primes=[11] After mu=-1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S142 S144 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor11 := div(462, 11) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor11 = 42 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S143 S145 · impliesBefore Mobius inversion ORIGINAL inverse F(n/11):actual positive input=42;check complete integer range1..42 After ALL positive divisors INCREASING=[1, 2, 3, 6, 7, 14, 21, 42];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S144 S146 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S145 S147 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S146 S148 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(2) ORIGINAL a times divisor := mul(20, 2) After Mobius inversion ORIGINAL inverse F(n/11) f(2) ORIGINAL a times divisor = 40 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S147 S149 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(2) plus ORIGINAL b := sum(40, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(2) plus ORIGINAL b = 41 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S148 S150 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(3) ORIGINAL a times divisor := mul(20, 3) After Mobius inversion ORIGINAL inverse F(n/11) f(3) ORIGINAL a times divisor = 60 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S149 S151 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(3) plus ORIGINAL b := sum(60, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(3) plus ORIGINAL b = 61 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S150 S152 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(6) ORIGINAL a times divisor := mul(20, 6) After Mobius inversion ORIGINAL inverse F(n/11) f(6) ORIGINAL a times divisor = 120 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S151 S153 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(6) plus ORIGINAL b := sum(120, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(6) plus ORIGINAL b = 121 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S152 S154 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(7) ORIGINAL a times divisor := mul(20, 7) After Mobius inversion ORIGINAL inverse F(n/11) f(7) ORIGINAL a times divisor = 140 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S153 S155 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(7) plus ORIGINAL b := sum(140, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(7) plus ORIGINAL b = 141 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S154 S156 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(14) ORIGINAL a times divisor := mul(20, 14) After Mobius inversion ORIGINAL inverse F(n/11) f(14) ORIGINAL a times divisor = 280 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S155 S157 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(14) plus ORIGINAL b := sum(280, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(14) plus ORIGINAL b = 281 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S156 S158 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(21) ORIGINAL a times divisor := mul(20, 21) After Mobius inversion ORIGINAL inverse F(n/11) f(21) ORIGINAL a times divisor = 420 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S157 S159 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(21) plus ORIGINAL b := sum(420, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(21) plus ORIGINAL b = 421 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S158 S160 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(42) ORIGINAL a times divisor := mul(20, 42) After Mobius inversion ORIGINAL inverse F(n/11) f(42) ORIGINAL a times divisor = 840 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S159 S161 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) f(42) plus ORIGINAL b := sum(840, 1) After Mobius inversion ORIGINAL inverse F(n/11) f(42) plus ORIGINAL b = 841 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S160 S162 · calculationBefore Mobius inversion ORIGINAL inverse F(n/11) full forward divisor sum := sum(21, 41, 61, 121, 141, 281, 421, 841) After Mobius inversion ORIGINAL inverse F(n/11) full forward divisor sum = 1928 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S161 S163 · calculationBefore Mobius inversion ORIGINAL inverse mu(11) times SAME F(n/11) := mul(-1, 1928) After Mobius inversion ORIGINAL inverse mu(11) times SAME F(n/11) = -1928 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S162 S164 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor14:actual positive input for mu=14 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S163 S165 · impliesBefore ORIGINAL positive integer absolute magnitude=14>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S164 S166 · calculationBefore upf extract divisor2 occurrence0 := div(14, 2) After upf extract divisor2 occurrence0 = 7 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S165 S167 · impliesBefore next divisor=2;previous remaining=14;all smaller divisors exhausted After extracted multiplicity=1;next remaining=7;remaining modulo2=1;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S166 S168 · calculationBefore upf canonical complete product factor0 := mul(1, 2) After upf canonical complete product factor0 = 2 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S167 S169 · calculationBefore upf canonical complete product factor1 := mul(2, 7) After upf canonical complete product factor1 = 14 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S168 S170 · impliesBefore exhausted trial divisors below3;terminal remaining=7;d*d>remaining;ORIGINAL n=14 After complete increasing prime multiset=[2, 7];full product=14;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S169 S171 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor14:input=14;COMPLETE prime multiset=[2, 7];distinct primes=[2, 7] After mu=1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S170 S172 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor14 := div(462, 14) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor14 = 33 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S171 S173 · impliesBefore Mobius inversion ORIGINAL inverse F(n/14):actual positive input=33;check complete integer range1..33 After ALL positive divisors INCREASING=[1, 3, 11, 33];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S172 S174 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/14) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S173 S175 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/14) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S174 S176 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) f(3) ORIGINAL a times divisor := mul(20, 3) After Mobius inversion ORIGINAL inverse F(n/14) f(3) ORIGINAL a times divisor = 60 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S175 S177 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) f(3) plus ORIGINAL b := sum(60, 1) After Mobius inversion ORIGINAL inverse F(n/14) f(3) plus ORIGINAL b = 61 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S176 S178 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) f(11) ORIGINAL a times divisor := mul(20, 11) After Mobius inversion ORIGINAL inverse F(n/14) f(11) ORIGINAL a times divisor = 220 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S177 S179 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) f(11) plus ORIGINAL b := sum(220, 1) After Mobius inversion ORIGINAL inverse F(n/14) f(11) plus ORIGINAL b = 221 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S178 S180 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) f(33) ORIGINAL a times divisor := mul(20, 33) After Mobius inversion ORIGINAL inverse F(n/14) f(33) ORIGINAL a times divisor = 660 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S179 S181 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) f(33) plus ORIGINAL b := sum(660, 1) After Mobius inversion ORIGINAL inverse F(n/14) f(33) plus ORIGINAL b = 661 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S180 S182 · calculationBefore Mobius inversion ORIGINAL inverse F(n/14) full forward divisor sum := sum(21, 61, 221, 661) After Mobius inversion ORIGINAL inverse F(n/14) full forward divisor sum = 964 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S181 S183 · calculationBefore Mobius inversion ORIGINAL inverse mu(14) times SAME F(n/14) := mul(1, 964) After Mobius inversion ORIGINAL inverse mu(14) times SAME F(n/14) = 964 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S182 S184 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor21:actual positive input for mu=21 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S183 S185 · impliesBefore ORIGINAL positive integer absolute magnitude=21>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S184 S186 · impliesBefore next divisor=2;previous remaining=21;all smaller divisors exhausted After extracted multiplicity=0;next remaining=21;remaining modulo2=1;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S185 S187 · calculationBefore upf extract divisor3 occurrence0 := div(21, 3) After upf extract divisor3 occurrence0 = 7 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S186 S188 · impliesBefore next divisor=3;previous remaining=21;all smaller divisors exhausted After extracted multiplicity=1;next remaining=7;remaining modulo3=1;extracted multiset=[3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S187 S189 · calculationBefore upf canonical complete product factor0 := mul(1, 3) After upf canonical complete product factor0 = 3 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S188 S190 · calculationBefore upf canonical complete product factor1 := mul(3, 7) After upf canonical complete product factor1 = 21 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S189 S191 · impliesBefore exhausted trial divisors below4;terminal remaining=7;d*d>remaining;ORIGINAL n=21 After complete increasing prime multiset=[3, 7];full product=21;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S190 S192 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor21:input=21;COMPLETE prime multiset=[3, 7];distinct primes=[3, 7] After mu=1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S191 S193 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor21 := div(462, 21) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor21 = 22 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S192 S194 · impliesBefore Mobius inversion ORIGINAL inverse F(n/21):actual positive input=22;check complete integer range1..22 After ALL positive divisors INCREASING=[1, 2, 11, 22];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S193 S195 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/21) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S194 S196 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/21) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S195 S197 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) f(2) ORIGINAL a times divisor := mul(20, 2) After Mobius inversion ORIGINAL inverse F(n/21) f(2) ORIGINAL a times divisor = 40 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S196 S198 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) f(2) plus ORIGINAL b := sum(40, 1) After Mobius inversion ORIGINAL inverse F(n/21) f(2) plus ORIGINAL b = 41 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S197 S199 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) f(11) ORIGINAL a times divisor := mul(20, 11) After Mobius inversion ORIGINAL inverse F(n/21) f(11) ORIGINAL a times divisor = 220 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S198 S200 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) f(11) plus ORIGINAL b := sum(220, 1) After Mobius inversion ORIGINAL inverse F(n/21) f(11) plus ORIGINAL b = 221 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S199 S201 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) f(22) ORIGINAL a times divisor := mul(20, 22) After Mobius inversion ORIGINAL inverse F(n/21) f(22) ORIGINAL a times divisor = 440 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S200 S202 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) f(22) plus ORIGINAL b := sum(440, 1) After Mobius inversion ORIGINAL inverse F(n/21) f(22) plus ORIGINAL b = 441 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S201 S203 · calculationBefore Mobius inversion ORIGINAL inverse F(n/21) full forward divisor sum := sum(21, 41, 221, 441) After Mobius inversion ORIGINAL inverse F(n/21) full forward divisor sum = 724 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S202 S204 · calculationBefore Mobius inversion ORIGINAL inverse mu(21) times SAME F(n/21) := mul(1, 724) After Mobius inversion ORIGINAL inverse mu(21) times SAME F(n/21) = 724 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S203 S205 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor22:actual positive input for mu=22 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S204 S206 · impliesBefore ORIGINAL positive integer absolute magnitude=22>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S205 S207 · calculationBefore upf extract divisor2 occurrence0 := div(22, 2) After upf extract divisor2 occurrence0 = 11 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S206 S208 · impliesBefore next divisor=2;previous remaining=22;all smaller divisors exhausted After extracted multiplicity=1;next remaining=11;remaining modulo2=1;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S207 S209 · impliesBefore next divisor=3;previous remaining=11;all smaller divisors exhausted After extracted multiplicity=0;next remaining=11;remaining modulo3=2;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S208 S210 · calculationBefore upf canonical complete product factor0 := mul(1, 2) After upf canonical complete product factor0 = 2 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S209 S211 · calculationBefore upf canonical complete product factor1 := mul(2, 11) After upf canonical complete product factor1 = 22 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S210 S212 · impliesBefore exhausted trial divisors below4;terminal remaining=11;d*d>remaining;ORIGINAL n=22 After complete increasing prime multiset=[2, 11];full product=22;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S211 S213 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor22:input=22;COMPLETE prime multiset=[2, 11];distinct primes=[2, 11] After mu=1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S212 S214 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor22 := div(462, 22) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor22 = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S213 S215 · impliesBefore Mobius inversion ORIGINAL inverse F(n/22):actual positive input=21;check complete integer range1..21 After ALL positive divisors INCREASING=[1, 3, 7, 21];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S214 S216 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/22) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S215 S217 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/22) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S216 S218 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) f(3) ORIGINAL a times divisor := mul(20, 3) After Mobius inversion ORIGINAL inverse F(n/22) f(3) ORIGINAL a times divisor = 60 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S217 S219 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) f(3) plus ORIGINAL b := sum(60, 1) After Mobius inversion ORIGINAL inverse F(n/22) f(3) plus ORIGINAL b = 61 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S218 S220 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) f(7) ORIGINAL a times divisor := mul(20, 7) After Mobius inversion ORIGINAL inverse F(n/22) f(7) ORIGINAL a times divisor = 140 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S219 S221 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) f(7) plus ORIGINAL b := sum(140, 1) After Mobius inversion ORIGINAL inverse F(n/22) f(7) plus ORIGINAL b = 141 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S220 S222 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) f(21) ORIGINAL a times divisor := mul(20, 21) After Mobius inversion ORIGINAL inverse F(n/22) f(21) ORIGINAL a times divisor = 420 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S221 S223 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) f(21) plus ORIGINAL b := sum(420, 1) After Mobius inversion ORIGINAL inverse F(n/22) f(21) plus ORIGINAL b = 421 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S222 S224 · calculationBefore Mobius inversion ORIGINAL inverse F(n/22) full forward divisor sum := sum(21, 61, 141, 421) After Mobius inversion ORIGINAL inverse F(n/22) full forward divisor sum = 644 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S223 S225 · calculationBefore Mobius inversion ORIGINAL inverse mu(22) times SAME F(n/22) := mul(1, 644) After Mobius inversion ORIGINAL inverse mu(22) times SAME F(n/22) = 644 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S224 S226 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor33:actual positive input for mu=33 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S225 S227 · impliesBefore ORIGINAL positive integer absolute magnitude=33>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S226 S228 · impliesBefore next divisor=2;previous remaining=33;all smaller divisors exhausted After extracted multiplicity=0;next remaining=33;remaining modulo2=1;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S227 S229 · calculationBefore upf extract divisor3 occurrence0 := div(33, 3) After upf extract divisor3 occurrence0 = 11 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S228 S230 · impliesBefore next divisor=3;previous remaining=33;all smaller divisors exhausted After extracted multiplicity=1;next remaining=11;remaining modulo3=2;extracted multiset=[3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S229 S231 · calculationBefore upf canonical complete product factor0 := mul(1, 3) After upf canonical complete product factor0 = 3 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S230 S232 · calculationBefore upf canonical complete product factor1 := mul(3, 11) After upf canonical complete product factor1 = 33 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S231 S233 · impliesBefore exhausted trial divisors below4;terminal remaining=11;d*d>remaining;ORIGINAL n=33 After complete increasing prime multiset=[3, 11];full product=33;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S232 S234 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor33:input=33;COMPLETE prime multiset=[3, 11];distinct primes=[3, 11] After mu=1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S233 S235 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor33 := div(462, 33) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor33 = 14 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S234 S236 · impliesBefore Mobius inversion ORIGINAL inverse F(n/33):actual positive input=14;check complete integer range1..14 After ALL positive divisors INCREASING=[1, 2, 7, 14];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S235 S237 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/33) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S236 S238 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/33) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S237 S239 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) f(2) ORIGINAL a times divisor := mul(20, 2) After Mobius inversion ORIGINAL inverse F(n/33) f(2) ORIGINAL a times divisor = 40 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S238 S240 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) f(2) plus ORIGINAL b := sum(40, 1) After Mobius inversion ORIGINAL inverse F(n/33) f(2) plus ORIGINAL b = 41 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S239 S241 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) f(7) ORIGINAL a times divisor := mul(20, 7) After Mobius inversion ORIGINAL inverse F(n/33) f(7) ORIGINAL a times divisor = 140 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S240 S242 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) f(7) plus ORIGINAL b := sum(140, 1) After Mobius inversion ORIGINAL inverse F(n/33) f(7) plus ORIGINAL b = 141 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S241 S243 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) f(14) ORIGINAL a times divisor := mul(20, 14) After Mobius inversion ORIGINAL inverse F(n/33) f(14) ORIGINAL a times divisor = 280 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S242 S244 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) f(14) plus ORIGINAL b := sum(280, 1) After Mobius inversion ORIGINAL inverse F(n/33) f(14) plus ORIGINAL b = 281 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S243 S245 · calculationBefore Mobius inversion ORIGINAL inverse F(n/33) full forward divisor sum := sum(21, 41, 141, 281) After Mobius inversion ORIGINAL inverse F(n/33) full forward divisor sum = 484 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S244 S246 · calculationBefore Mobius inversion ORIGINAL inverse mu(33) times SAME F(n/33) := mul(1, 484) After Mobius inversion ORIGINAL inverse mu(33) times SAME F(n/33) = 484 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S245 S247 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor42:actual positive input for mu=42 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S246 S248 · impliesBefore ORIGINAL positive integer absolute magnitude=42>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S247 S249 · calculationBefore upf extract divisor2 occurrence0 := div(42, 2) After upf extract divisor2 occurrence0 = 21 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S248 S250 · impliesBefore next divisor=2;previous remaining=42;all smaller divisors exhausted After extracted multiplicity=1;next remaining=21;remaining modulo2=1;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S249 S251 · calculationBefore upf extract divisor3 occurrence1 := div(21, 3) After upf extract divisor3 occurrence1 = 7 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S250 S252 · impliesBefore next divisor=3;previous remaining=21;all smaller divisors exhausted After extracted multiplicity=1;next remaining=7;remaining modulo3=1;extracted multiset=[2, 3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S251 S253 · calculationBefore upf canonical complete product factor0 := mul(1, 2) After upf canonical complete product factor0 = 2 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S252 S254 · calculationBefore upf canonical complete product factor1 := mul(2, 3) After upf canonical complete product factor1 = 6 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S253 S255 · calculationBefore upf canonical complete product factor2 := mul(6, 7) After upf canonical complete product factor2 = 42 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S254 S256 · impliesBefore exhausted trial divisors below4;terminal remaining=7;d*d>remaining;ORIGINAL n=42 After complete increasing prime multiset=[2, 3, 7];full product=42;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S255 S257 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor42:input=42;COMPLETE prime multiset=[2, 3, 7];distinct primes=[2, 3, 7] After mu=-1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S256 S258 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor42 := div(462, 42) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor42 = 11 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S257 S259 · impliesBefore Mobius inversion ORIGINAL inverse F(n/42):actual positive input=11;check complete integer range1..11 After ALL positive divisors INCREASING=[1, 11];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S258 S260 · calculationBefore Mobius inversion ORIGINAL inverse F(n/42) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/42) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S259 S261 · calculationBefore Mobius inversion ORIGINAL inverse F(n/42) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/42) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S260 S262 · calculationBefore Mobius inversion ORIGINAL inverse F(n/42) f(11) ORIGINAL a times divisor := mul(20, 11) After Mobius inversion ORIGINAL inverse F(n/42) f(11) ORIGINAL a times divisor = 220 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S261 S263 · calculationBefore Mobius inversion ORIGINAL inverse F(n/42) f(11) plus ORIGINAL b := sum(220, 1) After Mobius inversion ORIGINAL inverse F(n/42) f(11) plus ORIGINAL b = 221 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S262 S264 · calculationBefore Mobius inversion ORIGINAL inverse F(n/42) full forward divisor sum := sum(21, 221) After Mobius inversion ORIGINAL inverse F(n/42) full forward divisor sum = 242 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S263 S265 · calculationBefore Mobius inversion ORIGINAL inverse mu(42) times SAME F(n/42) := mul(-1, 242) After Mobius inversion ORIGINAL inverse mu(42) times SAME F(n/42) = -242 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S264 S266 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor66:actual positive input for mu=66 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S265 S267 · impliesBefore ORIGINAL positive integer absolute magnitude=66>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S266 S268 · calculationBefore upf extract divisor2 occurrence0 := div(66, 2) After upf extract divisor2 occurrence0 = 33 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S267 S269 · impliesBefore next divisor=2;previous remaining=66;all smaller divisors exhausted After extracted multiplicity=1;next remaining=33;remaining modulo2=1;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S268 S270 · calculationBefore upf extract divisor3 occurrence1 := div(33, 3) After upf extract divisor3 occurrence1 = 11 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S269 S271 · impliesBefore next divisor=3;previous remaining=33;all smaller divisors exhausted After extracted multiplicity=1;next remaining=11;remaining modulo3=2;extracted multiset=[2, 3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S270 S272 · calculationBefore upf canonical complete product factor0 := mul(1, 2) After upf canonical complete product factor0 = 2 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S271 S273 · calculationBefore upf canonical complete product factor1 := mul(2, 3) After upf canonical complete product factor1 = 6 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S272 S274 · calculationBefore upf canonical complete product factor2 := mul(6, 11) After upf canonical complete product factor2 = 66 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S273 S275 · impliesBefore exhausted trial divisors below4;terminal remaining=11;d*d>remaining;ORIGINAL n=66 After complete increasing prime multiset=[2, 3, 11];full product=66;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S274 S276 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor66:input=66;COMPLETE prime multiset=[2, 3, 11];distinct primes=[2, 3, 11] After mu=-1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S275 S277 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor66 := div(462, 66) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor66 = 7 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S276 S278 · impliesBefore Mobius inversion ORIGINAL inverse F(n/66):actual positive input=7;check complete integer range1..7 After ALL positive divisors INCREASING=[1, 7];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S277 S279 · calculationBefore Mobius inversion ORIGINAL inverse F(n/66) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/66) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S278 S280 · calculationBefore Mobius inversion ORIGINAL inverse F(n/66) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/66) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S279 S281 · calculationBefore Mobius inversion ORIGINAL inverse F(n/66) f(7) ORIGINAL a times divisor := mul(20, 7) After Mobius inversion ORIGINAL inverse F(n/66) f(7) ORIGINAL a times divisor = 140 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S280 S282 · calculationBefore Mobius inversion ORIGINAL inverse F(n/66) f(7) plus ORIGINAL b := sum(140, 1) After Mobius inversion ORIGINAL inverse F(n/66) f(7) plus ORIGINAL b = 141 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S281 S283 · calculationBefore Mobius inversion ORIGINAL inverse F(n/66) full forward divisor sum := sum(21, 141) After Mobius inversion ORIGINAL inverse F(n/66) full forward divisor sum = 162 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S282 S284 · calculationBefore Mobius inversion ORIGINAL inverse mu(66) times SAME F(n/66) := mul(-1, 162) After Mobius inversion ORIGINAL inverse mu(66) times SAME F(n/66) = -162 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S283 S285 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor77:actual positive input for mu=77 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S284 S286 · impliesBefore ORIGINAL positive integer absolute magnitude=77>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S285 S287 · impliesBefore next divisor=2;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo2=1;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S286 S288 · impliesBefore next divisor=3;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo3=2;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S287 S289 · impliesBefore next divisor=4;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo4=1;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S288 S290 · impliesBefore next divisor=5;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo5=2;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S289 S291 · impliesBefore next divisor=6;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo6=5;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S290 S292 · calculationBefore upf extract divisor7 occurrence0 := div(77, 7) After upf extract divisor7 occurrence0 = 11 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S291 S293 · impliesBefore next divisor=7;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=1;next remaining=11;remaining modulo7=4;extracted multiset=[7] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S292 S294 · calculationBefore upf canonical complete product factor0 := mul(1, 7) After upf canonical complete product factor0 = 7 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S293 S295 · calculationBefore upf canonical complete product factor1 := mul(7, 11) After upf canonical complete product factor1 = 77 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S294 S296 · impliesBefore exhausted trial divisors below8;terminal remaining=11;d*d>remaining;ORIGINAL n=77 After complete increasing prime multiset=[7, 11];full product=77;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S295 S297 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor77:input=77;COMPLETE prime multiset=[7, 11];distinct primes=[7, 11] After mu=1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S296 S298 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor77 := div(462, 77) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor77 = 6 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S297 S299 · impliesBefore Mobius inversion ORIGINAL inverse F(n/77):actual positive input=6;check complete integer range1..6 After ALL positive divisors INCREASING=[1, 2, 3, 6];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S298 S300 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/77) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S299 S301 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/77) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S300 S302 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) f(2) ORIGINAL a times divisor := mul(20, 2) After Mobius inversion ORIGINAL inverse F(n/77) f(2) ORIGINAL a times divisor = 40 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S301 S303 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) f(2) plus ORIGINAL b := sum(40, 1) After Mobius inversion ORIGINAL inverse F(n/77) f(2) plus ORIGINAL b = 41 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S302 S304 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) f(3) ORIGINAL a times divisor := mul(20, 3) After Mobius inversion ORIGINAL inverse F(n/77) f(3) ORIGINAL a times divisor = 60 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S303 S305 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) f(3) plus ORIGINAL b := sum(60, 1) After Mobius inversion ORIGINAL inverse F(n/77) f(3) plus ORIGINAL b = 61 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S304 S306 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) f(6) ORIGINAL a times divisor := mul(20, 6) After Mobius inversion ORIGINAL inverse F(n/77) f(6) ORIGINAL a times divisor = 120 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S305 S307 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) f(6) plus ORIGINAL b := sum(120, 1) After Mobius inversion ORIGINAL inverse F(n/77) f(6) plus ORIGINAL b = 121 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S306 S308 · calculationBefore Mobius inversion ORIGINAL inverse F(n/77) full forward divisor sum := sum(21, 41, 61, 121) After Mobius inversion ORIGINAL inverse F(n/77) full forward divisor sum = 244 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S307 S309 · calculationBefore Mobius inversion ORIGINAL inverse mu(77) times SAME F(n/77) := mul(1, 244) After Mobius inversion ORIGINAL inverse mu(77) times SAME F(n/77) = 244 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S308 S310 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor154:actual positive input for mu=154 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S309 S311 · impliesBefore ORIGINAL positive integer absolute magnitude=154>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S310 S312 · calculationBefore upf extract divisor2 occurrence0 := div(154, 2) After upf extract divisor2 occurrence0 = 77 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S311 S313 · impliesBefore next divisor=2;previous remaining=154;all smaller divisors exhausted After extracted multiplicity=1;next remaining=77;remaining modulo2=1;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S312 S314 · impliesBefore next divisor=3;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo3=2;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S313 S315 · impliesBefore next divisor=4;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo4=1;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S314 S316 · impliesBefore next divisor=5;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo5=2;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S315 S317 · impliesBefore next divisor=6;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo6=5;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S316 S318 · calculationBefore upf extract divisor7 occurrence1 := div(77, 7) After upf extract divisor7 occurrence1 = 11 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S317 S319 · impliesBefore next divisor=7;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=1;next remaining=11;remaining modulo7=4;extracted multiset=[2, 7] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S318 S320 · calculationBefore upf canonical complete product factor0 := mul(1, 2) After upf canonical complete product factor0 = 2 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S319 S321 · calculationBefore upf canonical complete product factor1 := mul(2, 7) After upf canonical complete product factor1 = 14 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S320 S322 · calculationBefore upf canonical complete product factor2 := mul(14, 11) After upf canonical complete product factor2 = 154 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S321 S323 · impliesBefore exhausted trial divisors below8;terminal remaining=11;d*d>remaining;ORIGINAL n=154 After complete increasing prime multiset=[2, 7, 11];full product=154;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S322 S324 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor154:input=154;COMPLETE prime multiset=[2, 7, 11];distinct primes=[2, 7, 11] After mu=-1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S323 S325 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor154 := div(462, 154) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor154 = 3 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S324 S326 · impliesBefore Mobius inversion ORIGINAL inverse F(n/154):actual positive input=3;check complete integer range1..3 After ALL positive divisors INCREASING=[1, 3];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S325 S327 · calculationBefore Mobius inversion ORIGINAL inverse F(n/154) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/154) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S326 S328 · calculationBefore Mobius inversion ORIGINAL inverse F(n/154) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/154) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S327 S329 · calculationBefore Mobius inversion ORIGINAL inverse F(n/154) f(3) ORIGINAL a times divisor := mul(20, 3) After Mobius inversion ORIGINAL inverse F(n/154) f(3) ORIGINAL a times divisor = 60 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S328 S330 · calculationBefore Mobius inversion ORIGINAL inverse F(n/154) f(3) plus ORIGINAL b := sum(60, 1) After Mobius inversion ORIGINAL inverse F(n/154) f(3) plus ORIGINAL b = 61 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S329 S331 · calculationBefore Mobius inversion ORIGINAL inverse F(n/154) full forward divisor sum := sum(21, 61) After Mobius inversion ORIGINAL inverse F(n/154) full forward divisor sum = 82 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S330 S332 · calculationBefore Mobius inversion ORIGINAL inverse mu(154) times SAME F(n/154) := mul(-1, 82) After Mobius inversion ORIGINAL inverse mu(154) times SAME F(n/154) = -82 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S331 S333 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor231:actual positive input for mu=231 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S332 S334 · impliesBefore ORIGINAL positive integer absolute magnitude=231>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S333 S335 · impliesBefore next divisor=2;previous remaining=231;all smaller divisors exhausted After extracted multiplicity=0;next remaining=231;remaining modulo2=1;extracted multiset=[] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S334 S336 · calculationBefore upf extract divisor3 occurrence0 := div(231, 3) After upf extract divisor3 occurrence0 = 77 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S335 S337 · impliesBefore next divisor=3;previous remaining=231;all smaller divisors exhausted After extracted multiplicity=1;next remaining=77;remaining modulo3=2;extracted multiset=[3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S336 S338 · impliesBefore next divisor=4;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo4=1;extracted multiset=[3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S337 S339 · impliesBefore next divisor=5;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo5=2;extracted multiset=[3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S338 S340 · impliesBefore next divisor=6;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo6=5;extracted multiset=[3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S339 S341 · calculationBefore upf extract divisor7 occurrence1 := div(77, 7) After upf extract divisor7 occurrence1 = 11 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S340 S342 · impliesBefore next divisor=7;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=1;next remaining=11;remaining modulo7=4;extracted multiset=[3, 7] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S341 S343 · calculationBefore upf canonical complete product factor0 := mul(1, 3) After upf canonical complete product factor0 = 3 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S342 S344 · calculationBefore upf canonical complete product factor1 := mul(3, 7) After upf canonical complete product factor1 = 21 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S343 S345 · calculationBefore upf canonical complete product factor2 := mul(21, 11) After upf canonical complete product factor2 = 231 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S344 S346 · impliesBefore exhausted trial divisors below8;terminal remaining=11;d*d>remaining;ORIGINAL n=231 After complete increasing prime multiset=[3, 7, 11];full product=231;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S345 S347 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor231:input=231;COMPLETE prime multiset=[3, 7, 11];distinct primes=[3, 7, 11] After mu=-1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S346 S348 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor231 := div(462, 231) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor231 = 2 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S347 S349 · impliesBefore Mobius inversion ORIGINAL inverse F(n/231):actual positive input=2;check complete integer range1..2 After ALL positive divisors INCREASING=[1, 2];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S348 S350 · calculationBefore Mobius inversion ORIGINAL inverse F(n/231) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/231) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S349 S351 · calculationBefore Mobius inversion ORIGINAL inverse F(n/231) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/231) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S350 S352 · calculationBefore Mobius inversion ORIGINAL inverse F(n/231) f(2) ORIGINAL a times divisor := mul(20, 2) After Mobius inversion ORIGINAL inverse F(n/231) f(2) ORIGINAL a times divisor = 40 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S351 S353 · calculationBefore Mobius inversion ORIGINAL inverse F(n/231) f(2) plus ORIGINAL b := sum(40, 1) After Mobius inversion ORIGINAL inverse F(n/231) f(2) plus ORIGINAL b = 41 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S352 S354 · calculationBefore Mobius inversion ORIGINAL inverse F(n/231) full forward divisor sum := sum(21, 41) After Mobius inversion ORIGINAL inverse F(n/231) full forward divisor sum = 62 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S353 S355 · calculationBefore Mobius inversion ORIGINAL inverse mu(231) times SAME F(n/231) := mul(-1, 62) After Mobius inversion ORIGINAL inverse mu(231) times SAME F(n/231) = -62 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S354 S356 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor462:actual positive input for mu=462 After complete prime multiplicities required for this input;mu(1) uses empty product,not a partial factor search Conditions: none Identify whether the input is the original n or one of its positive divisors.Every mu evaluation requires complete prime multiplicities,not a partial factor search. Step identifiers and dependenciesRule: mobius_complete_UPF_input_role · Uses: G001, S355 S357 · impliesBefore ORIGINAL positive integer absolute magnitude=462>1 After initialize remaining=n,prime multiset empty;invariant product(extracted)*remaining=n;every smaller trial divisor has been exhausted Conditions: none Divide only by an actual divisor and exhaust smaller candidates,which justifies primality of each extracted divisor without assuming n is prime. Step identifiers and dependenciesRule: upf_factorization_remaining_product_invariant · Uses: G001, S356 S358 · calculationBefore upf extract divisor2 occurrence0 := div(462, 2) After upf extract divisor2 occurrence0 = 231 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S357 S359 · impliesBefore next divisor=2;previous remaining=462;all smaller divisors exhausted After extracted multiplicity=1;next remaining=231;remaining modulo2=1;extracted multiset=[2] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S358 S360 · calculationBefore upf extract divisor3 occurrence1 := div(231, 3) After upf extract divisor3 occurrence1 = 77 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S359 S361 · impliesBefore next divisor=3;previous remaining=231;all smaller divisors exhausted After extracted multiplicity=1;next remaining=77;remaining modulo3=2;extracted multiset=[2, 3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S360 S362 · impliesBefore next divisor=4;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo4=1;extracted multiset=[2, 3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S361 S363 · impliesBefore next divisor=5;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo5=2;extracted multiset=[2, 3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S362 S364 · impliesBefore next divisor=6;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=0;next remaining=77;remaining modulo6=5;extracted multiset=[2, 3] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S363 S365 · calculationBefore upf extract divisor7 occurrence2 := div(77, 7) After upf extract divisor7 occurrence2 = 11 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S364 S366 · impliesBefore next divisor=7;previous remaining=77;all smaller divisors exhausted After extracted multiplicity=1;next remaining=11;remaining modulo7=4;extracted multiset=[2, 3, 7] Conditions: none Exhaust every multiplicity before advancing.The stopping test concerns the current remainder,and the final prime remainder must not be omitted. Step identifiers and dependenciesRule: upf_complete_trial_division_remaining_invariant · Uses: G001, S365 S367 · calculationBefore upf canonical complete product factor0 := mul(1, 2) After upf canonical complete product factor0 = 2 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S366 S368 · calculationBefore upf canonical complete product factor1 := mul(2, 3) After upf canonical complete product factor1 = 6 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S367 S369 · calculationBefore upf canonical complete product factor2 := mul(6, 7) After upf canonical complete product factor2 = 42 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S368 S370 · calculationBefore upf canonical complete product factor3 := mul(42, 11) After upf canonical complete product factor3 = 462 Conditions: none Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S369 S371 · impliesBefore exhausted trial divisors below8;terminal remaining=11;d*d>remaining;ORIGINAL n=462 After complete increasing prime multiset=[2, 3, 7, 11];full product=462;a composite terminal remainder would have an already tested smaller divisor Conditions: none If a terminal remainder greater than1 were composite,its least prime factor would already have been exhausted,a contradiction.The final entry is therefore prime.This certifies this instance;general existence follows by strong induction,recursively splitting a composite into smaller positive factors. Step identifiers and dependenciesRule: upf_final_prime_remainder_complete_existence_instance · Uses: G001, S370 S372 · impliesBefore Mobius inversion ORIGINAL inverse Mobius at ORIGINAL divisor462:input=462;COMPLETE prime multiset=[2, 3, 7, 11];distinct primes=[2, 3, 7, 11] After mu=1;empty product case=No;repeated prime=No Conditions: none The empty prime multiset for1 gives mu1=1.A repeated prime gives a square divisor and value0;otherwise distinct-prime parity determines the sign.Sorting must not discard multiplicities. Step identifiers and dependenciesRule: mobius_value_one_repeated_prime_or_squarefree_parity · Uses: G001, S371 S373 · calculationBefore Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor462 := div(462, 462) After Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor462 = 1 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S372 S374 · impliesBefore Mobius inversion ORIGINAL inverse F(n/462):actual positive input=1;check complete integer range1..1 After ALL positive divisors INCREASING=[1];not only primes/proper divisors or all integers<=n Conditions: none Check divisibility over the complete range,retaining1 and n.The relation d|n is neither d<=n nor a prime/proper-divisor restriction. Step identifiers and dependenciesRule: mobinv_ALL_positive_divisors_complete_indexing · Uses: G001, S373 S375 · calculationBefore Mobius inversion ORIGINAL inverse F(n/462) f(1) ORIGINAL a times divisor := mul(20, 1) After Mobius inversion ORIGINAL inverse F(n/462) f(1) ORIGINAL a times divisor = 20 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S374 S376 · calculationBefore Mobius inversion ORIGINAL inverse F(n/462) f(1) plus ORIGINAL b := sum(20, 1) After Mobius inversion ORIGINAL inverse F(n/462) f(1) plus ORIGINAL b = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S375 S377 · calculationBefore Mobius inversion ORIGINAL inverse F(n/462) full forward divisor sum := sum(21) After Mobius inversion ORIGINAL inverse F(n/462) full forward divisor sum = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S376 S378 · calculationBefore Mobius inversion ORIGINAL inverse mu(462) times SAME F(n/462) := mul(1, 21) After Mobius inversion ORIGINAL inverse mu(462) times SAME F(n/462) = 21 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S377 S379 · calculationBefore Mobius inversion ORIGINAL inverse complete inverse-term sum := sum(23056, -7688, -5768, 1924, -2888, -1928, 964, 724, 644, 484, -242, -162, 244, -82, -62, 21) After Mobius inversion ORIGINAL inverse complete inverse-term sum = 9241 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S378 S380 · calculationBefore Mobius inversion ORIGINAL inverse direct ORIGINAL a times n := mul(20, 462) After Mobius inversion ORIGINAL inverse direct ORIGINAL a times n = 9240 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S379 S381 · calculationBefore Mobius inversion ORIGINAL inverse direct plus ORIGINAL b := sum(9240, 1) After Mobius inversion ORIGINAL inverse direct plus ORIGINAL b = 9241 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S380 S382 · impliesBefore Mobius inversion ORIGINAL inverse:actual n=462;ALL [d,mu(d),n/d,F(n/d),mu(d)*F(n/d)] rows=[[1, 1, 462, 23056, 23056], [2, -1, 231, 7688, -7688], [3, -1, 154, 5768, -5768], [6, 1, 77, 1924, 1924], [7, -1, 66, 2888, -2888], [11, -1, 42, 1928, -1928], [14, 1, 33, 964, 964], [21, 1, 22, 724, 724], [22, 1, 21, 644, 644], [33, 1, 14, 484, 484], [42, -1, 11, 242, -242], [66, -1, 7, 162, -162], [77, 1, 6, 244, 244], [154, -1, 3, 82, -82], [231, -1, 2, 62, -62], [462, 1, 1, 21, 21]] After complete reconstructed=9241;direct f(n)=9241;sum_d mu(d)sum_e|n/d f(e)=sum_e|n f(e)sum_d|n/e mu(d)=f(n) Conditions: none Swap the finite sums over d*e|n.The inner Mobius sum is1 for n/e=1 and0 otherwise by pairing distinct-prime subsets,leaving only e=n.For n1,the d1 term and mu1=1 remain;do not mix indices from the alternate equivalent convention. Step identifiers and dependenciesRule: mobinv_general_finite_double_sum_and_Mobius_cancellation · Uses: G001, S381 S383 · calculationBefore Mobius inversion ORIGINAL omitted-divisor partial sum := sum(-7688, -5768, 1924, -2888, -1928, 964, 724, 644, 484, -242, -162, 244, -82, -62, 21) After Mobius inversion ORIGINAL omitted-divisor partial sum = -13815 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S382 S384 · calculationBefore Mobius inversion complete minus partial := sub(9241, -13815) After Mobius inversion complete minus partial = 23056 Conditions: none Substitute original roles,order and established intermediates exactly,without changing source bindings or using floating-point approximations. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S383 S385 · impliesBefore ORIGINAL full divisors=[1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462];actual omitted divisor=1;remaining ORIGINAL-order divisors=[2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462] After complete=9241=f(n)=9241;partial=-13815;lost term=23056!=0;incomplete_certificate fixed No Conditions: none The omitted value must be an actual divisor with nonzero contribution,so the partial result differs from the target.Omitting a zero term does not qualify this discriminative boundary.The No rejects the incomplete certificate,not the complete inversion. Step identifiers and dependenciesRule: mobinv_omission_actual_nonzero_discriminative_term · Uses: G001, S384 ## Reverse checks - S385 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S384 · premise_and_result_audit — Recompute Mobius inversion complete minus partial with exact rational arithmetic, not rounded decimals. - S383 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL omitted-divisor partial sum with exact rational arithmetic, not rounded decimals. - S382 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S381 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse direct plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S380 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse direct ORIGINAL a times n with exact rational arithmetic, not rounded decimals. - S379 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse complete inverse-term sum with exact rational arithmetic, not rounded decimals. - S378 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(462) times SAME F(n/462) with exact rational arithmetic, not rounded decimals. - S377 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/462) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S376 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/462) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S375 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/462) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S374 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S373 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor462 with exact rational arithmetic, not rounded decimals. - S372 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S371 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S370 · premise_and_result_audit — Recompute upf canonical complete product factor3 with exact rational arithmetic, not rounded decimals. - S369 · premise_and_result_audit — Recompute upf canonical complete product factor2 with exact rational arithmetic, not rounded decimals. - S368 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S367 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S366 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S365 · premise_and_result_audit — Recompute upf extract divisor7 occurrence2 with exact rational arithmetic, not rounded decimals. - S364 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S363 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S362 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S361 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S360 · premise_and_result_audit — Recompute upf extract divisor3 occurrence1 with exact rational arithmetic, not rounded decimals. - S359 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S358 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals. - S357 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S356 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S355 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(231) times SAME F(n/231) with exact rational arithmetic, not rounded decimals. - S354 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/231) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S353 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/231) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S352 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/231) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S351 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/231) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S350 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/231) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S349 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S348 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor231 with exact rational arithmetic, not rounded decimals. - S347 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S346 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S345 · premise_and_result_audit — Recompute upf canonical complete product factor2 with exact rational arithmetic, not rounded decimals. - S344 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S343 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S342 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S341 · premise_and_result_audit — Recompute upf extract divisor7 occurrence1 with exact rational arithmetic, not rounded decimals. - S340 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S339 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S338 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S337 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S336 · premise_and_result_audit — Recompute upf extract divisor3 occurrence0 with exact rational arithmetic, not rounded decimals. - S335 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S334 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S333 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S332 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(154) times SAME F(n/154) with exact rational arithmetic, not rounded decimals. - S331 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/154) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S330 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/154) f(3) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S329 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/154) f(3) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S328 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/154) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S327 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/154) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - 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 inversion ORIGINAL inverse n divided by ORIGINAL divisor154 with exact rational arithmetic, not rounded decimals. - S324 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S323 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S322 · premise_and_result_audit — Recompute upf canonical complete product factor2 with exact rational arithmetic, not rounded decimals. - S321 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S320 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S319 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S318 · premise_and_result_audit — Recompute upf extract divisor7 occurrence1 with exact rational arithmetic, not rounded decimals. - S317 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S313 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S312 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S309 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(77) times SAME F(n/77) with exact rational arithmetic, not rounded decimals. - S308 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S307 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) f(6) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S306 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) f(6) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S305 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) f(3) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S304 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) f(3) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S303 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S302 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S301 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S300 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/77) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S299 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S298 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor77 with exact rational arithmetic, not rounded decimals. - 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S295 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S294 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S293 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S292 · premise_and_result_audit — Recompute upf extract divisor7 occurrence0 with exact rational arithmetic, not rounded decimals. - 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S289 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S288 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S287 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S286 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S285 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S284 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(66) times SAME F(n/66) with exact rational arithmetic, not rounded decimals. - S283 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/66) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S282 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/66) f(7) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S281 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/66) f(7) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S280 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/66) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S279 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/66) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S278 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S277 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor66 with exact rational arithmetic, not rounded decimals. - 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 upf canonical complete product factor2 with exact rational arithmetic, not rounded decimals. - S273 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S272 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S271 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S270 · premise_and_result_audit — Recompute upf extract divisor3 occurrence1 with exact rational arithmetic, not rounded decimals. - S269 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S268 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals. - S267 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 — Recompute Mobius inversion ORIGINAL inverse mu(42) times SAME F(n/42) with exact rational arithmetic, not rounded decimals. - S264 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/42) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S263 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/42) f(11) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S262 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/42) f(11) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S261 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/42) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S260 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/42) f(1) ORIGINAL a times divisor 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 — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor42 with exact rational arithmetic, not rounded decimals. - S257 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S256 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S255 · premise_and_result_audit — Recompute upf canonical complete product factor2 with exact rational arithmetic, not rounded decimals. - S254 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S253 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S252 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S251 · premise_and_result_audit — Recompute upf extract divisor3 occurrence1 with exact rational arithmetic, not rounded decimals. - S250 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S249 · premise_and_result_audit — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals. - S248 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 inversion ORIGINAL inverse mu(33) times SAME F(n/33) with exact rational arithmetic, not rounded decimals. - S245 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S244 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) f(14) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S243 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) f(14) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S242 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) f(7) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S241 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) f(7) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S240 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S239 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S238 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S237 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/33) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S236 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S235 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor33 with exact rational arithmetic, not rounded decimals. - S234 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S233 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S232 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S231 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S230 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S229 · premise_and_result_audit — Recompute upf extract divisor3 occurrence0 with exact rational arithmetic, not rounded decimals. - S228 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S227 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 inversion ORIGINAL inverse mu(22) times SAME F(n/22) with exact rational arithmetic, not rounded decimals. - S224 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S223 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) f(21) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S222 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) f(21) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S221 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) f(7) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S220 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) f(7) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S219 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) f(3) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S218 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) f(3) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S217 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S216 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/22) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S215 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S214 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor22 with exact rational arithmetic, not rounded decimals. - S213 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S212 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S211 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S210 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S209 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals. - S206 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S205 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S204 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(21) times SAME F(n/21) with exact rational arithmetic, not rounded decimals. - S203 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S202 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) f(22) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S201 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) f(22) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S200 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) f(11) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S199 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) f(11) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S198 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S197 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S196 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S195 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/21) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S194 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S193 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor21 with exact rational arithmetic, not rounded decimals. - S192 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S189 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S188 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S187 · premise_and_result_audit — Recompute upf extract divisor3 occurrence0 with exact rational arithmetic, not rounded decimals. - S186 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S185 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S184 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S183 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(14) times SAME F(n/14) with exact rational arithmetic, not rounded decimals. - S182 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S181 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) f(33) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S180 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) f(33) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S179 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) f(11) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S178 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) f(11) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S177 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) f(3) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S176 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) f(3) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S175 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S174 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/14) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S173 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S172 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor14 with exact rational arithmetic, not rounded decimals. - S171 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S170 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S169 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S168 · premise_and_result_audit — Recompute upf canonical complete product factor0 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 — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals. - S165 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 — Recompute Mobius inversion ORIGINAL inverse mu(11) times SAME F(n/11) with exact rational arithmetic, not rounded decimals. - S162 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S161 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(42) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S160 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(42) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S159 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(21) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S158 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(21) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S157 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(14) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S156 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(14) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S155 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(7) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S154 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(7) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S153 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(6) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S152 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(6) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S151 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(3) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S150 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(3) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S149 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S148 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S147 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S146 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/11) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S145 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S144 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor11 with exact rational arithmetic, not rounded decimals. - S143 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S142 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S141 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S140 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S139 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 inversion ORIGINAL inverse mu(7) times SAME F(n/7) with exact rational arithmetic, not rounded decimals. - S135 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S134 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(66) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S133 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(66) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S132 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(33) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S131 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(33) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S130 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(22) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S129 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(22) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S128 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(11) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S127 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(11) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S126 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(6) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S125 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(6) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S124 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(3) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S123 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(3) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S122 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S121 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S120 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S119 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/7) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S118 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S117 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor7 with exact rational arithmetic, not rounded decimals. - S116 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 upf canonical complete product factor0 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 inversion ORIGINAL inverse mu(6) times SAME F(n/6) with exact rational arithmetic, not rounded decimals. - S109 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S108 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) f(77) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S107 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) f(77) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S106 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) f(11) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S105 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) f(11) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S104 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) f(7) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S103 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) f(7) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S102 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S101 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/6) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S100 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S099 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor6 with exact rational arithmetic, not rounded decimals. - S098 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S097 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S096 · premise_and_result_audit — Recompute upf canonical complete product factor1 with exact rational arithmetic, not rounded decimals. - S095 · premise_and_result_audit — Recompute upf canonical complete product factor0 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 — Recompute upf extract divisor2 occurrence0 with exact rational arithmetic, not rounded decimals. - S092 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S091 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S090 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(3) times SAME F(n/3) with exact rational arithmetic, not rounded decimals. - S089 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S088 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(154) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S087 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(154) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S086 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(77) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S085 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(77) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S084 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(22) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S083 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(22) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S082 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(14) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S081 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(14) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S080 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(11) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S079 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(11) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S078 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(7) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S077 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(7) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S076 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S075 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S074 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S073 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/3) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S072 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S071 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor3 with exact rational arithmetic, not rounded decimals. - S070 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S069 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S068 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S067 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S066 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S065 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse mu(2) times SAME F(n/2) with exact rational arithmetic, not rounded decimals. - S064 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S063 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(231) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S062 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(231) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S061 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(77) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S060 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(77) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S059 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(33) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S058 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(33) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S057 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(21) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S056 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(21) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S055 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(11) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S054 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(11) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S053 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(7) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S052 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(7) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S051 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(3) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S050 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(3) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S049 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S048 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/2) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S047 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S046 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor2 with exact rational arithmetic, not rounded decimals. - S045 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S044 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S043 · premise_and_result_audit — Recompute upf canonical complete product factor0 with exact rational arithmetic, not rounded decimals. - S042 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 — Recompute Mobius inversion ORIGINAL inverse mu(1) times SAME F(n/1) with exact rational arithmetic, not rounded decimals. - S039 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) full forward divisor sum with exact rational arithmetic, not rounded decimals. - S038 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(462) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S037 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(462) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S036 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(231) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S035 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(231) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S034 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(154) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S033 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(154) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S032 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(77) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S031 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(77) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S030 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(66) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S029 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(66) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S028 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(42) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S027 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(42) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S026 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(33) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S025 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(33) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S024 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(22) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S023 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(22) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S022 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(21) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S021 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(21) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S020 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(14) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S019 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(14) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S018 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(11) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S017 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(11) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S016 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(7) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S015 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(7) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S014 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(6) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S013 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(6) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S012 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(3) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S011 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(3) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S010 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(2) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S009 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(2) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S008 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(1) plus ORIGINAL b with exact rational arithmetic, not rounded decimals. - S007 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse F(n/1) f(1) ORIGINAL a times divisor with exact rational arithmetic, not rounded decimals. - S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S005 · premise_and_result_audit — Recompute Mobius inversion ORIGINAL inverse n divided by ORIGINAL divisor1 with exact rational arithmetic, not rounded decimals. - S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - 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 (462, [1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462], 1, [2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 154, 231, 462], 9241, -13815, 9241, No, all_positive_divisors_and_consistent_d_to_n_over_d_indexing_required) 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. Source hashes and review receipts - input commit: 0f7be61e2c22317a4075561dc822c87d881a50db - original question SHA-256: dddf2a7931dc250d7b88cb300d71e45113ffd09679958f4339c1fcfa7a826586 - candidate record SHA-256: fcbefe13998ceefac4663ca71c31e932cf64c51dbd089ec0d3546e8fc8a447a8 - semantic review receipt SHA-256: 49cf6ec60211c92d1c0c302663af4d44479635dc8181fb61a20c3374288e21c5 - question-first witness SHA-256: 10fd25b4643e5ff12753daceaa61f9f2499bf381f65ef96e9d21185c7c0d0c5e - Lean: NOT_RUN · human review: NOT_PERFORMED [Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261014-advance-20261110-r06-mobius-inversion-finite-divisors-0095.json)