Questions on the use of the methods of real/complex analysis in the study of number theory.

learn more… | top users | synonyms

34
votes
1answer
1k 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 ...
10
votes
1answer
3k views

Sum of reciprocal prime numbers

How can the following equation be proven? $$ \forall n > 2 : \sum_{p \le n}{\frac1{p}} = C + \ln\ln n + O\left(\frac1{\ln n}\right), $$ where $p$ is a prime number. It's not homework; I just ...
13
votes
2answers
1k views

How to show that the Laurent series of the Riemann Zeta function has $\gamma$ as its constant term?

I mean the Laurent series at $s=1$. I want to do it by proving $\displaystyle \int_0^\infty \frac{2t}{(t^2+1)(e^{\pi t}+1)} dt = \ln 2 - \gamma$, based on the integral formula given in Wikipedia. ...
17
votes
3answers
1k views

How to prove Chebyshev's result: $\sum_{p\leq n} \frac{\log p}{p} \sim\log n $ as $n\to\infty$?

I saw reference to this result of Chebyshev's: $$\sum_{p\leq n} \frac{\log p}{p} \sim \log n \text{ as }n \to \infty,$$ and its relation to the Prime Number Theorem. I'm looking into an ...
12
votes
3answers
426 views

Are there any Combinatoric proofs of Bertrand's postulate?

I feel like there must exist a combinatoric proof of a theorem like: There is a prime between $n$ and $2n$, or $p$ and $p^2$ or anything similar to this stronger than there is a prime between $p$ and ...
7
votes
2answers
769 views

Asymptotic formula for $\sum_{n\leq x}\mu(n)[x/n]^2$ and the Totient summatory function $\sum_{n\leq x} \phi(n)$

I would like to show (for $x \ge 2$) that $$\sum_{n \le x}\mu(n)\left[\frac{x}{n}\right]^2 = \frac{x^2}{\zeta(2)} + O(x \log(x)).$$ I already have the identity $$\sum_{n \le ...
42
votes
5answers
4k views

What is so interesting about the zeroes of the Riemann $\zeta$ function?

The Riemann $\zeta$ function plays a significant role in number theory and is defined by $$\zeta(s) = \sum_{n=0}^\infty \frac{1}{n^s} \qquad \text{ for } s > 1 \text{ and } s= \sigma + it$$ The ...
28
votes
6answers
2k views

A closed form for the sum $\sum_{n=1}^{\infty}\left(\frac{H_n}{n}\right)^2$

How can I find a closed form for the following sum? $$\sum_{n=1}^{\infty}\left(\frac{H_n}{n}\right)^2$$ ($H_n=\sum_{k=1}^n\frac{1}{k}$).
12
votes
3answers
726 views

On the mean value of a multiplicative function: Prove that $\sum\limits_{n\leq x} \frac{n}{\phi(n)} =O(x) $

There is a second part of the problem posted in Proving $ \frac{\sigma(n)}{n} < \frac{n}{\varphi(n)} < \frac{\pi^{2}}{6} \frac{\sigma(n)}{n}$, from Apostol's book, but I can't figure it out. It ...
10
votes
5answers
808 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)?$$
11
votes
3answers
1k views

Lower bound for $\phi(n)$: Is $n/5 < \phi (n) < n$ for all $n > 1$?

Is it true that : $\frac {n}{5} < \phi (n) < n$ for all $n > 1$ where $\phi (n)$ is Euler's totient function . Since $\phi(n)$ has maximum value when $n$ is a prime it follows that ...
24
votes
4answers
3k views

Riemann zeta function at odd positive integers

Starting with the famous Basel problem, Euler evaluated the Riemann zeta function for all even positive integers and the result is a compact expression involving Bernoulli numbers. However, the ...
27
votes
3answers
2k views

Ramanujan's First Letter to Hardy and the Number of $3$-Smooth Integers

A positive integer is $B$-smooth if and only if all of its prime divisors are less than or equal to a positive real $B$. For example, the $3$-smooth integers are of the form $2^{a} 3^{b}$ with ...
8
votes
1answer
1k views

