Questions tagged [analytic-number-theory]

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

2,441 questions
380 views

232 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, k)$-...
1k views

Supplemental number theory text to Montgomery and Vaughan

We already have a large list of the Best book ever 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 ...
395 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 ...
299 views

249 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.
1k 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 ...
261 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 \mathbb{N}$...
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 ...
666 views

10k 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 ...
7k 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 ...
2k views

951 views

Continued Fraction expansion of $\tan(1)$

Prove that the continued fraction of $\tan(1)=[1;1,1,3,1,5,1,7,1,9,1,11,...]$. I tried using the same sort of trick used for finding continued fractions of quadratic irrationals and trying to find a ...
311 views

Markov-Hurwitz equation

Prove that the Markov-Hurwitz equation $x^2+y^2+z^2=dxyz$ is solvable in positive integers iff d= 1 or 3. Of course the reverse direction is easy, just set x=y=z=1, d=3. But I really have no idea ...
460 views

A Question on RH relating to Prime Number theorem

Well, in a previous post regarding the explanation of Riemann Hypothesis Matt answered that: The prime number theorem states that the number of primes less than or equal to $x$ is approximately equal ...
1k 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)?$$
802 views

Accuracy of approximation to inclusion-exclusion formula in prime sieve

This thing came up in a combinatorics course I am taking. Choose a fixed set of primes $p_1,p_2,\dots,p_k$ and let $A_n$ be number of integers in $\{1,2,\dots,n\}$ which are not divisible by any of ...
185 views

On functions similar to Hurwitz zeta function

Denoted as $\zeta(s,a)$ for a > 0 Where do I find topics on the Hurwitz zeta function for a < 0? Any links or resources would be appreciated. (Please dont mention wiki or mathworld) Thanks
1k views

Are there infinitely many $x$ for which $\pi(x) \mid x$?

Let $\pi(x)$ denote the Prime Counting Function. One observes that, $\pi(6) \mid 6$, $\pi(8) \mid 8$. Does $\pi(x) \mid x$ for only finitely many $x$, or is this fact true for infinitely many $x$...
We know that if $\displaystyle d(n)= \sum\limits_{d \mid n} 1$, then we have $$\sum\limits_{n \leq x} d(n)= x\log{x} + (2C-1)x + \mathcal{O}(\sqrt{x})$$ I have referred Apostol's "Analytic Number ...