Wiki
Wiki

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

Updated

Structured residues


The following are proved special cases. They do not cover arbitrary moving residues. Throughout, δ\delta is the decreasing limit of the densities of the original finite delayed survivor systems.

We use the multiples theorem and finite-periodic logarithmic approximation: for V⊂NV\subset\mathbb N and finite V0↑VV_0\uparrow V,

ld⁡(M(V)∖M(V0))=ld⁡(M(V))−d(M(V0))⟶0.(1)\operatorname{ld}(M(V)\setminus M(V_0)) =\operatorname{ld}(M(V))-d(M(V_0))\longrightarrow0. \tag{1}

The relevant Davenport–Erdős 1951 source passage, equations (2), (4), and (8)–(12), was checked. Alternatively, (1) follows from the self-contained association proof in basic reductions.

Finite rational slopes with integer translations

Theorem. Suppose each original congruence belongs to one of finitely many fixed patterns

ni=dqi,ai≡b+cqi(moddqi),n_i=dq_i,\qquad a_i\equiv b+cq_i\pmod{dq_i},

where the triples (b,c,d)(b,c,d) are fixed integers with d≥1d\ge1 and 0≤c<d0\le c<d. Then ld⁡(A)=δ\operatorname{ld}(A)=\delta. In particular, this holds when the normalized ratios ai/nia_i/n_i belong to a fixed finite subset of Q∩[0,1)\mathbb Q\cap[0,1).

Proof. Fix a triple. Write uniquely q=svq=sv, where every prime factor of ss divides dd, and (v,d)=1(v,d)=1. Partition further by ss and r=v(modd)r=v\pmod d. Let VV be the set of vv in one such group, and define its actual delayed union

TV=⋃v∈V{n≥dsv:n≡b+csv(moddsv)}.T_V=\bigcup_{v\in V} \{n\ge dsv:n\equiv b+csv\pmod{dsv}\}.

Apart from the finitely many n≤bn\le b, its full congruence union is

FV={b+sz:z∈M(V), z≡cr(modd)}.F_V=\{b+sz:z\in M(V),\ z\equiv cr\pmod d\}.

Indeed, for v∣zv\mid z with v≡r(modd)v\equiv r\pmod d, the congruence z≡cr(modd)z\equiv cr\pmod d is equivalent to z/v≡c(modd)z/v\equiv c\pmod d. For finite V0⊂VV_0\subset V, all its original congruences are active once n>dsmax⁡V0n>d s\max V_0. Therefore, up to finitely many exceptions,

TV∖TV0⊆{b+sz:z∈M(V)∖M(V0)}.T_V\setminus T_{V_0} \subseteq\{b+sz:z\in M(V)\setminus M(V_0)\}.

For fixed b,sb,s, summing the absolutely summable difference 1/(b+sz)−1/(sz)=Ob,s(z−2)1/(b+sz)-1/(sz)=O_{b,s}(z^{-2}) shows that a positive affine image of a set with logarithmic density ρ\rho has logarithmic density ρ/s\rho/s. Thus (1) makes the last tail arbitrarily small in upper logarithmic density.

There are infinitely many possible ss, but their omitted groups have a uniform natural-density bound. Each deleted integer in an ss-group satisfies n≡b(mods)n\equiv b\pmod s and n≥dsv≥sn\ge dsv\ge s. Consequently

∣[1,X]∩⋃s>YTs∣≤2X∑s>Yp∣s⇒p∣d1s.\left|[1,X]\cap\bigcup_{s>Y}T_s\right| \le 2X\sum_{\substack{s>Y\\p\mid s\Rightarrow p\mid d}}\frac1s.

The series over these smooth ss converges, with total ∏p∣d(1−1/p)−1\prod_{p\mid d}(1-1/p)^{-1}. First truncate ss, then finitely approximate each remaining (s,r)(s,r)-group, and finally take the finite union over the original triples. The omitted deletion set then has arbitrarily small upper logarithmic density. An original initial segment contains every chosen finite collection, so

