Wiki
Wiki

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

Updated


For sufficiently large real xx, set

L=(log⁡x)10,D=exp⁡((log⁡2x)3),R=x1/(3log⁡2x).(1)L=(\log x)^{10},\qquad D=\exp((\log_2x)^3),\qquad R=x^{1/(3\log_2x)}. \tag{1}

Let E⊂[x]E\subset[x] consist of integers satisfying at least one condition:

  1. n≤x/Ln\le x/L.
  2. n∈N≤Rn\in\mathbb N_{\le R}.
  3. d2∣nd^2\mid n for some integer d>Ld>L.
  4. d∣nd\mid n for some d∈N≤Ld\in\mathbb N_{\le L} with d>Dd>D.
  5. n=dp2p1n=dp_2p_1, with d∈N≤Ld\in\mathbb N_{\le L} and R/L≤p2≤p1≤p2LR/L\le p_2\le p_1\le p_2L.
  6. n=dp3p2p1n=dp_3p_2p_1, with d∈Nd\in\mathbb N and R/L2≤p3≤p2≤p1≤p3L2R/L^2\le p_3\le p_2\le p_1\le p_3L^2.

Let A1⊂[x]A_1\subset[x] consist of n=dp>x/Ln=dp>x/L with d∈N≤Ld\in\mathbb N_{\le L}, d≤Dd\le D and pp prime. Let A2⊂[x]A_2\subset[x] consist of n=dpsn=dps with p>Lp>L prime, d∈N<pd\in\mathbb N_{<p} and ss a prime or product of two primes, all of whose prime factors exceed pLpL. Then

[x]⊂A1∪A2∪E.(2)[x]\subset A_1\cup A_2\cup E. \tag{2}

Proof. The scales obey

1<L<D1/log⁡L<D<elog⁡x<R<x.1<L<D^{1/\log L}<D<e^{\sqrt{\log x}}<R<x.

For example log⁡L=10log⁡2x\log L=10\log_2x, log⁡D=(log⁡2x)3\log D=(\log_2x)^3 and log⁡R=log⁡x/(3log⁡2x)\log R=\log x/(3\log_2x); each displayed inequality follows by comparing these expressions as x→∞x\to\infty. These comparisons also give x/(DL)>DAx/(DL)>D^A for each fixed AA, eventually.

Take n∉En\notin E. List its four largest prime factors, with multiplicity, as p1≥p2≥p3≥p4p_1\ge p_2\ge p_3\ge p_4, using the value one when the list ends. Then n>x/Ln>x/L and p1>Rp_1>R.

If p2≥p1/Lp_2\ge p_1/L, the inequality p3≥p2/Lp_3\ge p_2/L would give p3>R/L2p_3>R/L^2 and p1≤p3L2p_1\le p_3L^2, putting nn in class 6. Thus p3<p2/Lp_3<p_2/L. If p3≤Lp_3\le L, all remaining factors are at most LL, and p2≥p1/L>R/Lp_2\ge p_1/L>R/L would put nn in class 5. Consequently L<p3<p2/LL<p_3<p_2/L. Class 3 excludes p4=p3p_4=p_3. Taking p=p3p=p_3, s=p1p2s=p_1p_2 and d=n/(p1p2p3)d=n/(p_1p_2p_3) gives A2A_2.

If L<p2<p1/LL<p_2<p_1/L, class 3 excludes p3=p2p_3=p_2. Taking p=p2p=p_2, s=p1s=p_1 and d=n/(p1p2)d=n/(p_1p_2) again gives A2A_2, with p1>pLp_1>pL. Finally, if p2≤Lp_2\le L, then d=n/p1d=n/p_1 is LL-smooth. Class 4 forces d≤Dd\le D, giving A1A_1. These cases are exhaustive. □\square

Source precision. The published split uses p2>p1/Lp_2>p_1/L first and L<p2≤p1/LL<p_2\le p_1/L second. The equality case does not immediately imply the strict separator in A2A_2. The repartition above proves the same lemma with its original definitions, including real LL.

Source. Tao, published paper, published pp.800–802, scales (3.1)–(3.4) and Lemma 3.1. This page uses that published version.

Bears on. Problem 49.