Effective Upper Bound for the Number of Prime Divisors

Let $\omega(n) = \sum_{p \mid n} 1$. Robin proves for $n > 2$, \begin{align} \omega(n) < \frac{\log n}{\log \log n} + 1.4573 \frac{\log n}{(\log \log n)^{2}}. \end{align} Is there a similar ...
8
votes
1answer
345 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 ...
4
votes
3answers
623 views

Does the correctness of Riemann's Hypothesis imply a better bound on $\sum \limits_{p<x}p^{-s}$?

This is follow up question on this: How does $ \sum_{p<x} p^{-s} $ grow asymptotically for $ \mathrm{Re}(s) < 1 $? There it is stated that: $$ \sum_{p\leq x}p^{-s}= \mathrm{li}(x^{1-s}) + ...
22
votes
3answers
1k views

On Dirichlet series and critical strips

(I'll keep this one short) Given a Dirichlet series $$g(s)=\sum_{k=1}^\infty\frac{c_k}{k^s}$$ where $c_k\in\mathbb R$ and $c_k \neq 0$ (i.e., the coefficients are a sequence of arbitrary nonzero ...
10
votes
2answers
386 views

least common multiple $\lim\sqrt[n]{[1,2,\dotsc,n]}=e$

The least common multiple of $1,2,\dotsc,n$ is $[1,2,\dotsc,n]$, then $$\lim_{n\to\infty}\sqrt[n]{[1,2,\dotsc,n]}=e$$ we can show this by prime number theorem, but I don't know how to start I ...
10
votes
3answers
975 views

Proving $\sum\limits_{p \leq x} \frac{1}{\sqrt{p}} \geq \frac{1}{2}\log{x} -\log{\log{x}}$

How to prove this: $$\sum\limits_{p \leq x} \frac{1}{\sqrt{p}} \geq \frac{1}{2}\log{x} -\log{\log{x}}$$ From Apostol's number theory text i know that $$\sum\limits_{p \leq x} \frac{1}{p} = ...
15
votes
3answers
664 views

Calculate $\sum\limits_{k=0}^{\infty}\frac{1}{{2k \choose k}}$

Calculate $$\sum \limits_{k=0}^{\infty}\frac{1}{{2k \choose k}}$$ I use software to complete the series is $\frac{2}{27} \left(18+\sqrt{3} \pi \right)$ I have no idea about it. :|
10
votes
2answers
340 views

Importance of the zero free region of Riemann zeta function

I have heard that for improving the error term in the Prime Number Theorem, we need better and better estimates on the zero free region. I have also heard that the best possible error term comes from ...
5
votes
2answers
201 views

Bounds for $\zeta$ function on the $1$-line

I was going over my notes from a class on analytical number theory and we use a bound for the $\zeta$ function on the $1$ line as $\vert \zeta(1+it) \vert \leq \log(\vert t \vert) + \mathcal{O}(1)$ ...
13
votes
1answer
310 views

Chebyshev: Proof $\prod \limits_{p \leq 2k}{\;} p > 2^k$

How do I prove the following: $$\prod_{p \leq 2k} \; p > 2^k \text{ with } p \in \mathbb{P}$$ I tried induction, but I didn't know how to go on because I don't have a look at all numbers. ...
4
votes
1answer
144 views

Divisor function asymptotics

Define $\tau_{r}(n) = \sum_{d_1...d_r = n}1$. One exercise in a book on sieve theory asked for an elementary proof by induction of the fact that $$\sum_{n\le x}\tau_r(n) = \frac{1}{(r - 1)!}x(\ln ...
10
votes
2answers
381 views

Solving an integral coming from Perron's formula

In analytic number theory, Perron's formula says that $$ \sum_{1 \leq k < n} a_k + \frac{1}{2}a_n = \int_{c - i\infty}^{c+i\infty} f(s)\frac{n^s}{s}ds, $$ where $f(s) = \sum_{k \geq 1} a_k/k^s$ ...
5
votes
2answers
1k views

Erdős and the limiting ratio of consecutive prime numbers

The following is a piece of math lore from the late forties, which was described in an Intelligencer article entitled "The Elementary Proof of the Prime Number Theorem". It reads: Turán, who was ...
5
votes
1answer
234 views

Proof involving the logarithmic integral

Another exercise from Apostol's book, this time we're supposed to prove $$\mathrm{Li}(x)=\frac{x}{\log x}+\int_2^x \frac{dt}{\log^2t}-\frac{2}{\log 2}.$$ which is easy to do via integration by ...
7
votes
1answer
1k views

Why the Riemann hypothesis doesn't imply Goldbach?

I'm interested in number theory, and everyone seems to be saying that "It's all about the Riemann hypothesis (RH)". I started to agree with this, but my question is: Why then doesn't RH imply the ...
6
votes
1answer
348 views

Finding an asymptotic for the sum $\sum_{p\leq x}p^m$ [duplicate]

Possible Duplicate: How does $ \sum_{p \leq x} p^{-s} $ grow asymptotically for $ \text{Re}(s) < 1 $? What could I use to prove the following conjecture? $ \sum_{p \le x} p^{m} \sim ...
5
votes
1answer
137 views

Average order of $\mathrm{rad}(n)$

Let $\mathrm{rad}(n)$ denote the radical of an integer $n$, which is the product of the distinct prime numbers dividing n. Or equivalently, $$\mathrm{rad}(n)=\prod_{\scriptstyle p\mid n\atop p\text{ ...
1
vote
1answer
129 views

Proving the functional equation $\theta (x) = x^{-\frac{1}{2}} \theta (x^{-1})$ from the Poisson summation formula

We have the relationship $\theta (x) = x^{-\frac{1}{2}} \theta (x^{-1})$ Now I know one uses the Poisson summation formula to prove this. The Poisson summation formula comes from Fourier Transform ...
44
votes
6answers
5k views

How hard is the proof of $\pi$ or $e$ being transcendental?

I understand that $\pi$ and $e$ are transcendental and that these are not simple facts. I mean, I have been told that these results are deep and difficult, and I am happy to believe them. I am curious ...
33
votes
1answer
2k views

Are these zeros equal to the imaginary parts of the Riemann zeta zeros?

Edit 8.8.2013: See this question also. The Fourier cosine transform of an exponential sawtooth wave times $e^{-x/2}$: $$\operatorname{FourierCosineTransform}(\operatorname{SawtoothWave}(e^x)\cdot ...
12
votes
3answers
2k views

How many elements in a number field of a given norm?

Let $K$ be a number field, with ring of integers $\mathcal{O}_k$. For $x\in \mathcal{O}_K$, let $f(x) = |N_{K/\mathbb{Q}}(x)|$, the (usual) absolute value of the norm of $x$ over $\mathbb{Q}$. ...
14
votes
2answers
492 views

Primes sum ratio

Let $$G(n)=\begin{cases}1 &\text{if }n \text{ is a prime }\equiv 3\bmod17\\0&\text{otherwise}\end{cases}$$ And let $$P(n)=\begin{cases}1 &\text{if }n \text{ is a prime ...
12
votes
1answer
496 views

What is the probability that some number of the form $10223\cdot 2^n+1$ is prime?

I (David Speyer) took the liberty of doing a fairly major rewrite of this question. I hope I haven't gone too far, but I think there is an interesting question hiding here. Sierpinski proved that ...
14
votes
0answers
447 views

Divergence of the Derivative of the Prime Counting Function

On the one hand, the Prime Counting Function $\pi_0(x)$ maybe be written $$ \pi_0(x) = \operatorname{R}(x^1) - \sum_{\rho}\operatorname{R}(x^{\rho}) \tag{1} $$ with $ \operatorname{R}(z) = ...
8
votes
1answer
853 views

how to prove this extended prime number theorem?

A Generalized Prime Number Theorem? Conjecture Let $n$ and $k$ be positive integers with $n - 50 > k^2 > 0$ and $n$ sufficiently large. Then for the odd primes we have, when $p$ is the biggest ...
7
votes
2answers
496 views

Generating functions and the Riemann Zeta Function

The generating function for the terms of the harmonic series: $\frac{1}{n}$ is $-\ln(1 - x)$. Does an ordinary generating function exist for the terms of the zeta function $\zeta(s) = ...
7
votes
1answer
560 views

Euler's summation by parts formula

I'm beginning analytic number theory and I see this formula in Apostol's book : If $f$ has a continuous derivative $f'$ on the interval $[y,x]$, where $0 < y < x$, then $$ \sum_{y < n \le x} ...
10
votes
2answers
554 views

Two Dirichlet's series related to the Divisor Summatory Function and to the Riemann's zeta-function, $\zeta(s)$

Considering the $\textit{Divisor Summatory Function}$, $D(n)$, defined as $$ D(n) = \sum_{k=1}^{n}d(k) , $$ where $$ d(n) = \sum_{k|n}^{n}1. $$ One can observe the following pattern in the values of ...
9
votes
2answers
360 views

What are some equivalent statements of (strong) Goldbach Conjecture?

What are some equivalent statements of (strong) Goldbach Conjecture ? We all know that Riemann Hypothesis has some interesting equivalent statements. My favorites are involved with Mertens ...
8
votes
3answers
4k views

Calculating the Zeroes of the Riemann-Zeta function

Wikipedia states that The Riemann zeta function $\zeta(s)$ is defined for all complex numbers $s \neq 1$. It has zeros at the negative even integers (i.e. at $s = −2, −4, −6, ...)$. These are ...
7
votes
1answer
438 views

How to derive an identity between summations of totient and Möbius functions

I have the following identities $$\sum_{n \le x} \varphi(n) = \frac{1}{2} \sum_{n \le x} \mu(n) \left[\frac{x}{n}\right]^2 + \frac{1}{2}$$ $$\sum_{n \le x} \frac{\varphi(n)}{n} = \sum_{n \le x} ...
5
votes
1answer
629 views

Intuition and Stumbling blocks in proving the finiteness of WC group

After reading many articles about the Tate-Shafarevich Group ,i understood that "in naive perspective the group is nothing but the measure of the failure of Hasse principle, and coming to its ...
10
votes
1answer
724 views

Rate of convergence of series of squared prime reciprocals

It is well known that $\sum_{p \text{ prime}} \frac{1}{p}$ diverges, and in fact - it behaves like log of the harmonic series: $$ \sum_{p \le x} \frac{1}{p} = \log \log x + O(1). $$ It is also well ...
6
votes
2answers
149 views

$\prod_{i=1}^{\infty}{1+(\frac{k}{i})^3}$ for integer k

Can anyone compute $$\prod_{i=1}^{\infty}{1+(\frac{k}{i})^3}$$ for integer k? Can it be done in closed form, using only elementary functions, without the use of the Gamma function? For k=1, the closed ...
5
votes
2answers
932 views

An identity involving the Möbius function

$$\sum_{n=1}^{\infty}\frac{1}{n^s}\sum_{n=1}^{\infty}\frac{\mu(n)}{n^s}=1$$ for $s>1$. How do I prove this identity?
1
vote
1answer
806 views

Euler totient function sum of divisors. Theorem 2.2 Apostol

Prove that : $If $ $ n\ge{1} $ $ \sum_{d|n}\phi(d)=N $ $ N \in{\mathbb Z} $ Let S denote the set {1,2,...,n}. We distribute the integers of S into disjoint sets as follows. For each divisor d ...
15
votes
6answers
3k views

A good reference to begin analytic number theory

I know a little bit about basic number theory, much about algebra/analysis, I've read most of Niven & Zuckerman's "Introduction to the theory of numbers" (first 5 chapters), but nothing about ...