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

learn more… | top users | synonyms

14
votes
0answers
376 views

Using the Brun Sieve to show very weak approximation to twin prime conjecture

I recently stumbled across MIT OCW for analytic number theory. As a budding number theorist, my ears perked up and I looked through some of the material haphazardly. I don't really know much about ...
14
votes
0answers
404 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) = ...
9
votes
0answers
237 views

Equidistribution of roots of prime cyclotomic polynomials to prime moduli

Here is a relevant - and longstanding, I'm told - conjecture. Let $f \in \mathbb{Z}[x]$ be irreducible and of degree > 1. Set $E_p = \{x/p \: | \: 0 \leq x < p, f(x) \equiv 0 \: (p) \}$ = { ...
8
votes
0answers
582 views

Proof of Hardy-Ramanujan inequality in number theory.

On page 3 of http://www.math.dartmouth.edu/~carlp/Lehmer0.5.pdf the author write that the following inequalities follow from "the Hardy-Ramanujan inequality", but he doesn't point to a proof. The ...
8
votes
0answers
262 views

Quadratic characters and Liouville's function

I'm working through the problems in Montgomery & Vaughan's Multiplicative Number Theory. In Section 11.2 'Exceptional Zeros', Exercise 9a says that for a quadratic character $\chi$, show that for ...
8
votes
0answers
226 views

Weak version of Fortune's conjecture

Let $p\#=2\cdot3\cdot5\cdots p$ denote the primorial and $N(x)$ the smallest prime greater than or equal to $x$. Then Fortune's conjecture is that $N(p\#+2)-p\#$ is prime for all $p$. (Heuristic: to ...
7
votes
0answers
128 views

Is the Euler function $\phi$ constant in arbitrarily large intervals?

Is it true that for every $k \in \mathbb{N}$ there exists a natural number $x$ such that $\phi(x)=\phi(x+1)=\cdots=\phi(x+k)$, where $\phi$ is the Euler's totient function? I thought about this ...
7
votes
0answers
192 views

Number of ways to express a binary number in a certain way

So I'm working on a problem where I get to a point where I have to count the number of solutions to an equation or at least find a decent upper bound to be used in an estimate I need later. The ...
7
votes
0answers
291 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 ...
6
votes
0answers
126 views

Can we use $n\log n$ instead of $n$-th prime?

Denote $\pi(x)$ be the number of primes $\leq x,$ $p(n)$ be the $n$-th prime number. We have $\pi(p(n))=n.$ It's well known that $$\pi(x)\sim \frac{x}{\log x} \\p(n)\sim n\log n.$$ Is it always ...
6
votes
0answers
391 views

Sum of reciprocal of primes in arithmetic progression

In http://www.math.dartmouth.edu/~carlp/Lehmer0.5.pdf on page 6 (top) the author states that: $$ \sum_{p \le x, \ p \equiv 1 \bmod l} \frac{1}{p} = \frac{\log \log x}{\phi(l)} + O \left ( \frac{\log ...
6
votes
0answers
145 views

Density of products of a certain set of primes

