Skip to main content

All Questions

14 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
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
263 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
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
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
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
1 vote
0 answers
133 views

On a continuous function as a substitute of the prime-counting function in the second Hardy–Littlewood conjecture satisfying certain asymptotics

It it well-known that the prime-counting function $\pi(x)$ satisfies the prime number theorem and that were in the literature two related conjectures to this arithmetic function, these are: the ...
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
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