Skip to main content

Questions tagged [analytic-number-theory]

On the blending of real/complex analysis with number theory. The study involves distribution of prime numbers and other problems and helps giving asymptotic estimates to these.

Filter by
Sorted by
Tagged with
1 vote
0 answers
83 views

Prime powers gap of type $(a,b)$

For $n$ a given positive integer, say $r$ is a Galois radius of $n$ of type $(a,b)$, level $l=ab$ and rank $\rho=a+b$ if $n-r=p^a$ and $n+r=q^b$ with both $p$ and $q$ prime. Denote by $PPG_{a,b}(m)$ ...
Sylvain JULIEN's user avatar
5 votes
0 answers
104 views

Exponential sums with monomials with divisor-function coefficients

In their paper "Exponential Sums with Monomials," Fouvry and Iwaniec study exponential sums roughly of the form $$ \sum_{m_1 \sim M_1} \cdots \sum_{m_r \sim M_r} c_1(m_1) \cdots c_r(m_r) e\...
Joshua Stucky's user avatar
3 votes
1 answer
230 views

Duke and Schulze-Pillot condition for equidistribution

When regarding a ternary quadratic form $Q(x,y,z)$, is a classic question to consider which integers $n$ can be represented by $Q$. It is also classic to wonder how "well distributed" are ...
MathqA's user avatar
  • 313
1 vote
0 answers
97 views

Bounds and repulsion domains for the Dirichlet eta function $\eta(\sigma+it)$, for fixed $\sigma$

Let $\eta(\sigma+it)$ be the Dirichlet eta function, with $t>0$ (the variable) and $\sigma$ be fixed, with $\frac{1}{2}\leq \sigma <2$. I define the hole $\Omega_T =\Omega_T(\sigma)$ as the ...
Vincent Granville's user avatar
3 votes
0 answers
248 views

How "dense" are smooth numbers?

