4
votes
2answers
101 views

What does this $\asymp$ symbol mean? (subject: analytic number theory)

I'm reading a survey article by Andrew Granville on analytic number theory. On page 22 of the paper, there appears a strange looking symbol, undefined. I've circled it in red in the screenshot ...
2
votes
2answers
69 views

How to determine growth rate of coefficients of generating function

For a given ordinary generating function $f(x)=a_0+a_1x+...$, are there any methods to determine the growth rate of its coefficients based on that of $f$ ? In particular if we are given the extra ...
4
votes
1answer
123 views

Estimating integrals involving $\pi(x)$

While solving an exercise in analytic number theory, I ran into difficulty of estimating an integral of the form $\displaystyle\int_{1}^{x} \frac{\pi(t)}{t} dt$ where $\pi(x)$ is the prime counting ...
1
vote
1answer
56 views

asymptotic of a product

So the question that I'm working on is the following. Show that $\Pi_{p\leq z}(1-\dfrac{1}{p})=\dfrac{C(1+\mathcal{o}(1))}{\log z}$. First off I take logs and just work with the sum and thisis what ...
3
votes
1answer
97 views

Bound of the sum $\sum_{p\le n}\frac{1}{\log(p)}$

While doing a sum I came to the sum $\displaystyle\sum_{p\le n}\dfrac{1}{\log(p)}$. Where the $\log$ is the natural logarithm. It was easy to prove that $\displaystyle\sum_{p\le ...
2
votes
1answer
40 views

Asymptotics for $p$-series with $p=1/2$

Reading solutions to a practice exam, and I come across this: $$ O\left(\sum_{d \leq \sqrt{x}} {1 \over \sqrt{d}}\right) = O\left(x^{1/4}\right). $$ There are $O(\sqrt{x})$ terms in the sum, which ...
1
vote
0answers
39 views

How to prove that $\sum_{p \leq x} {\log p \over p} = \log x + O(1)$? [duplicate]

Problem Prove that $$ \sum_{p \leq x} {\log p \over p} = \log x + O(1) $$ as $x \to \infty$. Notes: $p$ ranges over primes, $\log$ is natural Progress Using Riemann-Stieltjes integration and ...
5
votes
1answer
146 views

How to prove this inequality $\pi(x) > \log x - 1$ involving the prime counting function?

Problem Prove that $\pi(x) > \log x - 1$. Progress Based on a hint and very elementary methods, I got that $$ \prod_{p \leq x} (1-p^{-1})^{-1} \leq \prod_{k=2}^{\pi(x)+1} (1-k^{-1})^{-1}. $$ The ...
4
votes
2answers
140 views

Asymptotic behavior of $\sum_{n>x} \frac{\log n}{n^2}$

There is a well-known question that seeks the asymptotic behaviour of this function, for $x\geq 2$: $$\sum_{n\leq x} \frac{\phi(n)}{n^2}.$$ See, for example, Apostol "Introduction to Analytic Number ...
4
votes
1answer
91 views

Bernoulli number type asymptotics

I find an interesting formula but I can not prove it. Show that $$I_n=(-1)^{n+1}\int_0^1 B_{2n+1}(x)\cot(\pi x) \, dx\sim\frac{2(2n+1)!}{(2\pi)^{2n+1}}$$ where $B_n(x)$ is the Bernoulli Polynomials.
2
votes
3answers
124 views

Bernoulli numbers: comparison to factorials

I am trying to understand the behaviour of the Bernoulli numbers with respect to factorials, specifically I'd like to know whether it is true that, for all $n \in N$ with $n \ge 2$ we have $$ ...
6
votes
1answer
66 views

Are there asymptotically more nonabelian groups of order $p^k$ than there are abelian groups of order $\leq p^k$?

Let $\alpha(n)$ denote the number of isomorphism classes of abelian groups of order $n$ and $\alpha^\prime(n)=\sum_{m=1}^n\alpha(m)$. Similarly, define $f(p^k)$ to be the number of isomorphism ...
2
votes
1answer
139 views

Asymptotics for the divisor function

I am attempting to understand Tao's post of 23 September 2008 given here concerning the divisor bound. My troubles are when he uses the big-O notation in proving what he lists as bound (4) $$ d(n) ...
7
votes
5answers
427 views

The asymptotic expansion for the weighted sum of divisors $\sum_{n\leq x} \frac{d(n)}{n}$

I am trying to solve a problem about the divisor function. Let us call $d(n)$ the classical divisor function, i.e. $d(n)=\sum_{d|n}$ is the number of divisors of the integer $n$. It is well known that ...
3
votes
2answers
107 views

Order of a function related to divisors

Let $f(n)=\max(\{d(ab):\ a,b\le n\})$ where $d(m)$ is the number of divisors of $m.$ What is the order of $f$? In particular I'm looking for an asymptotic upper bound.
8
votes
2answers
214 views

Approximation of $\mathrm{Li}(x) = \int\limits_{0}^x \frac{dt}{\ln t}$ [duplicate]

I am reading about the Riemann hypothesis, and the article mentioned the Li function: $$\mathrm{Li}(x) = \int\limits_{0}^x \frac{dt}{\ln t}$$ They said that this function can be approximated: ...
4
votes
2answers
345 views

Using sum of logarithms of primes to prove the number of primes up to $n$ is $O(n/\log n)$

I need to show that the number of primes up to $n$ (i.e. $\pi(n)$) is $O(n/\log n)$. In the previous exercise of this question I proved that ${\displaystyle \sum_{i=1}^{\pi(n)}\log p_{i}} \leq Cn$ for ...
2
votes
1answer
47 views

A number-theoretical estimation-inequality

I have some trouble understanding the following number-theoretical estimation: $$\sum_{k\le \sqrt{n}} (1-k^2/n)^{1+o_n(1)}=n^{1/2+o(1)} \ (n\to\infty),$$ where $o_n(1)$ denotes a $o(1)$ function ...
4
votes
3answers
245 views

Number of representable as sum of 2 squares

How to find asymptotically (or some reasonable bound, at least $ o(n) $) number of numbers, representable as a sum of squares of 2 numbers? (in case of bound I am interested in both: lower and upper ...
8
votes
1answer
134 views

Comparing average values of an arithmetic function

Suppose $f(n)$ is a positive real-valued arithmetic function such that $$ \frac1n\sum_{k=1}^nf(k)\sim g(n) $$ for $g(x)$ a monotonic increasing function. What can be said about the asymptotic behavior ...
1
vote
0answers
51 views

Asymptotic bounds: $\ll$ vs. $\ll_{\epsilon}$?

I am feeling a bit slow today. In Analytic Number Theory it is usual to express asymptotic bounds by specifying the relation of the constant to a specific variable, i.e. $\log n \ll_\epsilon ...
1
vote
3answers
272 views

Asymptotic formula for the logarithm of the hyperfactorial

Background: I was trying to derive an asymptotic formula for the following: $$\sum_{m\leqslant n}\sum_{k\leqslant m}(m\ \mathrm{mod}\ k),$$ which I think I succeeded in doing (I will skip some steps ...
3
votes
0answers
92 views

Products of primes of the form $an + b$

What is the asymptotic order of numbers divisible by no primes except those of the form $an+b$ ($a$, $b$ fixed)? Surely (except for the trivial cases) they are of order strictly between that of he ...
4
votes
1answer
285 views

Evaluating a limit of the truncated exponential series motivated by the prime number theorem for $k$ distinct prime factors.

If $\pi_k(n)$ is the cardinality of numbers with k factors (repetitions included) less than or equal n, the generalized Prime Number Theorem is: $$\pi_k(n)\sim \frac{n}{\ln n} \frac{(\ln \ln ...
4
votes
1answer
104 views

Showing that the analytic definition of the Euler Constant is $O(n^{-1})$ [duplicate]

Possible Duplicate: Euler's Constant: The asymptotic behavior of $\left(\sum\limits_{j=1}^{N} \frac{1}{j}\right) - \log(N)$ I'm stumped by this one exercise. The question is to "Prove ...
2
votes
1answer
653 views

Proof of Chebyshev's theorem

(a) Show that $\int_2^x\frac{\pi(t)}{t^2}dt=\sum_{p\leq x }\frac{1}{p}+o(1)\sim\log\log x.$ (b) Let $\rho(x)$ be the ratio of the two functions involved in the prime number theorem: ...
8
votes
1answer
177 views

Mean Value of a Multiplicative Function close to $n$ in Terms of the Zeta Function.

Let $f(n)$ be a multiplicative function defined by $f(p^a)=p^{a-1}(p+1)$, where $p$ is a prime number. How could I obtain a formula for $$\sum_{n\leq x} f(n)$$ with error term $O(x\log{x})$ and ...
13
votes
4answers
360 views

Asymptotic formula for $\sum_{n \le x} \frac{\varphi(n)}{n^2}$

Here is yet another problem I can't seem to do by myself... I am supposed to prove that $$\sum_{n \le x} \frac{\varphi(n)}{n^2}=\frac{\log x}{\zeta(2)}+\frac{\gamma}{\zeta(2)}-A+O \left(\frac{\log ...
2
votes
1answer
168 views

Asymptotic formula of $\sum_{n \le x} \frac{d(n)}{n^a}$

As the title says, I'm trying to prove $$\sum_{n \le x} \frac{d(n)}{n^a}= \frac{x^{1-a} \log x}{1-a} + \zeta(a)^2+O(x^{1-a}),$$ for $x \ge 2$ and $a>0,a \ne 1$, where $d(n)$ is the number of ...
9
votes
3answers
542 views

Equivalence to the prime number theorem

I was just reading this question and answer: How will this equation imply PNT and it raised a whole new question: Given that $\sum_{n\le x} \Lambda(n)=x+o(x)$, prove that $$\sum_{n\le x} ...
9
votes
1answer
227 views

Analytic number theory primer — sequences and series

For a book like Titchmarsh, or Iwaniec and Kowalski, it seems a thorough knowledge of asymptotics is a prerequisite. What are good books for training oneself in such manipulation of asymptotics, ...
5
votes
1answer
133 views

An estimate of a series

Suppose $s$ is not an integer, let $\lambda(s)=\min_{n≥0}|s+n|$. Show that $\sum\limits_{n=1}^{\infty}(\frac{1}{n+s}-\frac{1}{n})\ll\frac{1}{\lambda(s)}+\log(|s|+2)$.
8
votes
1answer
246 views

How do I prove $\sum_{n \leq x} \frac{\mu (n)}{n} \log^2{\frac{x}{n}}=2\log{x}+O(1)$? Can I use Abel summation?

I am wondering if it is possible to solve this problem using Abel summation: $$\sum_{n \leq x} \frac{\mu (n)}{n} \log^2{\frac{x}{n}}=2\log{x}+O(1)$$ Or maybe I am on the wrong track?
27
votes
3answers
529 views

Sequence of numbers with prime factorization $pq^2$

I've been considering the sequence of natural numbers with prime factorization $pq^2$, $p\neq q$; it begins 12, 18, 20, 28, 44, 45, ... and is A054753 in OEIS. I have two questions: What is the ...
7
votes
2answers
130 views

Why is $G(k)$ “more fundamental” than the Hilbert-Waring function $g(k)$?

In the Wikipedia entry for Waring's problem, the section on $G(k)$ starts as: “From the work of Hardy and Littlewood, more fundamental than $g(k)$ turned out to be $G(k)$, which is defined...” There ...
25
votes
1answer
852 views

How does $ \sum_{p<x} p^{-s} $ grow asymptotically for $ \text{Re}(s) < 1 $?

Note the $ p < x $ in the sum stands for all primes less than $ x $. I know that for $ s=1 $, $$ \sum_{p<x} \frac{1}{p} \sim \ln \ln x , $$ and for $ \mathrm{Re}(s) > 1 $, the partial sums ...
0
votes
1answer
132 views

Does $f \sim g$ imply $f \asymp g$ in certain conditions?

I got a good answer to this question over on MathOverflow a while ago. Harald Hanche-Olsen claimed that, if $f, g: D\to \mathbb{R}^+$, then $$ f(x) \sim g(x) \implies f(x) \asymp g(x) \qquad \qquad ...
10
votes
5answers
594 views

Bounding the integral $\int_{2}^{x} \frac{\mathrm dt}{\log^{n}{t}}$

If $x \geq 2$, then how do we prove that $$\int_{2}^{x} \frac{\mathrm dt}{\log^{n}{t}} = O\Bigl(\frac{x}{\log^{n}{x}}\Bigr)?$$