lim⁡k→∞ld⁡‾(A(k)∖A)=0.\lim_{k\to\infty} \overline{\operatorname{ld}}(A^{(k)}\setminus A)=0.

Finite periodic recovery proves the theorem. □\square

Finite fixed rational translates

Theorem. Suppose finitely many fixed pairs $(b_j,c_j)\in\mathbb Z\times \mathbb N$ are given, and each modulus nin_i has an assigned pair satisfying

(cj,ni)=1,cjai≡bj(modni).(c_j,n_i)=1,\qquad c_j a_i\equiv b_j\pmod{n_i}.

Then ld⁡(A)=δ\operatorname{ld}(A)=\delta.

Proof. First, a primitive set PP has logarithmic density zero: its tail is contained in M(P)∖M(P∩[1,K])M(P)\setminus M(P\cap[1,K]), whose logarithmic density tends to zero by (1).

Fix one pair (b,c)(b,c) and its modulus set DD. Put

C={n≥1:cn−b>0, cn−b∈M(D)}.C=\{n\ge1:cn-b>0,\ cn-b\in M(D)\}.

For a finite initial part DKD_K, define CKC_K likewise. Substitution t=cn−bt=cn-b gives

ld⁡‾(C∖CK)≤c ld⁡(M(D)∖M(DK))⟶0.\overline{\operatorname{ld}}(C\setminus C_K) \le c\,\operatorname{ld}(M(D)\setminus M(D_K))\longrightarrow0.

Here one can use c/(t+b)=c/t+Ob,c(t−2)c/(t+b)=c/t+O_{b,c}(t^{-2}) and bound the sum over its single congruence class of tt by the unrestricted positive sum. Hence CC has finite-periodic logarithmic approximation.

Let PP be the minimal generators of DD under divisibility. Then PP is primitive and M(P)=M(D)M(P)=M(D). If n∈Cn\in C is not deleted by any active modulus, choose p∈Pp\in P dividing cn−bcn-b. Necessarily p>np>n. Writing cn−b=ℓpcn-b=\ell p gives 1≤ℓ<c+∣b∣/n1\le\ell<c+|b|/n, so all sufficiently large such exceptions belong to a finite union of affine images

{(ℓp+b)/c:p∈P}∩N.\{(\ell p+b)/c:p\in P\}\cap\mathbb N.

Each has logarithmic density zero. The actual delayed union is contained in CC outside the finitely many nn with cn−b≤0cn-b\le0, and the reverse inclusion fails only on the null exceptional set just bounded. Finite unions preserve both conclusions. Finite truncations have the same eventual periodic densities as the corresponding CKC_K, so the limiting survivor density is δ\delta. □\square

Rational congruence patterns without coprimality

Theorem. Fix finitely many pairs (Cj,vj)∈Z×N(C_j,v_j)\in\mathbb Z\times\mathbb N. Suppose each modulus qiq_i is assigned a pair satisfying

vjai≡Cj(modqi).(2)v_j a_i\equiv C_j\pmod{q_i}. \tag{2}

No assumption on (vj,qi)(v_j,q_i) is needed. The delayed union has finite-periodic approximation in upper logarithmic density, and the survivor set has logarithmic density δ\delta.

This strengthens the preceding rational-translate theorem and subsumes the finite rational-slope theorem. It results from checking the affine endpoint argument in Section 8 of the independent input.

Proof. Fix (C,v)(C,v). Write q=hrq=hr, where every prime factor of hh divides vv and (r,v)=1(r,v)=1. Partition further by the normalized residue t=aq mod ht=a_q\bmod h, 0≤t<h0\le t<h. Necessarily vt≡C(modh)vt\equiv C\pmod h, so for each hh there are at most (v,h)≤v(v,h)\le v possible tt.

For fixed (h,t)(h,t), write aq=t+hAqa_q=t+hA_q, with 0≤Aq<r0\le A_q<r. The substitution n=t+hmn=t+hm identifies the exclusions exactly with

m≥r,m≡Aq(modr),vAq≡(C−vt)/h(modr).m\ge r,\qquad m\equiv A_q\pmod r, \qquad vA_q\equiv (C-vt)/h\pmod r.

