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

learn more… | top users | synonyms

0
votes
0answers
24 views

Finding references about modular forms and symmetric power $L$-functions

I want to write an introduction to my thesis which is about modular forms and symmetric power $L$-functions. Could you give me good references to these two topics as simple as possible to get an ...
1
vote
0answers
43 views

Dirichlet characters with values in a finite field

Although the classical Dirichlet characters are complex valued, it seems to me rather useful that the characters attain values in a finite field; thus homomorphisms from $\mathbb{Z}_N^*$ to ...
5
votes
2answers
73 views

$L$-function, easiest way to see the following sum?

What is the easiest way to see that$$\sum_{(m, n) \in \mathbb{Z}^2 \setminus \{0, 0\}} (m^2 + n^2)^{-s} = 4\zeta(s)L(s, \chi)?$$Here $\chi$ is the homomorphism $(\mathbb{Z}/4\mathbb{Z})^\times \to ...
0
votes
1answer
15 views

Definition of “Contractive Invariant Plane”

Can someone please explain the definition of a contractive invarient Plane found in: the paper It is nearly at the very beginning of the Introduction. By contractive do they mean a contractive map? ...
2
votes
1answer
66 views

How to prove that $\frac 12+ \frac 13+\dots + \frac 1n < \log n < 1 + \frac 12+ \dots + \frac {1}{n-1} $?

If $n \in \mathbb N$ and $n \geq 2$, then we have $\frac 12+ \frac 13+\dots + \frac 1n < \log n < 1 + \frac 12+ \dots + \frac {1}{n-1} $. My try : Once if we can prove that for all $k \in ...
0
votes
0answers
20 views

Smooth interpolation for complex variable function. [on hold]

Is there any smooth interpolation function $T(z)$ that could smoothly connect two complex variable rational polynomial function $H_1(z)$ and $H_2(z)$, for example $$ H(z) = \begin{cases} ...
1
vote
1answer
24 views

Zeros of Dirichlet L-functions on the line $\Re(s)=1$ in proof of Dirichlet's theorem

In the proof of Dirichlet's theorem, we show that $L(s,\chi_0)$ has a simple pole at $s=1$ where $\chi_0$ is the principal character and that $L(1,\chi)\neq 0$ otherwise. Therefore the logarithmic ...
6
votes
1answer
67 views

Is $\pi(n)$ a Rational Function?

Are there some two-variable polynomials $P(n,\log n)$ and $Q(n,\log n)$ which we have the bellow equation for prime counting function $\pi(n)$ for $n \in \mathbb{n}$? $$\pi(n) = \Bigl{\lfloor} ...
4
votes
1answer
43 views

Prime Zeta Function proof help: Why are these expressions not equal?

I was trying to create a formula for the Prime Zeta function and I partially succeeded except for one frustrating error. I was only able to formulate an approximation. Consider the following sum: ...
6
votes
1answer
38 views

counting function of system of equations and Circle method

I came up with the follwing question while looking on Davenport's book: Analytical Methods for Diophantine equations and Inequalities. When introducing the Circle method gives an example on how to ...
13
votes
1answer
166 views

Sum of Reciprocals of Primes in Imaginary Quadratic Field Diverges (2014 Miklós Schweitzer)

Problem 5 of the 2014 Miklós Schweitzer states: Let $\alpha$ be a non-real algebraic integer of degree two, and let $P$ be the set of irreducible elements of the ring $\mathbb{Z}[\alpha]$. Prove that ...
0
votes
0answers
37 views

What is the Fourier transform of Riemann Zeta function?

All: Is there an explicit form of Fourier Transform of Riemann Zeta function ? Also, is there an discrete Fourier Transform (DFT) of Riemann Zeta function ? I remembered I had seen something like ...
0
votes
1answer
71 views

Is the Riemann zeta function $\zeta(s)$ exactly $\pi(x)$?

