Notation: n ∼ x if x < n ≤ 2x
Counting twin primes
where
Y
m= p, a = n(n + 2).
√
p≤ 2x
Mobius inversion:
X
1(a,m)=1 = µ(d)
d|(a,m)
gives a formula
#{n ∼ x : n, n + 2 prime }
X X
= µ(d),
n∼x d|(a,m)
X X
= µ(d) 1
d|m n∼x
n(n+2)≡0 (mod d)
√
m = p≤√2x p ≈ e 2x , problems arise when d is big.
Q
want to find a strong correlation:
X
1(a,m)=1 ≈ ρd , ρd = 0, if d > D = xθ
d|(a,m),d≤D
Combinatorial sieve:
ρd = µ(d)1d∈D , d = p1 . . . pr
Selberg’s sieve :
2
X
1(a,m)=1 ≤ λd , λ1 = 1, λd = 0, if d > R, D = R2
d|(a,m)
1
2 SIEVE WEIGHTS AND THEIR SMOOTHINGS
2
X X
#{n ∼ x : n, n + 2 prime } ≤ λd
n∼x d|(a,m)
X X
= λd1 λd2 1
d1 ,d2 n∼x
d=[d1 ,d2 ] n(n+2)≡0 (mod d)
X ρ(d)
= λd1 λd2 s + O(ρ(d)) ,
d1 ,d2 ≤R
d
c2 x
#{n ∼ x : n, n + 2 prime } ≤ (8 + o(1)) ,
log2 x
need
k
log(R/d)
λd ≈ cµ(d) 1d≤R
R
General
X log d
Mf (n; R) = µ(d)f
log R
d|n
X
M(n; R) = µ(d)
d|n
SIEVE WEIGHTS AND THEIR SMOOTHINGS 3
If n = 2m, 2 - m,
X
M(n; R) = µ(d)
d|n
X X
= µ(d) + µ(2d)
d|m d|m
d≤R d≤R/2
X
= µ(d)
d|m
R/2<d≤R
while
x
#{n ≤ x : p | n =⇒ p > R} ≈
log R
If f ∈ C 1 (R), n = pv m, p - m, then
X
X log d log(dp)
Mf (n; R) = µ(d)f − µ(d)f
log R log R
d|m d|m
Z log p
log R X
0 log d
=− µ(d)f u + du
0 log R
d|m
If f ∈ C A (R) and n = pv11 · · · pvAA m, (pj is the j-th smallest prime factor
of n),
Z log p1 Z log pA X
A
log R log R log d
Mf (n; R) = (−1) ··· µ(d)f u1 + · · · + uA + du
0 0 log R
d|m
log p1 log pA
. ··· M (A) (m; R)
log R log R f
If n is typical, then
Mf (A) (m; R)
Mf (n; R) .
(log R)A
4 SIEVE WEIGHTS AND THEIR SMOOTHINGS
(soft) Conjecture:
( )
2k
P
x m≤x M(n; R)
X
Mf (n; R)2k . max , .
n≤x
log R (log R)2k
↑ ↑
almost primes typical integers
Conjecture :
X
M(n; R) ∼ ck x(log R)Ek
n≤x
Ek
need Ek − 2kA < 0 ⇔ A > 2k
for Mf (n; R)2k to behave like a sieve
weight.
Two questions:
1. Ek =?
2. Is (soft) conjecture true?
For the second question, we have
X
2k 3/2 x 2
Mf (n; , R) α , x ≥ R ≥ α, 1 ≥ α ≥
n≤x
log R log R
∃p|n,p≤Rα
X x
Mf (n; R)2k ∼ ck,f x ≥ R2k log2 R, R → ∞
,
n≤x
log R
Ek
b) If A ≤ 2k
+ 1, then
X
Mf (n; R)2k x(log R)Ek −2k(A−1)
n≤x
2k
X µ(d1 ) · · · µ(d2k ) Y R si
Z Z
2k+ x
x≥R ∼ ··· ds
(2πi)2k <(s1 )= log1 R <(s2k )= log1 R d ,...,d
[d1 , . . . , d2k ] i=1 si dsi i
1 2k
2k Q
R si I even6=∅ ζ(1 + sI )
X µ(d1 ) · · · µ(d2k ) Y
si = F (s) Q
d ,...,d
[d1 , . . . , d2k ] i=1 si di I odd ζ(1 + sI )
1 2k