Activation is exact because 0≤t<h0\le t<h. The quotient moduli rr are distinct in this group, and are coprime to vv. Thus the preceding rational-translate theorem gives finite-periodic logarithmic approximation for the group. Its positive affine image retains that property.

The groups with h>Yh>Y have a uniform counting bound. Each deleted integer in such a group satisfies n≥q≥hn\ge q\ge h and n≡t(modh)n\equiv t\pmod h, so there are at most X/hX/h hits below XX for each possible tt. Hence

∣Bh>Y∩[1,X]∣≤vX∑h>Yp∣h⇒p∣v1h.|B_{h>Y}\cap[1,X]| \le vX\sum_{\substack{h>Y\\p\mid h\Rightarrow p\mid v}}\frac1h.

The sum tends to zero, being a tail of the finite Euler product ∏p∣v(1−1/p)−1\prod_{p\mid v}(1-1/p)^{-1}. First truncate hh, then finitely approximate the remaining groups. A finite union over the pairs (Cj,vj)(C_j,v_j) proves the assertion. □\square

Consequence for affine endpoints

Suppose qiq_i increase, qi≤bi<2qiq_i\le b_i<2q_i, and bj≢bi(modqi)b_j\not\equiv b_i\pmod{q_i} for j>ij>i. If the pairs (qi,bi)(q_i,b_i) lie in finitely many fixed rational affine relations

vbi=uqi+c(u,v∈N, c∈Z),vb_i=uq_i+c\qquad(u,v\in\mathbb N,\ c\in\mathbb Z),

then E={bi}E=\{b_i\} has logarithmic density zero.

For one relation put ai=bi−qia_i=b_i-q_i. Then vai≡c(modqi)va_i\equiv c\pmod{q_i}, so (2) applies to its delayed union BB. Every endpoint is in BB, whereas every fixed finite prefix BFB_F meets EE in only finitely many points by the avoidance condition. Finite-periodic approximation gives

ld⁡‾(E)≤ld⁡‾(B∖BF)⟶0.\overline{\operatorname{ld}}(E) \le\overline{\operatorname{ld}}(B\setminus B_F)\longrightarrow0.

Take the finite union of the relation-subsequences. This verifies the independent note's special case, including bounded choices of bi−qib_i-q_i or 2qi−bi2q_i-b_i, but not arbitrary or approximately affine endpoints.

Stability under multipliers congruent to one

The abstract lemma in Section 8.6 of the second independent record is valid. Its application to bounded residue orders is already covered by (2), but the following formulation also permits nonperiodic sets.

Theorem. Fix M≥1M\ge1 and put SM={k≥1:k≡1(modM)}S_M=\{k\ge1:k\equiv1\pmod M\}. Suppose E⊆NE\subseteq\mathbb N satisfies

n∈E, k∈SM⟹nk∈E.(3)n\in E,\ k\in S_M\quad\Longrightarrow\quad nk\in E. \tag{3}

Then EE can be approximated from within, in upper logarithmic density, by finite unions of rays nSMnS_M with n∈En\in E. In particular EE has logarithmic density. No natural-density conclusion is asserted.

Proof. Let DM\mathcal D_M consist of the positive integers supported on primes dividing MM, including 11. Write each integer uniquely as dudu, with d∈DMd\in\mathcal D_M and (u,M)=1(u,M)=1. For a fixed dd and a unit residue r(modM)r\pmod M, put

Td,r={u≥1:u≡r(modM), du∈E},Wd,r=M(Td,r).T_{d,r}=\{u\ge1:u\equiv r\pmod M,\ du\in E\}, \qquad W_{d,r}=M(T_{d,r}).

Then

Td,r=Wd,r∩[r]M.(4)T_{d,r}=W_{d,r}\cap[r]_M. \tag{4}

Indeed, if u=vku=vk, with v∈Td,rv\in T_{d,r} and u≡r(modM)u\equiv r\pmod M, invertibility of rr gives k≡1(modM)k\equiv1\pmod M, so (3) applies. The reverse inclusion in (4) is the only nontrivial one.

