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

learn more… | top users | synonyms

24
votes
1answer
804 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
3answers
472 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 ...
9
votes
3answers
306 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 ...
18
votes
4answers
2k 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 ...
10
votes
5answers
580 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)?$$
6
votes
2answers
612 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 ...
18
votes
3answers
825 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 ...
5
votes
2answers
155 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)$ ...
8
votes
3answers
776 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} = ...
24
votes
3answers
1k 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 ...
12
votes
1answer
268 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. ...
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 ...
8
votes
2answers
991 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 ...
5
votes
1answer
143 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 ...
4
votes
3answers
543 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}) + ...
3
votes
1answer
543 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 ...
34
votes
6answers
2k 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 ...
10
votes
3answers
894 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
453 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
455 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 ...
11
votes
0answers
290 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) = ...
6
votes
1answer
267 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
402 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 ...
6
votes
1answer
240 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 ...
6
votes
3answers
2k 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 ...
4
votes
2answers
667 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 ...
6
votes
1answer
330 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
2answers
570 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?
27
votes
1answer
1k 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 ...
13
votes
3answers
520 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}$).
13
votes
6answers
1k 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
2answers
718 views

Values of the Riemann Zeta function and the Ramanujan Summation - How strong is the connection?

The Ramanujan Summation of some infinite sums is consistent with a couple of sets of values of the Riemann zeta function. We have, for instance, $$\zeta(-2n)=\sum_{n=1}^{\infty} n^{2k} = 0 ...
13
votes
3answers
2k views

Non-increasing sequence of positive real numbers with prime index

If $a_n$ is a sequence of non-increasing positive numbers, then suppose we already know that $$\sum_p a_p$$ converges, when $p$ runs over the primes, what should be used to prove that $$\sum_n ...
7
votes
1answer
520 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 ...
10
votes
2answers
479 views

Supplemental number theory text to Montgomery and Vaughan

We already have a large list of the Best ever book on Number Theory, but I'm looking for a more targeted response for analytic number theory. Specifically, I'm taking a trip on which I may or may ...
7
votes
2answers
200 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 ...
5
votes
2answers
91 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
211 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) = ...
1
vote
2answers
242 views

Asymptotic behaviour of $\sum_{p\leq x} \frac{1}{p^2}$

As the title suggests, I want to find the asymptotic behaviour of this sum as $x\rightarrow \infty$, I tried by summation by parts but didn't succeed I also tried using the asymptotic behvaiour of the ...
8
votes
1answer
242 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?
6
votes
1answer
508 views

Divisor summatory function for squares

The Divisor summatory function is a function that is a sum over the divisor function. $$D(x)=\sum_{n\le x} d(n) = 2 \sum_{k=1}^u \lfloor\frac{x}{k}\rfloor - u^2, \;\;\text{with}\; u = \lfloor ...
6
votes
1answer
368 views

Showing that $\log(\log(N+1)) \leq 1+\sum\limits_{p \leq N} \frac{1}{p}$

I can't see how you get this. I want to show that $$\log(\log(N+1)) \leq \sum_{p \leq N} \frac{1}{p}+1$$ Can't see how it follows from this. So you show that $$0 \lt -\log(1-x)-x \lt ...
4
votes
1answer
337 views

Is there a simple way to prove Bertrand's postulate from the prime number theorem?

Is there a simple way to prove Bertrand's postulate from the prime number theorem? The prime number theorem immediately implies Bertrand's postulate for sufficiently large $n$, but it fails to ...
3
votes
1answer
151 views

Proving equivalences between prime counting functions.

If we have that: $$\theta(x)=\sum_{p\leq x}\log p,$$ and $$\psi(x)=\sum_{n\leq x}\Lambda(n)$$ Where $\Lambda(n)=\log p $ if $n=p^m$ and $\Lambda(n)=0$ in another case. How can I prove that : 1) ...
1
vote
2answers
147 views

Sum of Stieltjes constants

Does anyone know of any papers or resources dealing with the following question: For which values of $s=\sigma+it$ does the following sum of Stieltjes constants hold, ...
5
votes
3answers
180 views

What is the set $\{x\in\Bbb R\mid \forall q\in\Bbb Q: q^x\in\Bbb Q\}$?

What is the set $\{x\in\Bbb R\mid \forall q\in\Bbb Q: q^x\in\Bbb Q\}$? Of course $\Bbb Z$ is a subset of this set. Are there any other? if not what is the proof? is there a good reference for it?
5
votes
1answer
230 views

Asymptotics for sums of the form $\sum \limits_{\substack{1\leq k\leq n \\ (n,k)=1}}f(k)$

How can we find an asymptotic formula for $$\sum_{\substack{1\leq k\leq n \\ (n,k)=1}}f(k)?$$ Here $f$ is some function and $(n,k)$ is the gcd of $k$ and $n$. I am particularily interested in the case ...
4
votes
1answer
281 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
507 views

On the convergence of $\sum \mu(n)/n^s$

I arrived at something during my maths ponderings which is really exciting for me. It is clearly stated in the book on Riemann Hypothesis by Borwein that the convergence of $\sum_{n=1}^{\infty} ...
3
votes
0answers
155 views

existence of closed forms of certain Dirichlet series

In the following post we find an interesting calculation of $$ \sum_{n\ge 1} \frac{\mu(n)^2}{n\varphi(n)}.$$ I had been trying to do this calculation myself, setting the slightly more ambitious goal ...