Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

The Ratio of the Two Distinct-Totient Counts

../


This lead's notes that cite no source are author-recorded research, not claims.

Conditional phase reduction

The precise remaining question is whether

s⟼A(1/r;s)A(1;s)(0≤s<1)(1)s\longmapsto\frac{A(1/r;s)}{A(1;s)}\qquad(0\le s<1) \tag{1}

is constant. Here rr is the weight's argument, the least-preimage ratio ℓ(d)/d\ell(d)/d of a tail totient, and AA is the coefficient of the unrefereed totients manuscript. L65, an author-recorded conditional deduction at tier 0, proves uniform existence of A(1/r;s)A(1/r;s), its uniform positive lower bound, and

V′(x)=xGmlog⁡x(A(1/r;θ(x))+o(1)).(2)V'(x)=\frac{xG_m}{\log x}\bigl(A(1/r;\theta(x))+o(1)\bigr). \tag{2}

Its proof extends the manuscript's count of the largest prime, using Proposition 5.3's identity for the least preimage and the comparison lemma 6.6. Lemma 7.3 supplies the uniform tail bound for V−V′=∑k≥1NkV-V'=\sum_{k\ge1}N_k; in particular, A(1/r;s)=A(1;s)−∑k≥1A(fk;s)A(1/r;s)=A(1;s)-\sum_{k\ge1}A(f_k;s), uniformly in ss. Each phase occurs at arbitrarily large real arguments, so (1) is constant if and only if V/V′V/V' has a limit. If it is nonconstant, Proposition 417.2 gives a nondegenerate interval of limit points. L65 assumes no continuity of the coefficient.

L43, a further tier-0 conditional deduction resting on L65, proves that continuity from the same premises. Both A(1;s)A(1;s) and A(1/r;s)A(1/r;s) are continuous on 0≤s<10\le s<1, and each tends to λ/γ\lambda/\gamma times its value at s=0s=0 as s→1s\to1, where λ/γ>1\lambda/\gamma>1 is the factor by which GmG_m jumps at the end of a period. Hence A(1;s)A(1;s) is not constant, and (1) is a continuous function on the circle R/Z\mathbb R/\mathbb Z. The limit points of V/V′V/V' are exactly the values of the reciprocal of (1), and (1) is constant if and only if all its nonzero Fourier coefficients vanish. A limit for V/V′V/V' therefore needs an exact cancellation between two nonconstant coefficients.

L44, also tier 0 and conditional on the manuscript, constructs the phase profiles of fixed finite-prime divisibility conditions on the global least preimage. It approximates (1) from above by one finite-prime weighted sum with error at most 1/(Y−1)1/(Y-1), uniformly in phase, when primes at most YY are retained. The construction and remaining cancellation are stated below.

L103, a tier-0 deduction from the same manuscript applied at two cuts, shows that outside vanishing mass every tail totient factors through one prime tuple and a coprime cofactor, with a multiplicative least preimage. The phase observable in (1) therefore becomes a function of the smooth cofactor, averaged over a phase-dependent law. A proposed renewal comparison through that law still needs a weighted fiber estimate. Even if established with an error tending to zero, its degenerating kernel would not force constancy. The section "Tail uniqueness and the cofactor fiber" records the proposal, its gaps, and one quantitative estimate that would suffice.

Everything in this reduction depends on the manuscript's unrefereed structural and weighted estimates. The accepted fixed-dilation result for Problem 416 does not certify those estimates. Theorem 2.2 of the manuscript also implies lim inf⁡V/V′>1\liminf V/V'>1 from N1(x)≍V(x)N_1(x)\asymp V(x), but does not decide (1). Neither the manuscript nor these deductions claim a solution of Problem 417.

Target and exact question

Problem 417, status open. With V(x)=#{φ(m)≤x:m≥1}V(x)=\#\{\varphi(m)\le x:m\ge1\}, the number of totient values up to xx, and V′(x)=#{φ(m):1≤m≤x}V'(x)=\#\{\varphi(m):1\le m\le x\}, the number of distinct totients of the integers up to xx: does lim⁡x→∞V(x)/V′(x)\lim_{x\to\infty}V(x)/V'(x) exist, and is it greater than 11? The problem page records the formulation and status evidence; no solution is claimed here. Its sources on V′V' are the order of magnitude V≍V′V\asymp V' that Pollack, Pomerance and Treviño attribute to Ford, and the closing remark of Maier and Pomerance that a lower bound for V(x)−V′(x)V(x)-V'(x), the number of totients up to xx all of whose preimages exceed xx, is a harder question than the order of VV.

Route and established inputs at their actual scope

