T2: 2. Chebyshev's Estimates Flashcards
State the formula for the power of prime p in factorisation of n!
c_p(n) = SUM k=1,∞ ⌊n/p^k⌋
Give Chebyshev’s initial statement
π(x) ≍ x/log x
x/logx «_space;π(x) «_space;x/logx
for all x ≥ 2
State the Von-Mangoldt function
Λ(n) = { logp if n = p^k
0, otherwise
State the setup for partial summation
Given a sequence of complex numbers {a_n} n=1,∞
and a function f: [1,x] → C, cont diff for some x:
define A(y) = SUMn≤y a_n
State the partial summation formula
SUMn≤x a_n f(n) = A(x)f(x) - INT_1,x A(t)f’(t) dt
Give Chebyshev’s functions
π(x) = SUM_p≤x 1
θ(x) = SUM_p≤x logp
ψ(x) = SUM_n≤x Λ(n)
Give the relation between Chebyshev’s functions
ψ(x) ~ θ(x) ~ π(x)logx