I have an infinite set S of prime numbers with relative density 0 (that is, $\lim_ns_n/p_n=\infty$ with $S=\{s_1,s_2,\ldots\}$ and $s_1 < s_2< \cdots$). I would like to find the size (in some ...
6
votes
0answers
222 views

How to simplify $\newcommand{\bigk}{\mathop{\vcenter{\hbox{K}}}}\prod_{p\in\mathbb{P}}\left(1+\bigk_{k=1}^{\infty }\frac{f_k(s)}{g_k(s)}\right)^{-1}$

I'd like to simplify $$\newcommand{\bigk}{\mathop{\huge\vcenter{\hbox{K}}}}B(s)=\prod_{p\in\mathbb{P}}\left(1+\bigk_{k=1}^{\infty }\frac{f_{k}(s)}{f_{k}(s)}\right)^{-1}$$ to something of the form ...
5
votes
0answers
28 views

Equidistribution estimates after Zhang

I was curious what were the best equidistribution estimates toward the Elliott-Halberstam conjecture $$\sum_{q\le Q}\max\left|\Theta(x;q,a)-\frac{x}{\phi(q)}\right|<<\frac{x}{(log x)^A}$$ with ...
5
votes
0answers
50 views

Kloosterman sum and multiples of 16

A Kloosterman sum is defined as $$K(a,b;m)=\sum_{0\leq x \leq m-1}_{\gcd(x,m)=1} e^{2\pi \mathcal{i} (ax+bx^*)/m}$$ where $a,b,m \in \mathbb{N}$ and $x^*$ is the inverse of $x$ modulo $m$. How can ...
5
votes
0answers
110 views

Prime number theorem for Dedekind domains

Let $\mathscr P\subseteq \mathbb N$ be the set of prime numbers. The prime number theorem tells us that if $\pi(x)=|\{p\in\mathscr P\colon p\leq x\}|$ then $\pi(x)\sim \frac{x}{\log x}$. Now one could ...
5
votes
0answers
117 views

Are $ut + 1$ and $ut + t + 1$ both prime for some t for any $u$?

Conjecture : For any natural number $u$, there is a natural number $t$ such that $ut + 1$ and $ut + t + 1$ are both prime. So we get a solution of the equation $$au - b(u+1) = -1$$ with prime ...
5
votes
0answers
398 views

Mathematics felt by Srinivasa Ramanujan

At the moment I am reading the book Ramanujan's Papers by B.J. Venkatachala, V. Vinay and C.S. Yogananda; when clarifying some doubt with a professor, he told me that Srinivasa Ramanujan used Galois ...
5
votes
0answers
296 views

Maximum length of sequence of non-coprimes of $N$ - least upper bound for Jacobsthal's function

I am looking at the length of the longest sequences of adjacent integers that are not coprime to $N$ for very large $N$. Let $F_N$ be the set of integers less than $N$ which are not coprime with $N$: ...
5
votes
0answers
120 views

Inverting the Riemann zeta function in $s>1$

Let $s>1$ be a positive real and the Riemann zeta fucntion be defined for $s>1$ as $$ \zeta(s) = \sum_{n=1}^{\infty}\frac{1}{n^s}. $$ I am looking for an inversion formula for the zeta ...
5
votes
0answers
139 views

Best upper bound on the number of divisors of $n$ that are larger than $N$.

I am looking for the best upper bound on $$\sum_{\substack{d | n\\ d \geq N}} 1.$$ I know that $$ d(n) = \sum_{\substack{d | n}} 1 \leq e^{O(\frac{\log n}{\log \log n})}. $$ For my application, I ...
5
votes
0answers
293 views

Partial summation of a harmonic prime square series (Prime zeta functions)

I am trying to find the following series: $S=\displaystyle\sum_{i=1}^{n-1}\sum_{j=i+1}^{n}\dfrac{1}{p_ip_j},A\leq p_1 < p_2 < \dots < p_n \leq B, \lbrace A,B\rbrace \in \mathbb{N}$ ...
5
votes
0answers
601 views

one to one mapping between the floor function and the Riemann prime counting function

We have the following 'transform' of a real valued, piecewise continuous function $f(x)$ : $$T[f(x)]=1+\sum_{n=1}^{\infty}\int_{\mathbb{R}^{n}_{+}}f\left(\frac{x}{\Lambda _{n}} \right ...
5
votes
0answers
123 views

Dedekind sums + strange integral

I need to write $\displaystyle \int_0^1 f(x)\,dx$, where $f(x) = \# \Sigma_{pq} \cap (x, x+1)$ for $x \in [0, 1]$, where $$\Sigma_{pq} = \left \{ \frac{k}{p} + \frac{l}{q}:\ 1 \leq k \leq p-1, 1 \leq ...
5
votes
0answers
181 views

$2, 5, 13, 17, 29, 421, 401, 53, 281,…,\rightarrow \infty$? $a_{n+1}=\operatorname{ GPF}(qa_n+p)$

I denote by $\operatorname{ GPF}(n)$ the greatest prime factor of $n$, eg. $\operatorname{ GPF}(17)=17$, $\operatorname{ GPF}(18)=3$. Is there a way to prove that the sequence $a_{n+1}=\operatorname{ ...
4
votes
0answers
32 views

How do you prove that $M(N)=O(N^{1/2+\epsilon})$ from the Riemann Hypothesis?

I understand that if $M(N)=O(N^\sigma)$, then $\sum_{n=1}^\infty \frac{\mu(n)}{n^s}=\frac{1}{\zeta(s)}$ and therefore $$ \frac{1}{s\zeta(s)} = \int_0^\infty M(x) x^{-(s+1)} dx $$ for $s>\sigma$, ...
4
votes
0answers
134 views

A lower bound for an arithmetic function

Let $N \in \mathbb{N}$ such that $\phi(N) \sim N$, where $\phi$ is the Euler's totient function. Let $A \subset [N] := \{1, 2, \ldots, N\}$. For $n \in \mathbb{N}$ define the function $$ C_A(n) = \#\{ ...
4
votes
0answers
67 views

$d$ and $d+1$ both dividing certain integers

\begin{align} & 1\cdot 72 \\ & 2\cdot 36 \\ & 3\cdot 24 \\ & 4\cdot 18 \\ & 6\cdot 12 \\ & 8\cdot 9 \end{align} When the divisors of a number are listed in this way, let us ...
4
votes
0answers
36 views

Squarefree products of a class of primes

Numbers which are the sum of two squares are the product of a square and a collection of distinct primes which are 1 or 2 mod 4. Landau proved that there are $\sim kx/\sqrt{\log x}$ such numbers up ...
4
votes
0answers
34 views

Derivatives of a Dirichlet polynomial

I am new here, so I don't know how this works exactly. If I do something wrong, please let me know. I'd like help to solve a problem I am studying: Let $A$ be finite set of positive integers and ...
4
votes
0answers
79 views

Application of Dirichlet Theorem in AP to elementary number theory problems.

I have learnt this theorem in my class, however, "elementary" examples are very limited. (focusing more on analytic machinery) Are there any interesting applications to elementary number theory that ...
4
votes
0answers
107 views

Multiplicative subgroup of a finite field with prescribed trace.

Any suggestions/methods/estimates for the following problem would be very appreciated. $l,p$ are primes with $p \equiv 1 \!\! \pmod l$. $r$ is a positive integer with $r \equiv 1 \!\! \pmod p$ and $q ...
4
votes
0answers
59 views

How find this sum of in analytic numbers theory?

find the summion $$\sum_{p\le x}\dfrac{1}{(p-1)^2}\sum_{m=1}^{p-1}\sum_{\chi{(p)}}\sum_{a=1}^{p-1}\chi^m{(a)}e\left(\dfrac{a}{p}\right)$$ this problem is my friend gave me a question, he ...
4
votes
0answers
243 views

Where's my mistake applying Perron's Formula?

I applied Perron's Formula to Riemann Zeta Function and got a weird result. First, I started with a simple definition of Riemann Zeta Function, $$\zeta(s)=\sum_{n=1}^{\infty}\frac{1}{n^{s}}$$ where ...
4
votes
0answers
76 views

Easiest proofs for why $L(1,\chi)$ won't vanish?

The usual proofs in number theory books seem rather annoying if the goal is to actually be able to remember the proof in the future. At the same time these books typically assume that the reader's ...
4
votes
0answers
148 views

Euler summation and its transformation

The following results: For any function $f \in C^1[a,b]$ and any $q \in \mathbb{N}$, $$\sum_{a<k \leq b, (k,q)=1} f(k)=\frac{\varphi(q)}{q} \int_a^b f(x) dx + O(\tau(q) (\sup_{x \in [a,b]} ...
3
votes
0answers
34 views

An inequality for $|\zeta (s,a)|$, a detailed proof

In page 272 of [1], Apostol leaves as a reader's assigment to complete a proof of a related statement with Hurwitz zeta function, defined initially for $\sigma >1$ by the series ...
3
votes
0answers
49 views

Linear independence of primitive Dirichlet characters and convolution

This is not an exercise but merely a question I have. Fix $N \in \mathbb{N}$ and suppose there exist some values $a_k \in \mathbb{C}$, for $k \in \mathbb{Z}_N$, such that $$ \sum_{k \in \mathbb{Z}_N} ...
3
votes
0answers
139 views

Conjecture concerning sums of reciprocals of largest prime factors

Let $x$ be an integer, $r(x)$ the reciprocal of the largest prime factor of $x$. Let $f(n) = \sum_{k=1}^{n-1} r(k) r(n-k)$ for which $k$ and $(n-k)$ are coprime. For $n = 3 \dots 10$, $f(n) = ...
3
votes
0answers
85 views

Is there an equivalent statement of Riemann Hypothesis in term of Random Matrix or physics theory?

We all know that Riemann Hypothesis has many equivalent statements. After Montgomery’s works on pair-relationship, we now know that ZEROs of Riemann Zeta function has similar properties as ...
3
votes
0answers
129 views

Divisor summatory function for squares plus one

As an exercise for my Analytic Number Theory course, I need to prove, using Dirichlet hyperbola method, that: $\sum_{n\leq x}\tau(n² + 1)= {3\over\pi}x\log(x) + O( x)$, where $\tau(n)=\sum_{d|n}1$ ...
3
votes
0answers
45 views

Trigonometric sum evaluation

Let $q$ a prime number and $1 \leq a<q$ a positive integer. We know from Ramanujan identity that $$\underset{h=1,\left(h,q\right)=1}{\overset{q}{\sum}}e^{2\pi ...
3
votes
0answers
98 views

A question on the Prime number theorem

Let $N\geq1$. Could we infer $$\sum_{n\leq N}\mu(n)\ll N\exp(-c\sqrt{\log N})$$from $$\sum_{n\leq N}\Lambda(n)= N+O(N\exp( -c\sqrt{\log N})$$or $$\sum_{p \leq N}1=Li(x)$$ without resorting to the ...
3
votes
0answers
38 views

Why do so many identities for the Logarithmic Integral begin with the terms $\log \log n + \gamma +…$?

Several identities for the log integral lead with the terms $\log \log n + \gamma$, where $\gamma$ is the Euler–Mascheroni constant. So, for example, there's the well-known $$\text{li}(n) = \log ...
3
votes
0answers
98 views

Brun's sieve bounds

Working from Halberstam-Richert they state the following bounds \begin{align} S(\mathcal{A}; \mathfrak{P}, z) \leq XW(z)\left(1 + 2 \frac{\lambda^{2b + 1}e^{2\lambda}}{1 - \lambda^2 e^{2 + ...
3
votes
0answers
27 views

how that if $P(x_1,…,x_n) \in C[x_1,…,x_n]$ takes only prime values at all non-negative integer values $x_i$, then $P$ is constant.

Show that if $P(x_1,...,x_n) \in C[x_1,...,x_n]$ takes only prime values at all non-negative integer values $x_i$, then $P$ is constant. To start, how would you express $P(x_1,...,x_n)$? I really ...
3
votes
0answers
118 views

Is this the chord G Major I am hearing as base tones from interference of zeta zeros times eigenvalues of the von Mangoldt function matrix?

Mathematica knows that the logarithm of $n$ is: $$\log(n) = \lim\limits_{s \rightarrow 1} \zeta(s)\left(1 - \frac{1}{n^{(s - 1)}}\right)$$ The von Mangoldt function should then be: ...
3
votes
0answers
52 views

Prove that the set has zero density

Let $a>1$ be a positive integer and $f\in \mathbb{Z}[x]$ with positive leading coefficient. Let $S$ be the set of integers $n$ such that $$n \mid a^{f(n)}-1.$$ Prove that $S$ has density $0$; that ...
3
votes
0answers
99 views

Major arcs in the proof that every odd number is the sum of at most 5 primes

In his proof that all odd numbers greater than 1 are the sum of at most 5 primes, Terence Tao uses one large major arc around 0 rather than small ones around the rationals, which I am more accustomed ...
3
votes
0answers
112 views

Question about the proof of Goldbach's weak conjecture

H.A. Helfgott recently proved Goldbach's weak conjecture here: http://arxiv.org/pdf/1305.2897v2.pdf In (1.1), he explains that he is trying to show that $$\sum_{n_1 + n_2 + n_3 = ...