Wiki
Wiki

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

Updated


Source. Lemma 4, printed p. 145 (PDF p. 3). Use hrh_r from the factor decomposition.

Statement. For every integer k≥3k\ge3, real x≥1x\ge1 and real Y≥1Y\ge1,

#{n≤x:hk(k+1)(n)≥Y}≤3xY1−2/k.\#\{n\le x:h_{k(k+1)}(n)\ge Y\} \le \frac{3x}{Y^{1-2/k}}.

In particular, taking Y=L(c,x)Y=L(c,x) with c>0c>0 and xx large gives Chen’s bound 3x/L(c(1−2/k),x)3x/L(c(1-2/k),x).

Complete proof

Put r=k(k+1)r=k(k+1) and

H={m≥1:m=hr(m)},S(t)=#(H∩[1,t]).\mathcal H=\{m\ge1:m=h_r(m)\},\qquad S(t)=\#(\mathcal H\cap[1,t]).

Every prime exponent α\alpha in m∈Hm\in\mathcal H exceeds k(k+1)k(k+1). Choose the unique v∈{1,…,k}v\in\{1,\ldots,k\} with v≡α(modk)v\equiv\alpha\pmod k. Then

u=α−v(k+1)ku=\frac{\alpha-v(k+1)}k

is a positive integer: its numerator is divisible by kk and positive because α>k(k+1)≥v(k+1)\alpha>k(k+1)\ge v(k+1). Hence α=uk+v(k+1)\alpha=uk+v(k+1). Applying this rule to each prime represents m=akbk+1m=a^k b^{k+1}. The empty product m=1m=1 corresponds to a=b=1a=b=1.

This deterministic choice maps distinct mm to distinct pairs (a,b)(a,b). For m≤tm\le t we have a≤t1/ka\le t^{1/k} and b≤t1/(k+1)b\le t^{1/(k+1)}, so

S(t)≤t1/k+1/(k+1)≤t2/k(t≥1).S(t)\le t^{1/k+1/(k+1)}\le t^{2/k}\qquad(t\ge1).

Every nn with hr(n)=mh_r(n)=m is divisible by mm. Therefore

#{n≤x:hr(n)≥Y}≤x∑m∈Hm≥Y1m.\#\{n\le x:h_r(n)\ge Y\} \le x\sum_{\substack{m\in\mathcal H\\m\ge Y}}\frac1m.

To include an atom at m=Ym=Y without a boundary convention, use 1/m=∫m∞t−2 dt1/m=\int_m^\infty t^{-2}\,dt and sum nonnegative integrands:

∑m∈Hm≥Y1m=∫Y∞#{m∈H:Y≤m≤t}t2 dt≤∫Y∞t2/k−2 dt=Y2/k−11−2/k≤3Y2/k−1.\sum_{\substack{m\in\mathcal H\\m\ge Y}}\frac1m =\int_Y^\infty \frac{\#\{m\in\mathcal H:Y\le m\le t\}}{t^2}\,dt \le\int_Y^\infty t^{2/k-2}\,dt =\frac{Y^{2/k-1}}{1-2/k}\le3Y^{2/k-1}.

This proves the statement. The construction and integral expand the two compressed steps in the source; the weak counting inequality also covers t=1t=1, where the printed strict comparison cannot hold.