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

learn more… | top users | synonyms

13
votes
1answer
571 views

Going from $\Lambda$ to a prime count

A 1997 paper of Étienne Fouvry and Henryk Iwaniec, Gaussian primes, concerns the prevalence of primes that are of the form $n^2+p^2$ for prime $p$. The asymptotic result is $$\sum_{n^2+p^2\le ...
30
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 ...
1
vote
0answers
216 views

Dirichlet's Class Number and its connections with the $GL(2)$

i posted the same question on MO,but cant get an answer so i am trying here note:all those who answer my question just mention the question number in their reply so that i can tally them,thanks a ...
3
votes
1answer
113 views

Equidistribution results vs transcendence degree

Consider $\alpha =(\alpha_1, \dots, \alpha_n) \in \mathbb{R}^n$ linearly independent over $\mathbb{Q}$, then the map $q \mapsto q \alpha:= ( q \alpha_1, \dots, q \alpha_n)$ gives a dense embedding ...
10
votes
1answer
355 views

Finding the integer $\le n$ with largest number of divisors

As mentioned in an answer to this question an integer less than $n$ with largest number of divisors can be found exploring the numbers $x$ of the form $$ x = 2^{a_1} 3^{a_2} \dots p_k^{a_k} \dots $$ ...
0
votes
1answer
146 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 ...
8
votes
3answers
235 views

Can one show that $\sum_{n=1}^N\frac{1}{n} -\log N - \gamma \leqslant \frac{1}{2N}$ without using the Euler-Maclaurin formula?

I would like to prove that $$ \sum_{n=1}^N\frac{1}{n} -\log N - \gamma \leqslant \frac{1}{2N} $$ without using the Euler-Maclaurin summation formula. The motivation for this is that I have come very ...
6
votes
1answer
338 views

Are there complex Bernoulli numbers?

I am aware of the generalized Bernoulli numbers, but these are not what I'm looking for. I was wondering if there exists such a thing as fractional, real or even complex Bernoulli numbers ( $B_z$ for ...
1
vote
1answer
189 views

Proving $\sum\limits_{k=1}^{\pi(n)-1} [ \theta(p_k) (1/{p_k}-1/p_{k+1})] -\ln(n)$ converges

Prove the sequence $a_n$ defined by $a_n = \sum\limits_{k=1}^{\pi(n)-1} [ \theta(p_k) (1/{p_k}-1/p_{k+1})] -\ln(n)$ converges, where $p_k$ denotes the $k$-th prime and $\vartheta(x)$ is Chebyshev's ...
10
votes
1answer
182 views

What is the sum of the squares of the differences of consecutive element of a Farey Sequence

A Farey sequence of order $n$ is a list of the rational numbers between 0 and 1 inclusive whose denominator is less than or equal to $n$. For example $F_6= ...
2
votes
1answer
147 views

Difference between zeta sum and Euler product?

The fact that $$\sum_{n=1}^\infty \frac{1}{n^s} = \prod_{p}\frac{1}{1-p^{-s}}$$ is a consequence of unique factorization of primes. We could form a similar sum and a similar product of irreducibles ...
2
votes
1answer
147 views

Prime asymptotics from Euler product

It is said that the Euler product $$\prod_p \frac{1}{1-p^{-s}}$$ diverges as $s \to 1^+$ proves we can't find constants $C$,$\theta$ with $\theta < 1$ such that $\pi(x) < C x^\theta$ because ...
8
votes
2answers
263 views

Probability of determinants being coprime

I have a question that is not of particular significance, but I would love to understand the underlying principles. Suppose we have two square 3x3 matrices, $M_1$ and $M_2$ with $$M_1 = ...
12
votes
3answers
397 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 ...
10
votes
3answers
985 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 ...
7
votes
2answers
159 views

Zeta functions in Chebychev's Prime Number theory

In two papers from 1848 and 1850, the Russian mathematician Pafnuty L'vovich Chebyshev attempted to prove the asymptotic law of distribution of prime numbers. His work is notable for the use of the ...
6
votes
1answer
408 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
719 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 ...
3
votes
2answers
384 views

Asymptotic formula for d(n)/n summation

I was trying to show $$\sum_{n \le x} \frac{d(n)}{n} = \frac{1}{2}\log(x)^2 + 2\gamma \log(x) + O(1)$$ where $d(n)$ is the number of divisors of $n$ and $\gamma$ is the Euler constant using the ...
4
votes
1answer
191 views

Bounds for Fourier coefficients of cusp forms

I've asked the background question here, which still left unanswered. Now I have a more precise question. In my homework I've been asked to prove that $$\left| \sum_{1\leq n \leq N} a_f (n)e^{2\pi i ...
6
votes
1answer
313 views

Cusp forms' Fourier coefficients sign changes

I need some clarification on the following, if possible: I have seen in that for every $ f \in S_k$ which Fourier transform is $\sum_{n=1}^\infty a(n)q^n$ there is an upper bound $\sum_{n=1}^N ...
14
votes
3answers
879 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 ...
7
votes
0answers
290 views

How can we prove a simple case of the High Indices Theorem?

Let $(a_n)$ be a sequence of real numbers such that $$f(x) = \sum_{n=1}^{\infty} a_n x^{2^n}$$ converges for $|x| < 1$ and $f(x)$ converges to $a$ as $x \to 1^{-}$. Then I have to prove that $\sum ...
5
votes
1answer
200 views

Abelian theorem regarding Riesz summability

This is my first time to post something here. If there is anything wrong, please inform me... Anyway, here is my question: Let $k$ be a nonnegative integer. We say a sequence $(a_n)$ is $(R, ...
11
votes
2answers
744 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 ...
6
votes
1answer
308 views

Question on de la Vallee Poussin's simplified proof of Dirichlet's theorem on primes in arithmetic progressions

I've been trying to understand de la Vallee Poussin's "Demonstration Simplifiee du Theorem de Dirichlet sur la Progression Arithmetique" and I've got stuck at the following step on pg 18 where Poussin ...
5
votes
1answer
227 views

Eisenstein series

Show that all Eisenstein series $G_k$ can be expressed as polynomials in $G_4$ and $G_6$, e.g. express $G_8$ and $G_{10}$ in this way. Hint: Setting $a_n := (2n+1)G_{2n+2}$, show that $2n(2n-1)a_n ...
19
votes
1answer
454 views

On existence of an integer between $\sqrt{n}$ and $\sqrt{2n}$ coprime to $n$

I have one proof of the following statement, and I would like to know if there is a simpler proof. I am not sure if “simpler” is the right word or not but, for the purpose of this question, I prefer ...
8
votes
2answers
575 views

Trig identity to zeta function identity?

The inequality $$\zeta(s)^3 | \zeta(s + it)^4 \zeta(s + 2it)| \ge 1$$ follows from $$3 + 4 \cos(\theta) + \cos(2 \theta) \ge 0$$ How is that done? What is the relationship between zeta and the ...
22
votes
3answers
461 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 ...
4
votes
1answer
590 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} ...
1
vote
1answer
240 views

Proving $\pi(\sqrt{p_{1}p_{2}\cdots p_{n}})>2n$ for $n \geq 6$

I am having trouble in solving the following problem. Let $p_{n}$ denote the $n$-th prime. Then prove that $$\pi(\sqrt{p_{1}p_{2}\cdots p_{n}})>2n$$ for $n \geq 6$. No idea how to start.
15
votes
2answers
818 views

A Conjecture of Schinzel and Sierpinski

Melvyn Nathanson, in his book Methods in Number Theory (Chapter 8: Prime Number's) states the following: A conjecture of Schinzel and Sierpinski asserts that every positive rational number $x$ can ...
2
votes
2answers
243 views

Expressing $\pi(x) = \frac{P(x)}{Q(x)}$, where $P$ and $Q$ are polynomials

In Tom Apostol's Analytic Number Theory book there is a problem which states: That there do not exists polynomials $P(x)$ and $Q(x)$ such that $$\pi(x) = \frac{P(x)}{Q(x)}$$ for all $x \in ...
6
votes
1answer
1k views

One line Proof of the Prime Number Theorem

Whenever I am not doing anything, I generally happen to see pages of some good Mathematical Institutes in India, so as to know more about the faculty members and see what they are working on. While ...
5
votes
2answers
477 views

Understanding an integral from page 15 of Titchmarsh's book “The theory of the Riemann Zeta function”

In Titchmarsh's book "The theory of the Riemann Zeta function" pg. 15 where the functional equation of the zeta function is being derived, I couldn't understand this part: $$\frac{s}{\pi} ...
6
votes
4answers
1k views

Why are complex numbers necessary to prove the Prime Number Theorem?

The standard proof of the Prime Number Theorem requires taking into consideration that there are no zeroes of the Riemann Zeta function in which the real part equals one. But consider the following ...
26
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 ...
8
votes
1answer
214 views

When does the “Zetor function” converge?

Let $p_n$ be the n'th non-trivial zero of the Riemann zeta function. We define the Zetor function (acronym of 'zeta' and 'zero') as follows: $$\zeta \rho (s) = \sum_{n=1}^{\infty} \frac{1}{(p_n)^s}. ...
5
votes
2answers
552 views

Infinite product representation of a function in terms of its non-trivial zeroes?

From Wikipedia's Weierstrass Factorization Theorem, I learned that every entire function can be represented as a product involving its zeroes. Examples are the sine and cosine function. The Riemann ...
2
votes
1answer
494 views

Is Riemann Zeta Function symmetrical about the real axis?

From wikipedia, http://en.wikipedia.org/wiki/Riemann_zeta_function "Furthermore, the fact that $\zeta(s) = \zeta(s^*)^*$ for all complex s ≠ 1 ($s^*$ indicating complex conjugation) implies that the ...
21
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 ...
7
votes
1answer
124 views

Nonnegativity of the quadratic Dirichlet L-function $L(\tfrac{1}{2},\chi)$ under GRH

I have been looking for a proof of the statement: "Assume the Generalized Riemann Hypothesis. Let $d$ be a fundamental discriminant and $\chi_d$ the associated primitive quadratic character. Then, ...
40
votes
6answers
4k 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 ...
20
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 ...
8
votes
3answers
897 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} = ...
11
votes
3answers
543 views

Motivation for Hecke characters

The context is the definition of Hecke Größencharakter: http://en.wikipedia.org/wiki/Hecke_character This is supposed to generalize the Dirichlet $L$-series for number fields. Dirichlet characters ...
6
votes
1answer
138 views

Why is width of critical strip what it is?

For Riemann zeta function and $L$-functions of number fields, the width of critical strip is $1$. For $L$-functions of modular forms of weight $k$, the width of the critical strip is $k$. Why is ...
0
votes
1answer
193 views

Showing $e^{\psi(x)}= \text{lcm}[ 1,2,\cdots , \lfloor{x\rfloor}]$

Let $$ \theta(x) = \sum\limits_{p \leq x} \log{p} \quad \ ; \ \psi(x)=\sum\limits_{n=1}^{\infty} \theta(x^{1/n})$$ then how does one prove $$e^{\psi(x)}= \text{lcm}[ 1,2,\cdots , \lfloor{x\rfloor}]$$
0
votes
2answers
189 views

Bounding the series $\sum_{m\leq x,m\neq n}\frac{1}{|\log(m/n)|}$

I am trying to reproduce the following bound: $\sum_{1\leq m\leq x, m\neq n}\frac{1}{|\log(m/n)|}=O(x\log(x))$, for $x\geq 2$ and some $n$, $1\leq n\leq x$ (the implicit constant shouldn't depend on ...