Fix an integer $d \geq 2$, and let $S = \{ p_1^{\alpha_1} p_2^{\alpha_2} \cdots p_d^{\alpha_d} \ : \ \alpha_1,\alpha_2,\dots,\alpha_d \geq 0\}$ denote the set of all $p_d$-smooth positive integers ($...
Jakub Konieczny's user avatar
2 votes
1 answer
159 views

Is the density of integers $n$ such that the finite sequence $(\omega(n-r)\omega(n+r))_{0\leq r\leq n-1}$ is surjective positive?

Let $\omega(m)$ be the number of prime factors of $m$ regardless of multiplicity. I'm interested in the behavior of the finite sequence $(\omega(n-r)\omega(n+r))_{0\leq r\leq n-1}$ for a given integer ...
Sylvain JULIEN's user avatar
2 votes
0 answers
192 views

A not-quadratic sieve? (Or: Selberg and the like, without a square)

Let $\mu$ be the Möbius function. Let $$\lambda_d = \begin{cases} \frac{\log D/d}{\log D} \mu(d)&\text{for $d\leq D$,}\\ 0 &\text{otherwise.}\end{cases}$$ (Selberg's weights also work.) Then ...
H A Helfgott's user avatar
  • 20.2k
2 votes
1 answer
545 views

Is there a Cramer's conjecture for Sophie Germain primes?

A prime $q$ such that $2q+1$ is also a prime is a Sophie Germain prime. Cramer's conjecture tells gap between consecutive primes is bound by $O(\log^2p)$. Is there a similar conjecture for Sophie ...
Turbo's user avatar
  • 13.9k
0 votes
0 answers
157 views

Does it make sense to express upper bounds on arithmetic sequences with Dirichlet generating functions?

In order to see what happens when taking the functional equation in this form: $$\xi(s) := \pi^{-s/2}\ \Gamma\left(\frac{s}{2}\right)\ \zeta(s) $$ $$\xi(s) = \xi(1 - s)$$ $$\pi^{-s/2}\ \Gamma\left(\...
Mats Granvik's user avatar
  • 1,183
7 votes
1 answer
430 views

Do polynomial values rarely have large multiple prime factors?

I am interested in the following set-up: Let $F \in \mathbb{Z}[x_1,\dots,x_n]$ be a fixed irreducible homogeneous polynomial of degree $d$ and consider the quantity $$N_{\delta}(B)=\#\{(x_1,\dots,x_n) ...
Christian Bernert's user avatar
9 votes
1 answer
400 views

The difference between consecutive primes in arithmetic progressions

Let $\pi(x)=\sum_{p\leq x}$ denote the prime counting function. A well known result of Baker, Harman, and Pintz on prime gaps states that for $x\geq y\geq x^{0.525}$ we have that $$\pi(x+y)-\pi(x)\gg \...
Eric Naslund's user avatar
  • 11.4k
1 vote
0 answers
243 views

Sums of Kloosterman sums

Let \[ S_{n,m}(q)=\sum_{a=1\atop {(a,q)=1}}^qe\left (\frac {an+\overline am}{q}\right )\] be Kloosterman's sum and $\alpha _n,\beta _m$ be complex numbe of modulus $\leq 1$. For $Q,N,M>0$ what is ...
tomos's user avatar
  • 1,381
3 votes
0 answers
101 views

Regularised value of cardinality of non trivial Zeta zeros:

This is a straight forward question so apologies in advance Consider the following sums: $$\sum_k1_{\rho_k}$$ $$\sum_k{\rho_k}$$ (i.e. first sum counts non trivial zeros of Zeta function) I want ...
TPC's user avatar
  • 790
6 votes
1 answer
546 views

On Cramér's theorem about roots of Zeta function

Cramér proved the following theorem (see the announcement in [1] and [2]): Consider the following function: $$V(z)=\sum_k e^{\rho_kz}$$ Where $\rho_k$ runs through non trivial zeta zeros with $Im(\...
TPC's user avatar
  • 790
3 votes
0 answers
168 views

Variants of Selberg trace formula

I am familiar with a basic case of Selberg's trace formula, in the case of quotients of upper half plane (for example, see Sections 5.1 - 5.3 of Bergeron's book). Section 5.1 describes a general setup ...
user482438's user avatar
14 votes
3 answers
1k views

Accelerating convergence for some double sums

I am interested in the following general double sums, for integers $a\geq 1$ and $b\geq 2$, $$Z(a,b) = \sum_{k,\ell \geq 0} \frac{2k+3}{\binom{k+2}{2}^a} \frac{2\ell+3}{(\binom{k+2}{2}+\binom{\ell+2}{...
F. C.'s user avatar
  • 3,587
0 votes
0 answers
171 views

Explanation of a step in a preprinted work

I have been studying this preprinted paper and the references therein. I believe that there are some typos; However, since I am not an expert yet, I would like to make sure I am correct. I do not ...
Mr. Proof's user avatar
  • 159
2 votes
1 answer
146 views

A condition on $(a_{j})_{j\in \mathbb{N}}$ so that for all $x \in \mathbb{R}$ we have $\min_{1 \leq j \leq N}\|a_{j}x\|=o(1)$

Suppose that the sequence $(a_{j})_{j \in \mathbb{N}}$ is an increasing sequence of positive integers that satisfies $$(1)\text{ }\text{ }\text{ }\text{ }\text{ }\text{ } d | a_{d}$$ and $$ (2)\text{ }...
Siddharth Iyer's user avatar
11 votes
1 answer
2k views

Has this number-theoretic constant been studied?

Unless I made a mistake, the expected value of the largest exponent in the prime factorization of random positive integer (defined in the appropriate way) is $$\eta := \sum_{n=1}^\infty \Big(1-\zeta(n)...
mathworker21's user avatar
  • 1,355
1 vote
0 answers
123 views

On probability of coprimality of a list of numbers

We know $r$ randomly chosen integers are coprime with probability $\frac1{\zeta(r)}$. Pick a bound $N$ and pick $k\lceil N^{\alpha}\rceil$ uniformly random integers in $[0,N^{\alpha+\beta}]$ where $\...
Turbo's user avatar
  • 13.9k
3 votes
0 answers
158 views

What can be said about the primality of Zsigmondy numbers?

I am cross-posting this from math.stackexchange, as it has received upvotes but no comments/answers after a couple months. Let $\mathcal{Z}(n,a,b)=\frac{\Phi_n(a,b)}{\gcd (\Phi_n(a,b),n)}$ be the $n$-...
Tejas Rao's user avatar
  • 101
5 votes
2 answers
701 views

Specific application of Cauchy-Schwarz and Large Sieve

Im reading a paper by Matomaki here, and the following is stated (I'm paraphrasing): "By the Cauchy-Schwarz inequality and the large sieve, we have $$\sum_{q \leq Q}\frac{q}{\phi(q)}\sum_{\...
CBagshaw's user avatar
  • 153
5 votes
2 answers
1k views

A question regarding Cramér's proof on prime gaps under the Riemann Hypothesis

Let $p_n$ be the $n$th prime. Assuming the Riemann hypothesis, Harald Cramér proves that $p_n-p_{n-1}\le C(\sqrt p_n \log p_n)$ for sufficiently large $n$. Is there a value known for the constant $C$ ...
EGME's user avatar
  • 1,018
2 votes
0 answers
1k views

Advanced texts on analytic number theory?

So a friend of mine is very interested in analytic number theory, and is looking for resources past the basic level. He has studied analytic number theory from several books, among them are Hardy’s ...
1 vote
1 answer
174 views

Non-negativity of an infinite absolutely convergent sum

The infinite sums involving mobius function and a multiplicative function has got quite interest in past. In particular, sums of the form $$\sum_{d=1}^{\infty}\frac{\mu(d)}{f(d)}$$ for mobius function ...
Hhhhhhhhhhh's user avatar
  • 1,042
4 votes
1 answer
995 views

Is there a way to specify a special kind of reciprocals of natural numbers?

Any number with of a form $\frac{1}{n}$ has a decimal with a repetend of finite length that is never longer than $n$ (provable by Dirichlet principle). (Example: $\frac{92}{99}=0.929292\ldots$ in ...
Vuk Jovovic's user avatar
0 votes
1 answer
218 views

Asymptotic behavior of the sum $\sum_{k\le x}\frac{1}{\varphi(k)}$

Suppose $x>0$ and let $f(x)=\sum_{k\le x}\frac{1}{\varphi(k)}$, where $\varphi(k)$ is the Euler totient function. It is well known that $\sum_{k\le x}\frac{1}{k}\sim\log x$. What is the asymptotic ...
ZZP's user avatar
  • 622
2 votes
1 answer
290 views

One series converges iff the other converges

In Show that $\sum\limits_pa_p$ converges iff $\sum\limits_{n}\frac{a_n}{\log n}$ converges it is said that this sequence of partial sums converges $$ \begin{split} \sum_{1<n\leq N}\frac{a_{n}}{\...
tongyang2357's user avatar
1 vote
0 answers
187 views

$\lim_{x\to \infty} \left(\sum_{n\leq x} (\log n)^k/n - \int_1^x (\log t)^k/t\right) = \text{?}$

It is easy to see (by Euler-Maclaurin, say, or just by thinking of a graph) that $$\lim_{x\to \infty} \sum_{n\leq x} \frac{(\log n)^k}{n} = \int_1^x \frac{(\log t)^k}{t} + C + O\left(\frac{(\log x)^k}{...
H A Helfgott's user avatar
  • 20.2k
16 votes
5 answers
4k views

Resources where I can find open problems in number theory along with their level of difficulty

NOTE: I will not accept an answer because a lot of answers are really good and if anyone want to post under this question later then they are most welcome to post as comment or answer because it will ...
1 vote
0 answers
213 views

Convergence of zeta Euler product with additional term

Let's consider the following Euler product ($s=\sigma+it)$: $$ P(s)=\prod_{p \; \text{prime}} \frac{1}{1-p^{-s}} \; e^{-p^{-s}}$$ So for $\sigma>1$, it is clear the product converges and we have: $$...
Bertrand's user avatar
  • 1,199
3 votes
0 answers
221 views

Reference request Re Vinogradov's ternary Goldbach proof

I believe that I.M. Vinogradov's proof of the ternary Goldbach conjecture used the observation that the number of ways $n$ can be written as a sum of three primes equals $$ \int_0^1 \sum_{p , q , r \...
AndreyF's user avatar
  • 171
4 votes
0 answers
113 views

Question about the definition of divisor sum functions at 0

I was working on convolution sums of divisor sum functions, and found it very curious that some authors would define the function at 0 as: $$\sigma_k(0):= {1\over 2}\zeta(-k)$$ But I cannot understand ...
StAKmod's user avatar
  • 141
2 votes
1 answer
197 views

Small near-reciprocals

Let $p$ be large prime in $[T,2T]$ where $T$ is a parameter. Can we have an integer pair $a,b$ satisfying $ab\equiv c\bmod p$ such that $|c|$ is of size $O(\operatorname{polylog}(T))$ and $a,b$ are ...
Turbo's user avatar
  • 13.9k
0 votes
1 answer
87 views

Constructing an integer with small residues for two distinct primes in polynomial time

Given two primes $p,q\in[T,2T]$, how many integers $m$ of size $O(T^{3/2+\epsilon})$ are there such that the residues $m\bmod p$ and $m\bmod q$ are both $O(polylog(T))$? Looking for an answer Is it ...
Turbo's user avatar
  • 13.9k
1 vote
0 answers
119 views

Simultaneous small near-reciprocals at two distinct primes

Let $p$ and $q$ be large primes in $[T,2T]$ where $T$ is a parameter. Can we have same integer pair $a,b$ satisfying $ab\equiv c'\bmod p$ and $ab\equiv c''\bmod q$ such that both $|c'|$ and $|c''|$ ...
Turbo's user avatar
  • 13.9k
3 votes
1 answer
252 views

The monodromy in the proof of Little Picard via Klein's $J$

First of all, my question is in the context of formalising proofs in the proof assistant Isabelle/HOL, so my questions are a bit guided by what material we have in the complex analysis library there. ...
Manuel Eberl's user avatar
  • 1,241
8 votes
2 answers
754 views

The smallest volume possible for a lattice with integer distances?

Let $\Lambda \subset\mathbb{R}^n$ be a lattice satisfying $\|x-y\|_2^2 \in \mathbb{Z}$ for all $x,y\in\Lambda$. How small can $\text{vol}(\Lambda)=\det(\Lambda)$ be? For example, in dimension $2$, the ...
Eric Naslund's user avatar
  • 11.4k
2 votes
2 answers
218 views

Asymptotic estimate for $\sum_{\substack{ab\le x \\ a,b\in A}}f(a)f(b)$

Suppose that $A\subseteq \mathbb{N}$ and suppose that you have an estimate of the form $$ \sum_{\substack{a\le x \\ a\in A}}f(a) \sim g(x). $$ With this information is it possible to get an asymptotic ...
Itachi's user avatar
  • 178
0 votes
0 answers
196 views

Sum of squares squared in an arithmetic progression

Let $r(n)$ be the number of ways to write $n$ as a sum of two squares and $(a,q)=1$. What is known about $$ \sum_{n \le x,n \equiv a (\text{mod} \, q)} r(n)^2 \quad? $$ I am looking for uniform ...
toshi's user avatar
  • 130
0 votes
1 answer
403 views

Could you please confirm or deny two identities involving weighted Stirling numbers of the second kind?

In the paper [1] below, among other things, Carlitz introduced weighted Stirling numbers of the second kind $R(n,k,r)$. He also proved that the numbers $R(n,k,r)$ can be generated by \begin{equation*}%...
qifeng618's user avatar
  • 1,101
4 votes
1 answer
462 views

Generalizations of the Brun-Titchmarsh theorem

Let $\pi(x;q,a)$ count the number of primes $\leq x$ congruent to $a$ mod $q$. The Brun-Titchmarsh Theorem states that for all $q< x$, $(a,q)=1$, we have $$ \tag{1} \pi(x;q,a) \leq \frac{2x}{\...
Joshua Stucky's user avatar
3 votes
1 answer
194 views

Analytic approximation of the step function in $L^p$ norm

Motivation: Euler-Maclaurin formula uses calculus to estimate discrete sums. I wonder what one can do by reverse engineering. A concrete problem I ran into is the following. Question: Let $\chi: \...
Student's user avatar
  • 5,230
4 votes
1 answer
271 views

Around the equation $\sigma\left(\square\right)=\text{prime}$: counterexamples or a proof for some of these conjectures

For integers $A,B\geq 1$ we define the difference $\sigma(A)\sigma(B)-\sigma(AB)$, denoting it as $[A,B]$, where $\sigma(n)=\sum_{1\leq d\mid n}d$ denotes the sum of divisors function. It is possible ...
user142929's user avatar
3 votes
0 answers
429 views

Proof of an explicit formula for $\pi_0(x)$

Let $\pi(x)$ denote the prime counting function and $$\pi_0(x) = \lim_{\epsilon \to 0} \frac{\pi(x+\epsilon)+\pi(x-\epsilon)}{2}.$$ I've seen noted in a few references the explicit formula $$\pi_0(x) =...
Jesse Elliott's user avatar
8 votes
1 answer
401 views

Is $\frac{1}{L(1+it)}$ unbounded?

Let $\chi$ be a Dirichlet character and $L(s, \chi)$ be the corresponding L-function. Is $$\frac{1}{L(1+it, \chi)}$$ unbounded for $t \in \mathbb{R}$? I'm aware that this is true if $L=\zeta$, but I'm ...
Holomorphic manifold's user avatar
2 votes
2 answers
368 views

Estimate $ \sum_{\substack{n\leq x\\ n\in Q\\}}\log n$ and $\sum_{\substack{n\leq x\\ n\in Q\\}} n$ where $Q$ is the square-free numbers

Let $Q$ be the set of squarefree numbers. I'd like to know estimates of following sums: $$ \sum_{\substack{n\leq x\\ n\in Q\\}}\log n \qquad\text{and}\qquad \sum_{\substack{n\leq x\\ n\in Q\\}} n. $$ ...
Beta's user avatar
  • 365
2 votes
2 answers
283 views

Ask for a proof of an identity involving the product of two Bernoulli numbers

It is well known that the Bernoulli numbers $B_{k}$ for $k\in\{0,1,2,\dotsc\}$ can be generated by \begin{equation*} \frac{z}{\textrm{e}^z-1}=\sum_{k=0}^\infty B_k\frac{z^k}{k!}=1-\frac{z}2+\sum_{k=1}^...
qifeng618's user avatar
  • 1,101
16 votes
0 answers
369 views

Transcendence of sum of reciprocals of factorials

For $A \subseteq \mathbb{N}$, define $\displaystyle x_A = \sum_{n \in A} \frac{1}{n!}$. It is easy to see that for every infinite $A$, $x_A$ is irrational. Question: Is there an infinite $A \subseteq \...
Sam's user avatar
  • 161
4 votes
1 answer
326 views

$\zeta(s) = 1 + X^{1-s}/(s-1) + ...$?

Let $s = \sigma+ i t$ with $0\leq \sigma\leq 1$, $|t|\leq X$, where $1\leq X<2$. It is easy to use the Euler-Maclaurin formula to prove a result of the form $$\left|\zeta(s) - 1 - \frac{X^{1-s}}{s-...
H A Helfgott's user avatar
  • 20.2k

1
11 12
13
14 15
62