Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
For sufficiently large real x, set
L=(logx)10,D=exp((log2x)3),R=x1/(3log2x).(1)
Let E⊂[x] consist of integers satisfying at least one condition:
n≤x/L.
n∈N≤R.
d2∣n for some integer d>L.
d∣n for some d∈N≤L with d>D.
n=dp2p1, with d∈N≤L and
R/L≤p2≤p1≤p2L.
n=dp3p2p1, with d∈N and
R/L2≤p3≤p2≤p1≤p3L2.
Let A1⊂[x] consist of n=dp>x/L with
d∈N≤L, d≤D and p prime. Let A2⊂[x]
consist of n=dps with p>L prime, d∈N<p and s a
prime or product of two primes, all of whose prime factors exceed pL.
Then
[x]⊂A1∪A2∪E.(2)
Proof. The scales obey
1<L<D1/logL<D<elogx<R<x.
For example logL=10log2x, logD=(log2x)3 and
logR=logx/(3log2x); each displayed inequality follows by
comparing these expressions as x→∞. These comparisons also
give x/(DL)>DA for each fixed A, eventually.
Take n∈/E. List its four largest prime factors, with
multiplicity, as p1≥p2≥p3≥p4, using the value one when
the list ends. Then n>x/L and p1>R.
If p2≥p1/L, the inequality p3≥p2/L would give
p3>R/L2 and p1≤p3L2, putting n in class 6.
Thus p3<p2/L. If p3≤L, all remaining factors are at most
L, and p2≥p1/L>R/L would put n in class 5.
Consequently L<p3<p2/L. Class 3 excludes p4=p3.
Taking p=p3, s=p1p2 and d=n/(p1p2p3) gives A2.
If L<p2<p1/L, class 3 excludes p3=p2. Taking p=p2,
s=p1 and d=n/(p1p2) again gives A2, with p1>pL.
Finally, if p2≤L, then d=n/p1 is L-smooth. Class 4
forces d≤D, giving A1. These cases are exhaustive. □
Source precision. The published split uses p2>p1/L first and
L<p2≤p1/L second. The equality case does not immediately imply
the strict separator in A2. The repartition above proves the same
lemma with its original definitions, including real L.
Source.Tao, published paper, published pp.800–802, scales (3.1)–(3.4) and Lemma 3.1. This page uses that published version.