By the multiples approximation (1), choose finite G⊂Td,rG\subset T_{d,r} so that Wd,r∖M(G)W_{d,r}\setminus M(G) has arbitrarily small logarithmic density. Intersecting with [r]M[r]_M can only decrease its harmonic mass, and

M(G)∩[r]M=⋃v∈GvSM.M(G)\cap[r]_M=\bigcup_{v\in G}vS_M.

After dilation by dd, this gives the required approximation in one stratum: dilation divides upper logarithmic density by dd.

The unretained strata with d>Yd>Y have harmonic mass at most

H⌊X⌋∑d∈DMd>Y1d.H_{\lfloor X\rfloor} \sum_{\substack{d\in\mathcal D_M\\d>Y}}\frac1d.

This tail tends to zero after normalization, since

∑d∈DM1d=∏p∣M(1−1/p)−1<∞.\sum_{d\in\mathcal D_M}\frac1d =\prod_{p\mid M}(1-1/p)^{-1}<\infty.

There are finitely many remaining (d,r)(d,r)-strata. Approximate each by finitely many rays, then take their union. Every ray is eventually periodic, so these approximations squeeze the upper and lower logarithmic densities of EE to the same value. For M=1M=1, take the single stratum d=1d=1; this recovers the multiples theorem. □\square

Congruence consequence. Suppose qi∣Maiq_i\mid Ma_i for a fixed MM. More generally than in Problem 25, allow repeated moduli and any finite activation thresholds TiT_i, and set

Bi={n≥1:n≥Ti, n≡ai(modqi)}.B_i=\{n\ge1:n\ge T_i,\ n\equiv a_i\pmod{q_i}\}.

Each BiB_i satisfies (3): multiplication by k≡1(modM)k\equiv1\pmod M preserves its congruence and cannot move a positive integer below its threshold. Hence B=⋃iBiB=\bigcup_iB_i has the ray approximations above. For each selected ray nSMnS_M, choose one original BiB_i containing nn. That entire ray lies in BiB_i, so any finite ray approximation is contained in a finite original prefix. The prefixes therefore approximate BB in upper logarithmic density. Its density equals their limiting periodic density.

For the original activation, this is not a new positive regime: qi∣Maiq_i\mid Ma_i is (2) with (C,v)=(0,M)(C,v)=(0,M), or equivalently ai/qi∈{0,1/M,…,(M−1)/M}a_i/q_i\in\{0,1/M,\ldots,(M-1)/M\} for normalized residues. Likewise Section 8.5's bounded representatives are already covered by the finitely many pairs (C,v)=(a,1)(C,v)=(a,1). The multiplier theorem supplies an alternative structural proof, not a resolution for arbitrary residues.

Coherent profinite residues: only a partial reduction

If all residues come from one α∈Z^\alpha\in\widehat{\mathbb Z}, any modulus that is a multiple of an earlier modulus is redundant, even with delayed activation. Thus the modulus set may be replaced by its primitive core. Its logarithmic density is zero by (1). For each fixed KK, the union of its first KK activated hits per modulus has harmonic mass at most HK∑q≤X, q∈P1/q=o(log⁡X)H_K\sum_{q\le X,\ q\in P}1/q=o(\log X). This controls bounded quotients only; it does not prove the full coherent case.

The later coherent power-cutoff estimate controls conditioned tails with q≤n1−ηq\le n^{1-\eta} for every fixed η>0\eta>0. It proves natural density under power-delayed activation, and under the original activation when the primitive core has counting function O(t/log⁡t)O(t/\log t). Unrestricted coherent residues remain unresolved; the possible excess is confined to unbounded but subpower quotients.

One cannot simply remove activation for a general profinite α\alpha. Choose increasing primes pm>mp_m>m with ∑m1/pm<ε\sum_m1/p_m<\varepsilon, and prescribe α≡m(modpm)\alpha\equiv m\pmod{p_m} by CRT. The fully active integer trace contains every positive integer. The delayed union instead has natural density 1−∏m(1−1/pm)≤ε1-\prod_m(1-1/p_m)\le\varepsilon, by the summable case.