Skip to main content

All Questions

33 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5 votes
0 answers
206 views

Number of solutions of linear congruence with bounded variables

Fix some nonzero integers $a_1, \dots, a_k$, with $k \geq 2$, and some real numbers $c_1, \dots, c_k \in (0,1)$. For every positive integer $m$, let $N(m)$ be the number of $k$-tuple of integers $(x_1,...
Erik4's user avatar
  • 121
5 votes
0 answers
233 views

What is known about the mode of the number of divisors $\le x$?

Let $d(x)$ be the divisor function. Let $M(x)$ ($x$ a positive integer) be the most frequent value of $d(y)$ for $1 \le y \le x$. Is an asymptotic known for $M(x)$, and failing that, can $M(x)$ at ...
user514014's user avatar
5 votes
0 answers
355 views

What is the sum of the binomial coefficients ${n\choose p}$ over prime numbers?

What is known about the asymptotics, lower and upper bound of the sum of the binomial coefficients $$ S_n = {n\choose 2} + {n\choose 3} + {n\choose 5} + \cdots + {n\choose p} $$ where the sum runs ...
Nilotpal Kanti Sinha's user avatar
4 votes
0 answers
262 views

Asymptotic number of "modular primes"

We can say that a number $p$ is prime modulo $N$ if for any two numbers $1<a,b<p$, $ab \not\equiv p \pmod N$. We will define $p(n)$ to be the number of primes mod $n$. I'm wondering about the ...
Daniel Weber's user avatar
  • 3,319
4 votes
0 answers
412 views

Effective prime number theorem

The prime number theorem implies that for every $ϵ>0$, there is $n_\epsilon$ such that for all $n≥n_\epsilon$ the number of primes in $[n,cn]$ is at least $\frac{(c−1−\epsilon)n}{\log n}$ and at ...
Turbo's user avatar
  • 13.9k
4 votes
0 answers
306 views

Effective version of the Bombieri-Vinogradov theorem

Is there an effective version of the Bombieri-Vinogradov Theorem, in that have bounds on the implied constant been found?
Mayank Pandey's user avatar
3 votes
0 answers
167 views

A sharper estimate for a generalization of the sum-of-divisors function

I am interested in the function $f_n(m)$ which can be defined by the Dirichlet generating function $$\zeta(s)\zeta(s - 1) \cdots\zeta(s - n + 1) = \sum\limits_{m = 1}^\infty \frac{f_n(m)}{m^s} $$ This ...
Bear's user avatar
  • 31
3 votes
0 answers
151 views

On an inequality for the arithmetic function counting the number of primes $\lfloor n^c\rfloor$ in the spirit of Ramanujan's prime counting inequality

In page 3 of [1] (please see if you need it the book by Berndt) Axler refers an inequality that involves the prime-counting function $\pi(x)$ and that was deduced by Ramanujan. I'm curious to know if ...
user142929's user avatar
3 votes
0 answers
320 views

On sets of coprime numbers

We know that from prime number theorem that the number of primes below $n$ and above $\frac n2$ (denoted by $\pi_{n,\frac n2}$ is approximately $$\pi_{n,\frac n2}\approx\frac{n}{2\ln n}.$$ Denote by $...
user avatar
2 votes
0 answers
179 views

A Brun-Titchmarsh type result for divisor sums; asymptotic/improved bound

In Shiu's work ('A Brun-Titchmarsh theorem for multiplicative functions') he proved that if $r\le x$ is a natural number, we have $$\sum_{r<n\le x}d(n)d(n-r)\ll x\log^2x\sum_{d|r}\frac{1}{d}.$$ I ...
user avatar
2 votes
0 answers
195 views

Asymptotics of $\vartheta(x+y)-\vartheta(x)$, where $\vartheta$ is the Chebyshev function, when $y\in[x^\alpha, x]$ for some $\alpha\in(0,1)$

Introduction Consider $\vartheta$ to be the Chebyshev function, that is, $\vartheta(x)$ denotes, for $x\in\mathbb N$, the sum $\sum_{p\le x,\ p\text{ prime}} \ln p$. I am interested in asymptotics for ...
Maximilian Janisch's user avatar
2 votes
0 answers
252 views

Asymptotic behaviour of a sum involving Möbius function

(This is a cross-posted simplification of this question posted in MSE which did not have a complete answer.) I am trying to get the asymptotic behaviour when $n$ grows to infinity of a partial sum of ...
Juan Moreno's user avatar
2 votes
0 answers
422 views

Sequences with high densities of primes: how to boost them to get even more and larger primes

I propose a methodology to help find large prime numbers with a much higher probability than picking up random numbers and testing them for primality. This would help speed up prime number generators ...
Vincent Granville's user avatar
2 votes
0 answers
203 views

Asymptotics on a double sum over primes

I am attemping to find asymptotics of $$\sum_{p \leq n}\ln p \left( \sum_{k=1}^\infty \left(\left\{\frac{n}{p^k} \right\} - \left\{\frac{n-1}{(p-1)p^k} \right\} \right) - \left\{\frac{n-1}{p-1} \...
Brian's user avatar
  • 1,549
2 votes
0 answers
110 views

On variations of a claim due to Kaneko in terms of Lehmer means

This post is cross posted from Mathematics Stack Exchange, due that there was a mistake from my part (see the excellent partial answer and my thread of edits of my question on MSE) this post on ...
user142929's user avatar
2 votes
0 answers
167 views

What about series involving strong primes?

I know about the importance in analytic number theory of the sutdy of series involving prime numbers or constellations of prime numbers, for example, if I am not wrong, major theorems are Mertens' ...
user142929's user avatar
2 votes
0 answers
110 views

Bounds on the number of zeros of a quadratic form

Let $Q(x_1, \dots, x_n)$ be a non-degenerate indefinite quadratic form with integer coefficients. Let $N(Q,T)$ be the set of vectors $x=(x_1, \dots, x_n) \in {\mathbb Z}^n$ such that $|x|<T$ and $Q(...
Keivan Karai's user avatar
  • 6,214
1 vote
0 answers
128 views

On Zudilin's linear forms in $1,\zeta(5)$ and $\zeta(7)$

I am reading an article "Well-poised hypergeometric service for diophantine problems of zeta values" by W. Zudilin. Consider the quantities defined here in pg. $617$ $$\tilde{F_n}:= \frac{1}{...
Max's user avatar
  • 11
1 vote
0 answers
86 views

Asymptotic behaviour of $\sum_{k=1}^{n}\frac{R_{k+1}+R_k}{R_{k+1}-R_k}$, where $R_k$ are the Ramanujan primes

I was inspired in the following post from this Math Overflow that was asked yerterday Asymptotic behavior of a certain sum of ratios of consecutives primes to ask about a similar question for ratios ...
user142929's user avatar
1 vote
0 answers
315 views

From an inequality for the Euler's totient function to a combination of Firoozbakht's conjecture and Nicolas' criterion for the Riemann hypothesis

In this post we ask about the veracity of an inequality deduced from a combination of Firoozbakht's conjecture (see [1] or [2]) and Nicolas' criterion for the Riemann hypothesis (see for instance [3])....
user142929's user avatar
1 vote
0 answers
101 views

Size of a set defined by divisor function

After some computations, I guessed the following conjecture. How can I prove or disprove it? thanks! Let $$ A(k)=\#\left\{\left(t,\frac{k+t+a}{4t-1}\right):1\leq t\leq k,\ 1\leq a\leq k+t,\ a\mid(k+...
asad's user avatar
  • 841
1 vote
0 answers
195 views

Asymptotics for certain sum involving the divisor function, Ramanujan sum

Let $c_q(n)$ be the Ramanujan sum, and let $\tau(n)$ be the divisor function. Is there an asymptotic formula for $$\sum_{n\le x}\tau(n)c_q(n)$$ with error terms that do not depend on $q$?
Mayank Pandey's user avatar
0 votes
0 answers
44 views

Asymptotic counts for imaginary quadratic discriminants with fixed splitting conditions

Let $p$ be prime and $r$ be a positive integer. I am interested in asymptotics for the number of imaginary quadratic discriminants $d$ such that $p$ does not divide the conductor of $d$, $p$ splits ...
stillconfused's user avatar
0 votes
0 answers
132 views

Asymptotic bound of some number theoretic function

I asked this in stack exchange but did not get anything so I am posting it here. I am self-studying asymptotic behavior of some number theoretic function and the following question comes up. Let $n$ ...
KAK's user avatar
  • 613
0 votes
0 answers
68 views

Around similar inequalities than an inequality due to Nicolas, that involve products of consecutive Ramanujan primes

This is cross-posted (and this post is a version to ask just around the veracity of Conjecture 1) as the post with identifier 3594907 and same title), that I've edited on Mathematics Stack Exchange ...
user142929's user avatar
0 votes
0 answers
80 views

Relevance of the deduction of similar theorems than Maier's theorem for other prime constellations

A year ago I asked this question on Mathematics Stack Exchange with identifier 4245823 and same title Relevance of the deduction of similar theorems than Maier's theorem for other constellations of ...
user142929's user avatar
0 votes
0 answers
89 views

A similar inequality for the Dedekind psi function, than an inequality stated by Schinzel

I would like to ask about the next question that seems to me interesting. I know an article that was written by Andrzej Schinzel in which he stated Lemma 2. In this post we denote the Dedekind psi ...
user142929's user avatar
0 votes
0 answers
51 views

On $\sum_{\substack{1\leq d\leq x\\(d,r)=1}}\frac{\mu(d)}{d}W(\frac{x}{d})$, with $\mu(n)$ the Möbius function and $W(x)$ the Lambert $W$ function

I wondered if it is possible to posed a similar question than Question 2 by Olivier Ramaré from [1] (page 231), although the computational evidence that I have for my conjecture is very small. ...
user142929's user avatar
0 votes
0 answers
154 views

On the equation that involves the Dedekind psi function $\psi(x)=n$ with unique solution $x$, for a fixed integer $n\geq 1$

The Dedekind psi function is defined for a positive integer $m>1$ as $$\psi(m)=m\prod_{\substack{p\mid m\\p\text{ prime}}}\left(1+\frac{1}{p}\right)\tag{1}$$ with the definition $\psi(1)=1$. See ...
user142929's user avatar
0 votes
0 answers
35 views

Bound for $\left|\sum_{\substack{1\leq d\leq x\\(d,r)=1}}\frac{G_d}{d^{1+\varepsilon}}\right|$, where $G_d$ denote the Gregory coefficients

In this post we denote the Gregory coefficients, or reciprocal logarithmic numbers, this Wikipedia Gregory coefficients as $G_k$, for integers $k\geq 1$. I would like to know if it is possible to get ...
user142929's user avatar
0 votes
0 answers
158 views

Similar problems for the Dedekind psi function than those that are in the literature for the Euler's totient function: reference request or proposals

I know the linked articles from Wikipedia for the Euler's totient function and the Dedekind psi function. I know that are in the literature famous, interesting and difficult problems involving the ...
user142929's user avatar
0 votes
0 answers
89 views

Partial sums involving Gregory coefficients that cannot be an integer

For integers $n\geq 1$ let $G_n$ be the Gregory coefficients or reciprocal logarithmic numbers, see the Wikipedia [Gregory coefficients.] (https://en.wikipedia.org/wiki/Gregory_coefficients) $${z\...
user142929's user avatar
0 votes
0 answers
93 views

Estimating asymptotically a sum (proof check)

I hope this question is appropriate for MathOverflow, if not please remove it. I have the following problem which is taken from the paper "Sharp Conditional Bound for Moments of the Riemann Zeta ...
asd's user avatar
  • 199