Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Write and for real . For an arithmetic function and finite , put
The maximum exists, including . Write , and omit the subscript for . Here and
Every product over an empty prime support is one. Throughout, denotes a prime, is natural logarithm, and . An or constant is absolute unless a dependence is displayed. All asymptotic arguments first take sufficiently large; an all- conclusion includes an explicit bounded-range absorption.
The sets and contain positive integers all of whose prime factors are respectively at most and less than ; both contain one. An almost prime in this source means a prime or the product of two primes, allowing repetition.
Exact external analytic inputs. The classical prime number theorem in the form used here states that some absolute satisfy
We also use the classical Mertens estimates, uniformly for ,
Their analytic proofs are external. The interval and smooth-number consequences actually needed are proved in Lemma 1.5, Lemma 1.6 and Lemma 1.7. Elementary partial summation and repeated integration by parts in (1) also give
For completeness, integrating by parts twice gives these first two terms and a remainder . Split that integral at to bound it by ; the exponential error in (1) is smaller than that remainder.
Source precision. The published opening definition refers to the selected subset, correcting the phrase “both in ” (arXiv v4 p.1). The main theorem concerns weak monotonicity. The strict question in Problem 49 is related by the separate strict transfer.
Source. Tao, published paper, published pp.793–799, Section 1.1 and Lemmas 1.5–1.7. This page uses that published version.
Bears on. Problem 49.