The route is the section "Problem 417" of the connections page of the Problem 416 folder, where every statement below is proved; write R(x)=V(x)/V′(x)R(x)=V(x)/V'(x) and V0(x)=V(x)−V′(x)V_0(x)=V(x)-V'(x).

  • Proposition 417.2 (author-recorded): the set of subsequential limits of RR is the closed interval [lim inf⁡R,lim sup⁡R][\liminf R,\limsup R], so either the limit exists or RR has continuum many limit points. Inputs: V′V' has unit jumps and V′(x)≥π(x)V'(x)\ge\pi(x), so the adjacent variation of RR tends to 00, and Step 7 of the preprint's reconstruction runs verbatim; the finiteness of the upper endpoint is the cited order of magnitude V≍V′V\asymp V' (page 7 of the 2013 manuscript on its card, quoting Ford's §§4–5, not reread), or alternatively Lemma 4.1(iii) of that manuscript as reconstructed on the Problem 49 folder's page with its two imported counts.
  • Theorem 417.3 (author-recorded): V0(x)≥ηV(x)V_0(x)\ge\eta V(x) for arbitrarily large xx, for some η>0\eta>0; hence lim sup⁡R>1\limsup R>1, and if the limit exists it exceeds 11. Inputs: Ford's Theorem 8 (card, statement level) with the paper's witness d=54d=54, whose preimages 8181 and 162162 are verified on the connections page, so that a positive proportion of totients have every preimage divisible by 33 and hence least preimage at least 32\tfrac32 times the value; Ford's Theorem 1 with the derivative bound of Step 1 of the preprint's reconstruction, which sums VV along a geometric sequence of scales; and Chebyshev's bound. The refereed inputs suffice; the accepted doubling law of the Theorem 1.1 reconstruction is not needed and would only sharpen a constant.
  • The reformulation V0(x)=#{v≤x totient:fmin⁡(v)>x}V_0(x)=\#\{v\le x\text{ totient}:f_{\min}(v)>x\} with fmin⁡f_{\min} the least preimage, and the frame under which the limit exists and equals the reciprocal of ∫01G(1/u) du\int_0^1G(1/u)\,du, where GG would be a limiting distribution function of fmin⁡(v)/vf_{\min}(v)/v over totients and the general-scale law V(ux)∼uV(x)V(ux)\sim uV(x) is assumed.

Finite-range numbers (exploratory, from a sieve of Euler's function to 6.2⋅1076.2\cdot10^7, which covers every preimage of every totient up to 10710^7): R(x)R(x) is 1.09911.0991, 1.10001.1000, 1.09961.0996 and 1.10001.1000 at x=104,105,106,107x=10^4,10^5,10^6,10^7, every totient v≤107v\le10^7 has fmin⁡(v)≤2.0414 vf_{\min}(v)\le2.0414\,v, and among the totients in (5⋅106,107](5\cdot10^6,10^7] the proportions with least-preimage ratio at least 1.11.1, 1.251.25 and 1.51.5 are 0.3190.319, 0.2660.266 and 0.1940.194. These are observations, not evidence for the limit.

The same three unconditional statements and the conditional one are derived independently on the Problem 49 connections page (Propositions 2, 3 and 4) from Lemma 4.1 as stated, with the seed totient 11 for boundedness and the reversed-pair seed 218⋅2572^{18}\cdot257, all of whose preimages are even, for the limit superior; its premise (W) is (P1) in convenient-integer form.

Provisional premises

  • (P1) The short-interval form of Ford's Theorem 8: totients in (2x/3,x](2x/3,x] all of whose preimages are divisible by 33 number ≫V(x)\gg V(x) for all large xx. Ford's Theorem 4 localizes the paper's multiplicity counts to intervals (x,x+y](x,x+y] with y≥xθy\ge x^\theta by a modification of the proofs of Theorems 1 and 2, and Theorem 8 is a corollary of the proof of Theorem 2, but the held paper does not state the localized form. Under (P1), Proposition 417.4 of the connections page gives lim inf⁡R>1\liminf R>1.
  • (P2) A limiting distribution of the least-preimage ratio over totients, together with the general-scale law of Problem 416. Under (P2) the limit exists with the value given by the frame; without it the frame is only a reformulation. The general-scale law is an accepted input recorded on the problem page; convergence of the distribution is not established here.

(P1) remains a possible route from the refereed literature to a uniform lower bound above one. It is not needed for the conditional phase test, whose manuscript already gives that conclusion. (P2) is stronger than what that test needs: constancy of the single weighted average (1) suffices, whether or not a whole limiting distribution is available.

Consequential gap

Whether (1) is constant. For the finite coefficients, let pH,s(d)p_{H,s}(d) be the probability of the union of the witness events for dd in the manuscript's Equation (2.7). Cancellation of the common prefactor gives

AH(1/r;s)AH(1;s)=∑dpH,s(d)/ℓ(d)∑dpH,s(d)/d.(3)\frac{A_H(1/r;s)}{A_H(1;s)} =\frac{\sum_d p_{H,s}(d)/\ell(d)}{\sum_d p_{H,s}(d)/d}. \tag{3}

L65 proves uniform convergence of this quotient. Both the finite witness set and its union probabilities vary with ss. The sum is over distinct totients dd, and ℓ(d)\ell(d) is minimized over all preimages, not over a chosen witness. A proposed separation of small-prime arithmetic from the phase must respect both operations. The manuscript's common-prefix proposition does not itself make the tail law independent of phase. Applied also at the shorter cut PP, it removes the union over tail prime tuples outside vanishing mass (L103). Deduplication and the global minimum then act only inside the distinct totients of the smooth cofactor, which is where two phases must be compared.

The earlier near-hit mechanism for Problem 416 also does not decide this: RR compares two functions at one scale, so consecutive ratios do not telescope. The accepted pair construction bounds least preimages above without supplying the phase cancellation needed in (3).

The finite-coefficient test

Write qH(s)q_H(s) for (3), g(d)=d/ℓ(d)g(d)=d/\ell(d), β=γ/αs\beta=\gamma/\alpha_s, and μH,s\mu_{H,s} for the probability measure on tail totients proportional to pH,s(d)/dp_{H,s}(d)/d, so that qH(s)q_H(s) is the μH,s\mu_{H,s}-expectation of gg. The following observations are author-recorded and unreviewed; they locate where the phase enters (3) without deciding (1).

  • Scale covariance of a continuous relaxation. Multiply every tail coordinate vh=log⁡log⁡Qhv_h=\log\log Q_h, P≤h<HP\le h<H, by c=αs′/αsc=\alpha_{s'}/\alpha_s. The bands of (2.5) at phase ss become exactly those at phase s′s', the simplex conditions of (2.5) are homogeneous, and every threshold βρhD(h,η)\beta\rho^hD(h,\eta) in (2.7) is unchanged, since β\beta becomes β/c\beta/c while DD, linear in the vlv_l, becomes cDcD. Replacing unrestricted prime reciprocal sums by the Mertens measure dvhdv_h would leave a factor c−Pc^{-P}, from the prefactor (γ/αs)H(\gamma/\alpha_s)^H and the Jacobian cH−Pc^{H-P}. That common factor would cancel in a quotient. However, this map supplies no primes with the rescaled coordinates, no correspondence of distinct totient values, and no transport of the minimum over all preimages. The smooth cofactor and its bound also remain arithmetic. Mertens' theorem alone gives no error estimate for this weighted, deduplicated transport. The covariance is exact for the real inequalities and thresholds; extending it to (3) is the missing construction. After the factorization (6) below it must compare the restricted pair law and its cofactor fibers, whose smoothness bound QPQ_P moves with the rescaled coordinates.
  • Pieces and drift. For fixed HH the phase enters the witness conditions (2.5) only through the bands for log⁡log⁡Qh\log\log Q_h and the bound for log⁡a\log a, so [0,1)[0,1) splits into finitely many intervals on which every witness set is constant (the first step of L43's proof). On such an interval only β\beta varies, with dβ/ds=−λβd\beta/ds=-\lambda\beta, and differentiating (3) gives qH′(s)=−λβ cH(s)q_H'(s)=-\lambda\beta\,c_H(s), where cH(s)=CovμH,s(g,∂βlog⁡pH,s)c_H(s)=\mathrm{Cov}_{\mu_{H,s}}(g,\partial_\beta\log p_{H,s}). For a single witness η\eta, ∂βlog⁡p=−∑h≥HρhD(h,η)\partial_\beta\log p=-\sum_{h\ge H}\rho^hD(h,\eta), which is dominated by the largest tail primes, while gg is governed by the smallest primes of the least preimage. The rest of the variation of qHq_H is a finite set of jumps where a witness enters or leaves a band or the cofactor bound. Constancy needs the integrated drift and the jumps between any two phases to cancel in the limit, including the jumps at the lowest band and at the cofactor bound, next to the smallest primes.
  • Memoryless factorization. If all witnesses of dd share their primes QhQ_h for H′≤h<HH'\le h<H, then D(h,η)=D′(h)+D′′(h,η)D(h,\eta)=D'(h)+D''(h,\eta) with D′D' the common contribution of those primes. Put S′=∑h≥HρhD′(h)S'=\sum_{h\ge H}\rho^hD'(h). The memoryless property of the exponential variables gives exactly that pH,s(d)p_{H,s}(d) equals e−βS′e^{-\beta S'} times the probability of the union over η\eta of the events Eh≥βρhD′′(h,η)E_h\ge\beta\rho^hD''(h,\eta) for all h≥Hh\ge H. This factors a common part of the penalty. By itself it does not factor the sum over distinct dd, the weight 1/d1/d, or g(d)g(d), all of which retain the full arithmetic fiber. When all witnesses share the whole tuple (H′=PH'=P), QPQ_P does not divide the cofactor, and the least preimage splits as in L103, all three factor through the cofactor totient; L103 shows that these conditions hold outside vanishing mass.
  • Descent supplies no mixing law. At the nominal lower scale one has ψ(αsHρ−H)=H+s+o(1)\psi(\alpha_sH\rho^{-H})=H+s+o(1), so the central grid does not average over phases. The actual bands have width, and the cofactor is constrained by both size and smoothness. The proposed transition through the cofactor fiber, relation (9) below, would shift the phase by the relative position of QPQ_P in its band. Under the coefficient-transfer premise stated below, that position concentrates as PP grows. Lemma 6.4 expressly bounds each phase without comparing witness sets at nearby phases, and Proposition 5.3 supplies no such comparison. A continuous simplex model omits deduplication and the global minimum; its fluctuations or Fourier coefficients therefore give no estimate for (1).
  • Grouping the cofactors still requires a union over distinct values. Fix H,sH,s and a prime tuple Q\mathbf Q. Let AQ,s\mathcal A_{\mathbf Q,s} be its admissible cofactors in (2.5), and put dQ(a)=φ(a∏hQh)d_{\mathbf Q}(a)=\varphi(a\prod_hQ_h). The event in (2.7) depends only on Q\mathbf Q; denote it by EQ\mathcal E_{\mathbf Q} and put $\mathcal T_s(d)={\mathbf Q:d=d_{\mathbf Q}(a) \text{ for some }a\in\mathcal A_{\mathbf Q,s}}$. The exact weight is therefore
pH,s(d)=Pr⁡ ⁣(⋃Q∈Ts(d)EQ).p_{H,s}(d)=\Pr\!\left(\bigcup_{\mathbf Q\in\mathcal T_s(d)} \mathcal E_{\mathbf Q}\right).

A fixed tuple does not make the cofactor-to-value map injective. For any admissible tuple of odd primes, a=1a=1 and a=2a=2 are admissible at sufficiently large HH, and give the same totient and the same event, since φ(2w)=φ(w)\varphi(2w)=\varphi(w) for odd ww. A sum over cofactors with weights 1/φ(a)1/\varphi(a) counts this contribution twice. More generally, the same duplication holds for every admissible odd aa for which 2a2a also meets the size bound. This exact duplication does not by itself give a lower bound for its share of the limiting mass; it does rule out identifying the cofactor sum with the coefficient without correction.

One exact grouping orders the finite set of tuples and replaces EQ\mathcal E_{\mathbf Q}, for each dd, by $\mathcal E_{\mathbf Q}\setminus \bigcup_{\mathbf Q'\prec\mathbf Q,\ \mathbf Q'\in\mathcal T_s(d)} \mathcal E_{\mathbf Q'}$. These disjoint events sum to pH,s(d)p_{H,s}(d), but their probabilities now depend on the competing tuples for dd. Inside each tuple the sum must still be over distinct values dQ(a)d_{\mathbf Q}(a), with the weight 1/d1/d and the global minimum ℓ(d)\ell(d). Even the product identity dQ(a)=φ(a)∏h(Qh−1)d_{\mathbf Q}(a)=\varphi(a)\prod_h(Q_h-1) needs coprimality: (2.5) allows QP∣aQ_P\mid a. Proposition 5.3 at the cut HH concerns the long prefix before this retained tail, as x→∞x\to\infty with HH fixed; by itself it does not assert uniqueness of the tail tuple under μH,s\mu_{H,s} as H→∞H\to\infty. A phase-independent cofactor law must consequently be proved for this deduplicated, weighted measure, or accompanied by a uniform error for replacing it. L103 supplies the uniqueness and coprimality outside vanishing mass, and turns the duplication of aa and 2a2a into a sum over distinct cofactor totients ee; the phase-independent cofactor law remains unproved.

The finite-prime construction

The unrefereed, non-arXiv note An explicit bound for Erdős problem 417, posted on 10 October 2026 (PDF), claims lim sup⁡V/V′<2.195202\limsup V/V'<2.195202 from Theorem 2.1 and Proposition 5.3 of the unrefereed manuscript. It compares the mean of v/ℓ(v)v/\ell(v) with V′/VV'/V and bounds prime divisibility of ℓ(v)\ell(v) by deleting a prime power. Both pages were read, including the proof and numerical procedure; the rational prime sum was not rerun, and no independent acceptance is recorded.

L44 carries the needed prime estimates into the coefficient itself. For fixed squarefree kk, define

Ck(x)=#{v≤x:v∈V, k∣ℓ(v)},bH,k(s)=∑dμH,s(d)1k∣ℓ(d).C_k(x)=\#\{v\le x:v\in\mathcal V,\ k\mid\ell(v)\},\qquad b_{H,k}(s)=\sum_d\mu_{H,s}(d)\mathbf 1_{k\mid\ell(d)}.

It proves bH,k→bkb_{H,k}\to b_k uniformly in ss, where bkb_k is continuous on the circle and Ck(x)/V(x)=bk(θ(x))+o(1)C_k(x)/V(x)=b_k(\theta(x))+o(1). The construction uses the common-prefix identity only after all its primes exceed those dividing kk; it then applies the manuscript's bounded-weight approximation. It neither chooses a preferred witness nor replaces the global minimum.

For integers Y≥2Y\ge2, put PY=∏p≤YpP_Y=\prod_{p\le Y}p and

QY(s)=∑k∣PYmobius⁡(k)kbk(s),TY=∑p>Y1(p−1)2≤1Y−1.Q_Y(s)=\sum_{k\mid P_Y}\frac{\operatorname{mobius}(k)}k b_k(s), \qquad T_Y=\sum_{p>Y}\frac1{(p-1)^2}\le\frac1{Y-1}.

Then L44 gives the explicit phase-uniform estimate

0≤QY(s)−q(s)≤TY,lim sup⁡H→∞sup⁡sEμH,s[wY(d)−g(d)]≤TY,(4)0\le Q_Y(s)-q(s)\le T_Y,\qquad \limsup_{H\to\infty}\sup_s \mathbb E_{\mu_{H,s}}\bigl[w_Y(d)-g(d)\bigr]\le T_Y, \tag{4}

where wY(d)=∏p≤Y, p∣ℓ(d)(1−1/p)w_Y(d)=\prod_{p\le Y,\,p\mid\ell(d)}(1-1/p). The order of limits is fixed YY first, then H→∞H\to\infty. Thus large primes in the weight can be discarded uniformly; the missing input is cancellation in the single finite-prime weighted sum QYQ_Y. Constancy of every bkb_k would suffice but is stronger than needed, and no limiting distribution of the whole least-preimage ratio is required. The marginal bounds b2≤1/2b_2\le1/2 and bp≤p/(p−1)2b_p\le p/(p-1)^2 impose no equality between phases.

Why prime deletion does not give a dilation identity

Even the prime 22 exposes the missing arithmetic comparison. For a totient uu, let e(u)e(u) be its least even preimage, which always exists, and let o(v)o(v) be the least odd preimage of vv, with value +∞+\infty if there is none. An even global minimum for 2u2u must be divisible by 44; halving it gives an even preimage of uu. Conversely, doubling an even preimage of uu gives a preimage of 2u2u. Hence, exactly,

ℓ(2u)=min⁡{o(2u),2e(u)},C2(x)=∑u≤x/2u∈V1 2e(u)<o(2u).(5)\ell(2u)=\min\{o(2u),2e(u)\},\qquad C_2(x)=\sum_{\substack{u\le x/2\\u\in\mathcal V}} \mathbf 1_{\,2e(u)<o(2u)}. \tag{5}

The two finite candidates have opposite parity, so there is no tie. Formula (5) explains the bound C2(x)≤V(x/2)C_2(x)\le V(x/2) and its failure to be an identity: for u=4u=4, e(4)=8e(4)=8 and o(8)=15o(8)=15, so the summand is zero. These minima follow by evaluating φ(n)\varphi(n) for n≤15n\le15; no claim about an absent preimage is needed. The reciprocal least-preimage ratio itself is not monotone under doubling: g(2)=2/3<g(4)=4/5g(2)=2/3<g(4)=4/5 but g(8)=8/15<g(4)g(8)=8/15<g(4). Thus monotonicity of this elementary arithmetic operation supplies no phase coupling. Estimating the indicator in (5) with the required phase control remains open here.

Tail uniqueness and the cofactor fiber

L103, a tier-0 conditional deduction, applies Proposition 5.3 at the cut HH and again at the cut P=⌊log⁡log⁡H⌋P=\lfloor\log\log H\rfloor, whose common prefix ends at QPQ_P and so contains every retained tail prime. Outside a set of data whose normalized mass is at most ϵH+ϵP\epsilon_H+\epsilon_P as x→∞x\to\infty, where ϵK\epsilon_K is the rate of Proposition 5.3 at the cut KK, every witness of the tail totient dd has the same prime tuple Q\mathbf Q, the prime QPQ_P does not divide the cofactor, and

d=e∏h=PH−1(Qh−1),ℓ(d)=ℓ(e)∏h=PH−1Qh,e=φ(a)d=e\prod_{h=P}^{H-1}(Q_h-1),\qquad \ell(d)=\ell(e)\prod_{h=P}^{H-1}Q_h,\qquad e=\varphi(a)

for every witness (Q,a)(\mathbf Q,a). Such dd are called factorized. L103 also gives q(θ(x))q(\theta(x)), up to an error tending to zero with HH, as the mean of g(e)g(e) over the factorized data, with the manuscript's weights 1/(d∏i≤R(pi−1))1/(d\prod_{i\le R}(p_i-1)). Distinct values and the global minimum now enter only through the cofactor totient ee.

On a factorized dd the union in (2.7) has one event, which depends only on Q\mathbf Q, so exactly

pH,s(d)d=Ws(Q)e,Ws(Q)=exp⁡(−γSQ/αs)∏h=PH−1(Qh−1),SQ=∑h≥HρhD(h,Q).\frac{p_{H,s}(d)}d=\frac{W_s(\mathbf Q)}e,\qquad W_s(\mathbf Q)=\frac{\exp(-\gamma S_{\mathbf Q}/\alpha_s)} {\prod_{h=P}^{H-1}(Q_h-1)},\qquad S_{\mathbf Q}=\sum_{h\ge H}\rho^hD(h,\mathbf Q).

Passing L103 from the manuscript's data to the coefficient's measure μH,s\mu_{H,s} needs Lemma 6.4 and Proposition 6.5 for the indicator of the factorized set, which is not a function of ℓ(d)/d\ell(d)/d. Their proofs bound the absolute difference between prime sums and volumes for each tail totient separately and sum these bounds over all tail totients and witnesses, so they appear to apply verbatim to every weight in [0,1][0,1] that depends only on dd and the phase. With that reading of the two proofs as an additional premise, the μH,s\mu_{H,s}-mass of the nonfactorized tail totients tends to zero uniformly in ss, and

qH(s)=∑(Q,e)Ws(Q) g(e)/e∑(Q,e)Ws(Q)/e+oH(1)=∑QπH,s(Q) mH,s(Q)+oH(1),(6)q_H(s)=\frac{\sum_{(\mathbf Q,e)}W_s(\mathbf Q)\,g(e)/e} {\sum_{(\mathbf Q,e)}W_s(\mathbf Q)/e}+o_H(1) =\sum_{\mathbf Q}\pi_{H,s}(\mathbf Q)\,m_{H,s}(\mathbf Q)+o_H(1), \tag{6}

uniformly in ss, where the sums run over the pairs given by factorized tail totients. Here mH,s(Q)m_{H,s}(\mathbf Q) is the mean of g(e)g(e) with weights 1/e1/e over the cofactor totients ee paired with Q\mathbf Q, and πH,s(Q)\pi_{H,s}(\mathbf Q) is proportional to Ws(Q)W_s(\mathbf Q) times their total weight. The pairs do not form a product set, since whether e∏h(Qh−1)e\prod_h(Q_h-1) is factorized depends on all its witnesses.

In (6) the phase enters in three places: the bands and simplex conditions of (2.5) on Q\mathbf Q; the threshold factor γ/αs\gamma/\alpha_s in Ws(Q)W_s(\mathbf Q); and the cofactor conditions P+(a)≤QPP^+(a)\le Q_P and log⁡a≤exp⁡(2αsPρ−P)\log a\le\exp(2\alpha_sP\rho^{-P}), which define the fiber. The scale covariance above matches the continuous regions by rescaling the coordinates vhv_h. It does not yet match the discrete factorized pairs: the fiber restriction also affects their total weights. Both the laws πH,s\pi_{H,s} and the fiber means mH,sm_{H,s} require comparison, including a uniform estimate for the prime-sum error with this restriction.

The fiber at its own scale. Put Y=QPY=Q_P. One possible route would replace the restricted cofactor fiber by all totient values below an appropriate power of YY, with harmonic weight 1/e1/e. In that unrestricted sum, partial summation would involve the counting coefficients Gm(t)A(1;θ(t))G_{m(t)}A(1;\theta(t)) in the variable log⁡log⁡t\log\log t. If their mass concentrated within O(1/P)O(1/P) of the upper double-logarithmic scale, the continuity of qq (L43) would suggest the following fiber identification:

mH,s(Q)=q(ψ(log⁡log⁡QP))+o(1)(P→∞).(7)m_{H,s}(\mathbf Q)=q\bigl(\psi(\log\log Q_P)\bigr)+o(1) \qquad(P\to\infty). \tag{7}

Equation (7) is a proposed estimate, not an established harmonic inner limit. It requires control of nonfactorized pairs inside the fibers, counted with their multiplicity, which the distinct-value mass bound of L103 does not give; the cofactor smoothness and size restrictions near YY; and the weighted concentration just described. An error tending to zero after averaging with πH,s\pi_{H,s}, uniformly in ss, would suffice in place of a pointwise estimate for every fiber. None is proved here. With log⁡log⁡QP=(1+ϵP)αsPρ−P\log\log Q_P=(1+\epsilon_P)\alpha_sP\rho^{-P} and ∣ϵP∣≤0.1|\epsilon_P|\le0.1 by the band, a direct calculation from ψ(B)=(log⁡B−log⁡log⁡B)/λ\psi(B)=(\log B-\log\log B)/\lambda gives

ψ(log⁡log⁡QP)=P+s+log⁡(1+ϵP)λ+O(log⁡PP).(8)\psi(\log\log Q_P)=P+s+\frac{\log(1+\epsilon_P)}\lambda +O\Bigl(\frac{\log P}P\Bigr). \tag{8}

If these comparisons were established uniformly in phase, (6)–(8) would express qq through itself:

q(s)=lim⁡H→∞∑QπH,s(Q) q(s+log⁡(1+ϵP(Q))λ),(9)q(s)=\lim_{H\to\infty}\sum_{\mathbf Q}\pi_{H,s}(\mathbf Q)\, q\Bigl(s+\frac{\log(1+\epsilon_P(\mathbf Q))}\lambda\Bigr), \tag{9}

a proposed renewal relation through the cofactor fiber whose kernel is supported in [log⁡(0.9)/λ,log⁡(1.1)/λ]⊂[−0.18,0.16][\log(0.9)/\lambda,\log(1.1)/\lambda]\subset[-0.18,0.16].

What a degenerating renewal kernel would give. Ford's deviation estimate behind the manuscript's (3.7), applied at the single level PP, bounds the proportion of values for which some preimage has ∣ϵP∣>η|\epsilon_P|>\eta by Oη(e−cη2P)O_\eta(e^{-c\eta^2P}). Under the same reading of Lemma 6.4 and Proposition 6.5, a kernel obtained from these weighted data would therefore tend to the point mass at zero. In the unrestricted continuous simplex model of Lemma 3.4 the coordinate at level PP is about αρ−P\alpha\rho^{-P} times a sum of P+1P+1 exponential variables, so ϵP\epsilon_P has spread of order P−1/2P^{-1/2} and the kernel of order 1/(λP)1/(\lambda\sqrt P). This variance description has not been transferred to the restricted fibers. An identity of the form (9) for any kernels concentrating at zero is satisfied by every continuous function on the circle and decides nothing by itself.

One sufficient quantitative route is the following. Suppose that for phase-free probability kernels κP\kappa_P on [−0.18,0.16][-0.18,0.16] with ∫(1−cos⁡2πnt) dκP(t)≫n1/P\int(1-\cos2\pi nt)\,d\kappa_P(t)\gg_n1/P for every n≠0n\ne0, as for a spread of order P−1/2P^{-1/2}, one had

q(s)=∫q(s+t) dκP(t)+rP(s),sup⁡s∣rP(s)∣=o(1/P).q(s)=\int q(s+t)\,d\kappa_P(t)+r_P(s),\qquad \sup_s|r_P(s)|=o(1/P).

Taking Fourier coefficients, q^(n)(1−κ^P(n))=r^P(n)\hat q(n)(1-\hat\kappa_P(n))=\hat r_P(n) with ∣1−κ^P(n)∣≫n1/P|1-\hat\kappa_P(n)|\gg_n1/P and ∣r^P(n)∣=o(1/P)|\hat r_P(n)|=o(1/P), so every nonzero Fourier coefficient of qq vanishes and qq is constant. A kernel that depends on the phase would need a further mixing argument. The premises supply no such rate. Theorem 2.1 and L65 carry none. The manuscript's coverage bound at a cut KK is e−cPKe^{-cP_K} with PK=⌊log⁡log⁡K⌋P_K=\lfloor\log\log K\rfloor. In its existing estimates, the smooth cofactor below PKP_K costs KK=exp⁡(CPKρ−PK)K_K=\exp(CP_K\rho^{-P_K}), which the K−2K^{-2} saving of Proposition 3.8 must absorb. Applying that coverage estimate at a cut of order m(QP)≈Pm(Q_P)\approx P gives an upper bound of order (log⁡P)−c(\log P)^{-c}, which does not supply the o(1/P)o(1/P) error needed by this Fourier argument. This is a limitation of the available bounds, not a lower bound on the actual error or an obstruction to every possible coupling.

What the rectangle estimate can compare

Theorem 2.1 of the totient-iteration paper compares divisibility of p−1p-1, for x<p≤2xx<p\le2x, by one to three distinct large primes with harmonic weights. Its coefficient is independent of pp and of the last prime. Section 3, Proposition 3.2, sums over an auxiliary prime to allow arbitrary bounded weights on one or two large factors in its truncated regions, with error O((log⁡log⁡x)−7)O((\log\log x)^{-7}). Its hypotheses and the auxiliary-prime deduction were read; its underlying analytic proof has not been independently examined here. A collision between products of several shifted primes is not an event about divisibility of a single p−1p-1 without another reduction.

The direct identification of the primes in (3) with those of the rectangle estimate fails uniformly in phase. With T=log⁡log⁡x=BT=\log\log x=B, Theorem 2.1 admits only prime factors q>xcT−20q>x^{cT^{-20}}, that is log⁡log⁡q≥B−20log⁡B+log⁡c\log\log q\ge B-20\log B+\log c, and Proposition 3.2 only factors above xT−6x^{T^{-6}}. Every retained tail prime satisfies log⁡log⁡Qh≤1.1(λ/ρ)(H−1)ρ−(H−1)\log\log Q_h\le1.1(\lambda/\rho)(H-1)\rho^{-(H-1)} and every cofactor log⁡a≤exp⁡(2(λ/ρ)Pρ−P)\log a\le\exp(2(\lambda/\rho)P\rho^{-P}), bounds depending on HH alone, while the prefix primes after p0p_0 satisfy log⁡log⁡pi≤0.61B\log\log p_i\le0.61B. For all large xx the only prime of a basic preimage in the admissible range is therefore p0p_0. Applying the estimate with p=p0p=p_0 observes large factors of p0−1p_0-1, whereas the remaining statistic is a function of the tail and its cofactor. In particular fixed primes q≤Yq\le Y eventually lie below the allowed range. This direct use supplies neither constancy of the bkb_k nor a certified error for the finite cut. An indirect encoding or application at another scale is not excluded, but would owe an exact allowed observable, a comparison with (6), and a phase-uniform omitted-mass bound. None has been constructed. Also, the coverage error relevant to the proposed renewal argument comes from Proposition 3.3 and Ford's band deviations at the lowest retained levels; the shifted-prime collisions of Proposition 5.1 already cost less than every power of HH. Improving only that collision bound would leave the coverage estimate unchanged.

Finite ranges and finite cuts

The phase is θ(x)=ψ(log⁡log⁡x)−m\theta(x)=\psi(\log\log x)-m with ψ(B)=(log⁡B−log⁡log⁡B)/λ\psi(B)=(\log B-\log\log B)/\lambda, where $\lambda=\log(1/\rho)\approx 0.6114$ and ρ≈0.5426\rho\approx0.5426 is the root of ∑jajρj=1\sum_ja_j\rho^j=1. The function ψ\psi decreases for B<eB<e and increases for B>eB>e, with minimum 1/λ≈1.6361/\lambda\approx1.636 at B=eB=e, that is at $x=\exp(e^e)\approx 3.8\cdot10^6$. Hence m(x)=1m(x)=1 for xx between about 150150 and about 1021310^{213}, and for 104≤x≤10710^4\le x\le10^7 the phase stays between 0.6350.635 and 0.6750.675. The finite-range values of R(x)R(x) recorded above therefore sample one narrow window of the circle. They neither cover a whole period nor come with an asymptotic error small enough to certify phase dependence or its absence. The next period, m=2m=2, runs from about 1021310^{213} to about exp⁡(7.6⋅107)\exp(7.6\cdot10^7).

The available finite-cut estimates do not supply the certificate described in the stop verdict. The manuscript bounds its cut errors only by rates such as e−cPe^{-cP}, with P=⌊log⁡log⁡H⌋P=\lfloor\log\log H\rfloor and an unspecified constant cc, for cuts that are sufficiently large in an unspecified sense. Already P≥2P\ge2 needs H≥ee2>1618H\ge e^{e^2}>1618 retained levels, whose largest tail primes have double logarithm about αs(H−1)ρ−(H−1)\alpha_s(H-1)\rho^{-(H-1)}. No direct enumeration at such cuts is available here, and an evaluated difference would still have to exceed an unquantified cut error.

An incomplete continuous model

The continuous simplex does not include deduplication or global least preimages. One can illustrate possible smoothing by replacing a low coordinate by a sum XhX_h of h+1h+1 independent exponential variables of mean one. In this equal-weight model,

EXhit=Γ(h+1+it)h!.\mathbb E X_h^{it}=\frac{\Gamma(h+1+it)}{h!}.

Thus convolution in the logarithmic coordinate damps frequency tt by ∣Γ(h+1+it)∣/h!|\Gamma(h+1+it)|/h!. At a phase frequency the corresponding value is t=2πn/λt=2\pi n/\lambda. This exact identity in the model supplies no estimate for (1): neither the observable gg nor the restricted law in (6) has been transferred to it. In particular the model gives no reason to assert that any Fourier coefficient of qq is nonzero, or to estimate its size.

Stop verdict and reopening conditions

The bounded structural test reaches neither conclusion, and this route is blocked. By L43 the exact missing identity is

lim⁡H→∞∫01qH(s) e−2πins ds=0(n≠0).(10)\lim_{H\to\infty}\int_0^1 q_H(s)\,e^{-2\pi ins}\,ds=0 \qquad(n\ne0). \tag{10}

Equivalently, by the proved truncation (4), the exact remaining estimate is

lim⁡Y→∞(sup⁡sQY(s)−inf⁡sQY(s))=0.(11)\lim_{Y\to\infty}\left(\sup_s Q_Y(s)-\inf_s Q_Y(s)\right)=0. \tag{11}

This is a criterion, not an assumed decoupling theorem. A phase-independent limit for each fixed finite-prime pattern would be sufficient; cancellation of just the weighted sums in (11) would also suffice. Neither has been constructed. A disproof needs some n≠0n\ne0 for which the limit in (10) is nonzero. By uniform convergence it would follow from one cut HH whose integral in (10) exceeds sup⁡s∣qH(s)−q(s)∣\sup_s|q_H(s)-q(s)| in modulus, or from two phases with ∣qH(s1)−qH(s2)∣>2sup⁡s∣qH(s)−q(s)∣|q_H(s_1)-q_H(s_2)|>2\sup_s|q_H(s)-q(s)|. The manuscript's cut errors tend to zero without certified numerical bounds, so the finite formula alone supplies no such inequality. At the finite-prime level, set QH,Y(s)=EμH,swYQ_{H,Y}(s)=\mathbb E_{\mu_{H,s}}w_Y and δH,Y=sup⁡s∣QH,Y(s)−QY(s)∣\delta_{H,Y}=\sup_s|Q_{H,Y}(s)-Q_Y(s)|. A concrete sufficient certificate is QH,Y(s1)−QH,Y(s2)>TY+2δH,YQ_{H,Y}(s_1)-Q_{H,Y}(s_2)>T_Y+2\delta_{H,Y}: the one-sided bound (4) then gives q(s1)>q(s2)q(s_1)>q(s_2). L44 proves δH,Y→0\delta_{H,Y}\to0 for fixed YY, but gives no certified finite-cut value for it.

The two bounded tests of the cofactor interface end as follows. The direct rectangle application does not compare the phases, because its admissible primes miss every prime of a preimage below the largest. The coupling test succeeds only structurally: L103 gives tail uniqueness, coprimality and the multiplicative least preimage outside vanishing mass. Equation (6) also uses the explicitly stated extension of the prime-sum comparison; (7) and (9) remain proposals requiring additional fiber estimates. The exact blocked comparison is the difference of the fiber means of (6) at two phases,

lim⁡H→∞(∑QπH,s1(Q) mH,s1(Q)−∑QπH,s2(Q) mH,s2(Q))=0(0≤s1,s2<1),(12)\lim_{H\to\infty}\Bigl(\sum_{\mathbf Q}\pi_{H,s_1}(\mathbf Q)\, m_{H,s_1}(\mathbf Q)-\sum_{\mathbf Q}\pi_{H,s_2}(\mathbf Q)\, m_{H,s_2}(\mathbf Q)\Bigr)=0\qquad(0\le s_1,s_2<1), \tag{12}

which is equivalent to the constancy of qq under the stated premise for (6). The Fourier route through (9) would suffice with a phase-free kernel, the displayed lower bound on its Fourier damping, and an error o(1/P)o(1/P) uniformly in phase. The available coverage bound of order (log⁡P)−c(\log P)^{-c} does not supply that error. No certified phase comparison or finite-cut separation has been obtained.

Arguments tried that do not close the gap:

  • separate constancy of the two coefficients, which L43 excludes;
  • fixed dilation and the pair constructions for Problem 416, which compare arguments at a single phase;
  • the common-prefix proposition and Lemma 6.4, whose bounds hold at each phase;
  • factorization over independent witnesses, which the union and the minimum over all preimages forbid;
  • prime deletion, which gives upper bounds but leaves the global-minimum comparison in (5);
  • tail uniqueness at two cuts (L103), which removes the union, the duplicated cofactors and the coprimality question but leaves the fiber;
  • descent through the tail and the cofactor: the proposed renewal relation (9) still needs a weighted fiber comparison, and even a rateless version would be compatible with every continuous qq if its kernel tends to a point mass;
  • the rectangle estimate of the totient-iteration paper, whose admissible primes miss the tail.

Reopen the constancy direction on a theorem that the distinct-totient structure at bounded levels is asymptotically invariant under rescaling the double-logarithmic grid, for example a renewal or mixing statement for the smallest prime factors of least preimages that is uniform in the phase, or on an exact identity expressing #{v≤x:k∣ℓ(v)}\#\{v\le x:k\mid\ell(v)\} through values of VV at fixed dilates, or on a one-sided comparison of phases, such as a coupling of μH,s\mu_{H,s} and μH,s′\mu_{H,s'} for s≤s′s\le s' under which gg does not decrease up to o(1)o(1); by L43 any such monotonicity forces constancy, because qq returns to q(0)q(0) at the end of the period. For the renewal route specifically, reopen on (9) with an error o(1/P)o(1/P) uniformly in phase, for a phase-free kernel or with a mixing argument for a phase-dependent one. A sufficient implementation would control the coverage, fiber restriction and counting errors at a cut KK by o(1/K)o(1/K); improving the shifted-product collision estimate alone does not do this. These rates describe one route, not a necessary condition for every possible proof. Reopen the nonconstancy direction on an evaluated phase gap exceeding the explicit prime truncation bound and a certified cut error, or on an exact asymptotic for a nonzero Fourier coefficient of qHq_H. The continuous model supplies no estimate of that coefficient. Finite-range stability of RR and finite-cut differences do not settle either direction. Either outcome remains conditional on the unrefereed manuscript, requires independent scrutiny of the whole catalog formulation before any solution claim, and leaves the status of Problem 416 unchanged.

Current review

Needs update. The coefficient reduction L65, the continuity result L43, the finite-prime reduction L44, the tail factorization L103, the finite-coefficient test with its grouped cofactor, cofactor fiber and rectangle-estimate interfaces, the sections on finite ranges and on the incomplete continuous model, and the stop verdict above are author-recorded and outside the scope of the existing review. The earlier route was independently reviewed on 2026-09-28 in the review record the Problem 417 review, whose subject is the Problem 417 section of the connections page together with this lead, and graded in the grade, which records this lead as reviewed. The graded verdicts of the statements the route rests on, in the review's numbering, are these. Lemma 417.1 (S1): refutation-failed, its three parts re-derived. Proposition 417.2 (S2): refutation-failed under (W), the order of magnitude V≍V′V\asymp V' that the finite upper endpoint needs, with the Problem 49 folder's Lemma 4.1 route as the alternative. Theorem 417.3 (S3): refutation-failed, the witness 5454 re-enumerated and the sum of VV along the scales re-derived under the derivative bound on its proved range. Proposition 417.4 (S4): refutation-failed as a conditional on (P1). The frame without a support bound (S6(a)), as this page states it: refutation-failed. The finite-range numbers (S7(a)): refutation-failed, every figure reproduced. This page's route, inputs, premises and gap (S8): refutation-failed, with its cross-reference to the Problem 49 connections page checked by the grader. Two sentences of the section that this page does not carry were refuted-as-stated: the support clause G(t)=1G(t)=1 for t≥2t\ge2 of the frame's hypothesis (S6(b); Ford's witness 218⋅2572^{18}\cdot257 at k=4k=4 gives a positive proportion of totients with least-preimage ratio above 22) and the sentence placing every element counted by V0(x)V_0(x) in (x/2,x](x/2,x] (S7(b); witness v=5888v=5888 with least preimage 1198511985 at x=11900x=11900). The grade's corrections C1, C2 and C3 were applied to the connections page (the range of the imported derivative bound, which no proof uses; the frame's hypothesis (H2) and its display, now without a support bound; and the confinement sentence), so its current text differs from the reviewed text at those places; no correction changes the reviewed assertions retained here. The premises (P1) and the distributional part of (P2) remain provisional. No tier is assigned by those reviews, and the problem's status is open.