Let $\pi(x)$ denote the number of primes less than or equal to a certain x value. The prime number theorem says that $x/\log x$ (or more accurately $x/(\log x-1)$) has been the most popular method ...
2
votes
3answers
133 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 ...
2
votes
1answer
44 views

Does $\zeta(s)^2 \pm \zeta(1-s)^2$ have roots at the $\rho$s?

Maybe a strange (or stupid) question, but does $$\zeta(s)^2 \pm \zeta(1-s)^2$$ also have roots equal to the non-trivial zeros ($\rho$) ? At first sight you would expect so, however when I tried to ...
1
vote
1answer
31 views

Expected value of discrete functions. [closed]

I am doing some research in number theory(High school-so nothing advanced). During this I came across this post. I have not done much statistics. So could someone explain to me why if $\displaystyle ...
12
votes
1answer
634 views

Values of hypergeometric functions

Let $_pF_q(a_1,\ldots,a_p;b_1,\ldots,b_q;c)$ denote the generalized hypergeometric function. Let $A \subset \mathbb R$ be the set of all values of $\ _pF_q(\cdot)$ at rational points $a_i,b_j,c\in ...
2
votes
1answer
52 views

How to get sine term in Analytical continuation of $\zeta(s)$

I am able to prove the symmetric functional equation that Riemann gives in his paper, using Poisson Summation and properties of $\theta(x)$. The functional equation is given like so, ...
0
votes
0answers
31 views
3
votes
1answer
23 views

How do I estimate the error term when computing the number of integers which have the fractional part of their square roots in a given interval?

I'm trying to find the number of integers $n \leq N$ such that fractional part of $\sqrt n\in (\alpha,\beta]$ where $(\alpha,\beta]\subseteq(0,1]$. The approximate number is of course ...
7
votes
1answer
785 views

Derivative of the Riemann zeta function for $Re(s)>0$.

The Riemann zeta function can be analytically continued to $Re(s)>0$ by the infinite sum $$\zeta(s)=\frac{1}{1-2^{1-s}}\sum_{n=1}^\infty\frac{(-1)^{n-1}}{n^s}.$$ Can we differentiate this with ...
4
votes
1answer
36 views

Divide a square into different parts

This is a very interesting word problem that I came across in an old textbook of mine. So I know its got something to do with geometry, which perhaps yields the shortest, simplest proofs, but other ...
1
vote
1answer
44 views

Growth of the zeta function on the line $Re(s)=\frac{1}{2}$

I've seen that on the line $Re(s)=\frac{1}{2}$, $\zeta(s)=O(t^{\frac{1}{4}})$ where, as usual, $s=\sigma+it$. My teacher has told me that this can be derived directly from the functional equation of ...
7
votes
1answer
55 views

Distribution of random divisor sums modulo n

Let $k$, $n\ge 2$ be positive integers, and choose $\ell$ such that $0\le \ell \le k-1$. For each integer $2\le j \le n$, choose a divisor $d_j$ of $j$, uniformly at random from the divisors of $j$. ...
1
vote
1answer
58 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 ...
3
votes
2answers
49 views

Let $S(x)=\sum_{p\le x,\; q\le x,\; pq\gt x}\frac{1}{pq}$, where p and q are primes. Find the limit of this function.

Let $$S(x)=\sum_{p\le x,\; q\le x,\; pq\gt x}\frac{1}{pq},$$ where $p$ and $q$ denote prime numbers. Show that as $x\to\infty$,$S(x)$ converges to a constant, and find the value of that constant. ...
8
votes
2answers
181 views

Minimizing over partitions $f(\lambda) = \sum \limits_{i = 1}^N |\lambda_i|^4/(\sum \limits_{i = 1}^N |\lambda_i|^2)^2$

I'm trying to characterize the behavior of the the quantity: $$A = \frac{\sum \limits_{i = 1}^N x_i^4}{(\sum \limits_{i = 1}^N x_i^2)^2},$$ subject to the constraints that $$ \sum \limits_{i = 1}^N ...
0
votes
0answers
13 views

