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

learn more… | top users | synonyms

35
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 ...
14
votes
3answers
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. ...
32
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}$).
18
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 information-...
12
votes
3answers
439 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
791 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 x}\mu(n)\left[\frac{x}{n}\...
12
votes
3answers
789 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 ...
12
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 ...
10
votes
5answers
854 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
2k 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 ...
13
votes
2answers
492 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
2answers
367 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 ...
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 non-...
10
votes
1answer
417 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 ...
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 (...
5
votes
3answers
639 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}) + O\...
43
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 ...
27
votes
4answers
4k 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 ...
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 ...
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 e^{...
23
votes
3answers
511 views

Computing the product of p/(p - 2) over the odd primes

I'd like to calculate, or find a reasonable estimate for, the Mertens-like product $$\prod_{2<p\le n}\frac{p}{p-2}=\left(\prod_{2<p\le n}1-\frac{2}{p}\right)^{-1}$$ Also, how does this behave ...
11
votes
3answers
1k 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} = \log{\log{...
6
votes
2answers
213 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)$ ...
15
votes
3answers
697 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. :|
13
votes
1answer
317 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. ...
9
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
2answers
281 views

Generalized PNT in limit as numbers get large

If $\pi_k(n)$ is the cardinality of numbers with k prime factors (repetitions included) less than or equal n, the generalized Prime Number Theorem (GPNT) is: $$\pi_k(n)\sim \frac{n}{\ln n} \frac{(\ln ...
11
votes
2answers
412 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
1answer
159 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{ ...
6
votes
1answer
365 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 \...
1
vote
1answer
139 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 ...
45
votes
6answers
6k 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 ...
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}$. ...
17
votes
0answers
316 views

Simplify the sum $\sum_{n=2}^N\frac{1}{n^2}\sin^2(\pi x)\csc^2(\frac{\pi x}{n})$? - a sum shows all primes $\le N^2$

I was looking for a closed form but it seemed too difficult. Now I'm seeking help to simplify this sum. The 50 bounty points or more will be awarded for any meaningful simplification of this sum. I ...
14
votes
2answers
502 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 }\\0&\text{...
13
votes
1answer
521 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 ...
19
votes
0answers
540 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) = \sum_{n=...
8
votes
3answers
5k 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 ...
10
votes
2answers
388 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
2answers
558 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) = \sum_{n=1}^\...
8
votes
1answer
957 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
1answer
639 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
574 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 $...
7
votes
1answer
448 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} \...
6
votes
2answers
154 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 ...
10
votes
1answer
783 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 ...
5
votes
2answers
974 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
208 views

Argument of the Riemann zeta function on Re(s)=1

I refer to the lovely answer to this question. Is there an exact formula for the argument of the Riemann zeta function? Specifically, I would like to know the arguments along the line Re$(s)=1$. Some ...
16
votes
6answers
4k 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 ...
9
votes
3answers
983 views

A cohomological statement equivalent to the Riemann Hypothesis

Is there a possibility for looking for a theory of cohomology and an equivalent cohomological statement for Riemann hypothesis over $\mathbb{Z}$?