Motivation of the study of certain mean-square sums

Given a multiplicative function $a(n)$ and a positive real number $\alpha$ in $Q[\sqrt{N}],$ where $N$ is a square free integer. I want to know the motivation of the study of the mean-square value of ...
4
votes
1answer
31 views

$L(1,\chi) = \sum_{n=1}^{\infty}\frac{\chi (n)}{n} > 0$, for $\chi$ be the non-trivial real character

Let q be an odd prime and $\chi$ be the non-trivial real character modulo q. I am trying to prove that $L(1,\chi) = \sum_{n=1}^{\infty}\frac{\chi (n)}{n} > 0$. Note: this question was first asked ...
0
votes
0answers
125 views

What are the “hidden” symmetries in Goldbach Conjecture?

What are the "hidden" symmetries in Goldbach Conjecture ? If Goldback conjecture is true, the basic instinct is that there must exist some "symmetries" which ensure (and lead) such properties. As we ...
0
votes
1answer
41 views

coefficients of $f(t)=(\sum_{m=0}^{+\infty}e^{2\pi im^4t})(\sum_{m=0}^{+\infty}e^{2 \pi inm^4t})$

I want to prove that $\forall n \in \mathbb{N}$ at least one of the Fourier coefficients of $f(t)=(\sum_{m=0}^{+\infty}e^{2\pi im^4t})(\sum_{m=0}^{+\infty}e^{2 \pi inm^4t})$ is greater than 1( The ...
2
votes
0answers
46 views

Find motivation for calculating $\int_{2}^{X} A^2(t) A(\alpha t)dt$

I read a thesis of Kong Kar Lun (student of Tsang K.M) about the some mean value theorems for certain errors terms in analytic number theory and in which he gave the asymptotic formulas of the ...
0
votes
0answers
19 views

References for Dirichlet characters and L-functions

I am working on some exercises from my Analytic Number Theory course regarding Dirichlet characters, and I was wondering if someone could provide some references for this. Here's a problem that I'm ...
0
votes
0answers
43 views

Strange equation $1 + 2 + 3 + … = - \frac{1}{12}$ [duplicate]

Let $S = 1 + 2 + 3 + 4 + ...$ $S_1 = 1 - 1 + 1 - 1 + 1 - 1 = 1 - (1 - 1 + 1 - 1 + 1 - ...) = 1 - S_1 \Rightarrow S_1 = 1 - S_1 \Rightarrow 2S_1 = 1 \Rightarrow S_1 = \frac{1}{2}$ $S_2 = 1 - 2 + 3 - ...
2
votes
0answers
98 views

references for an arithmetic function

I was wondering if anyone is aware of any existing literature on the arithmetic function defined as $$f(n):=2^{\omega(n)}\tau(n).$$ Here $\omega(n)$ is the number of distinct prime divisors of $n$ and ...
0
votes
0answers
19 views

finding reference

I want to have a reference in which we have an asumptotic formula for the third moments of the sums of Hecke eigenvalues. If $f$ is a primitive form of an even weight $k$ for the full modular group ...
2
votes
2answers
47 views

Show that $\sum_{n\le x} \mu ^2(n)=\frac{x}{\zeta(2)}+o(\sqrt{x}) \; (x\to \infty)$

Show that $$\sum_{n\le x} \mu ^2(n)=\frac{x}{\zeta(2)}+o(\sqrt{x}) \; (x\to \infty)$$ I've proven so far that $\sum_{n\le x} \mu ^2(n)=\frac{x}{\zeta(2)}+O(\sqrt{x})$. I want to reduce this error ...
31
votes
2answers
3k views

Books about the Riemann Hypothesis

I hope this question is appropriate for this forum. I am compiling a list of all books about the Riemann Hypothesis and Riemann's Zeta Function. The following are exluded: Books by mathematical ...
2
votes
2answers
27 views

Estimate of the bounded sums of the tau function logarithms

Is the following estimate correct? Let $\tau (n)$ be the function that counts how many divisors of n are there. Then: $$ \sum\limits_{n\leq x} \log(\tau(n))=\log 2 \log\log x + O(1) $$ I've been ...
1
vote
1answer
37 views

For $s > 1,$ we have $\zeta(s) = \prod \left( \dfrac{1}{1-p^{-s}} \right)$

For $s > 1,$ we have $\zeta(s) = \displaystyle \prod \left(\dfrac{1}{1-p^{-s}} \right).$ Fix a positive integer $y,$ let $p_1, \ldots, p_n$ be primes and define $N_y := \{n \in \mathbb{N}: ...
1
vote
0answers
152 views

“Necessary” condition for Power Diophantine Equation.

Motivation: Brocard’s problem $n!+1$ being a perfect square Observations: Given a power Diophantine equation of $k$ variables with a “general solution” (provides infinite integer solutions) to ...
2
votes
0answers
224 views

An argument for “Brocard's problem has finite solution”

Brocard's problem is a problem in mathematics that asks to find integer values of n for which $$x^{2}-1=n!$$ http://en.wikipedia.org/wiki/Brocard%27s_problem. According to Brocard's problem ...
0
votes
1answer
51 views

On the summatory function of $\Lambda(n)/n$

In this paper is written that the prime number theorem in the form $\psi(x) = ( 1 + o(1) ) x$ is elementary equivalent to $$\sum_{n \le x } \frac{\Lambda(n)}{n} = \log x - \gamma + o(1) $$ I started ...
1
vote
1answer
27 views

Example of holomorphic modular form of weight 2?

I read that for holomorphic modular forms of weight 2, $f(q ) = \sum a_n q^n $ Hecke proved $|a_n| < Cn$. Are there any holomorphic modular forms of weight 2? There certainly aren't any for the ...
1
vote
1answer
42 views

Bounded sum of reciprocals of primes.

How can one adapt Apostol's proof that the bounded sum of the reciprocals of the first primes is $$\log\log x + C + O(1/ \log x) $$ to conclude the same about $$ \sum\limits 1/(p+1) $$ ? I just need a ...
5
votes
1answer
198 views

How to prove this inequality $\pi(x) > \log x - 1$ involving the prime counting function?

Problem Prove that $\pi(x) > \log x - 1$. Progress Based on a hint and very elementary methods, I got that $$ \prod_{p \leq x} (1-p^{-1})^{-1} \leq \prod_{k=2}^{\pi(x)+1} (1-k^{-1})^{-1}. $$ The ...
1
vote
0answers
13 views

Prove that $L(s)$ converges for $s > 0,$ or more generally for all complex $s \in \mathbb{C}$ with $\Re(s) > 0.$ [duplicate]

Let $L(s) = \sum_{n=1}^{\infty} a_n/n^s$ be a Dirichlet series. Suppose that the partial sums of the coefficients $A_n = \sum_{i=1}^n a_i$ are bounded, i.e. there exists a constant $C$ such that ...
3
votes
1answer
29 views

Why is Newman's Analytic Theorem neccessary

In a proof of the prime number theorem along the lines of Newman's, we establish that $-\frac {\zeta'(s)}{\zeta(s)}-\frac 1{s-1}$ possesses an analytic continuation to $\Re(s)\ge 1$ and that ...
4
votes
1answer
40 views

An asymptotic formula for the bounded sum of primes.

How to prove the following asymptotic formula?: $$ \sum\limits_{p\leq x} p \sim \frac{x^2}{2 \log x} $$ I'm stuck and I don't know where to start. I've been suggested the use of $\pi (x) = ...
0
votes
1answer
24 views

want a better bound the expression

Consider the expression $$ f_n(x)=\sum_{d|n,1<d\leq x} \Lambda(d)\left(\frac{1}{\log d}-\frac{1}{\log x}\right) $$ I've got $f_n(x)=\operatorname{O}\left(\frac{ x}{(\log x)^2}\right)$, but I've ...