Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
1 answer
811 views

A consequence of Firoozbakht's conjecture?

This is a question out of curiosity, while looking at the Firoozbakht's conjecture. It might not be research related, but as usual, I am not really sure if a question ever is research related or not, ...
mathoverflowUser's user avatar
15 votes
0 answers
365 views

Do primes of the form $4k+1$ ever lead the greatest prime factor race?

Analogous to Chebyshev's race between primes, I examined the race between primes in the greatest prime factors, GPF, of natural numbers. Similar to the regular prime race, in the GPF race, the ...
Nilotpal Kanti Sinha's user avatar
5 votes
0 answers
326 views

Counting primes, twin primes, cousin primes: unusual approach, connection to some conjectures

I am investigating the following sieve-like algorithm. Let $S_N=\{1,\dots,N\}$. For all primes $p$ with $p_0\leq p \leq M$, we remove from $S_N$ the following elements: all numbers $n\in S_N$ such ...
Vincent Granville's user avatar
3 votes
0 answers
252 views

Counting twin primes with a sieve-like algorithm

The sequence A002822, denoted as $S$, represents all the twin primes except $\{3, 5\}$. Other than that exception, $k$ and $k+2$ are twin primes iff $(k+1)/6\in S$. Let $S(N)$ be the subset of $S$ ...
Vincent Granville's user avatar
2 votes
0 answers
114 views

A conjectured upper bound for the mean value of prime divisors inside prime gaps

In 1969 C.A. Grimm stated this interesting conjecture: the prime gap $\,G_n=\{x\in N:p_n\lt x\lt p_{n+1}\}\,$ contains at least $\,\#G_n=(p_{n+1}-p_n)-1=g_n-1\,$ distinct prime divisors, that is if $\,...
Augusto Santi's user avatar
9 votes
1 answer
388 views

$π(x+y) - π(x) ≤ c·y/\ln(y)$ for some constant $c$?

(I posted this question on Math SE but it has had no answer for a year now so I would like to ask if anyone here can provide one.) Thinking about the prime number theorem, I wondered whether it is ...
user21820's user avatar
  • 2,912
0 votes
0 answers
106 views

Variants of Nicholson's inequalities for prime numbers, involving the Lambert $W$ function

The purpose of this post is ask about two closely related/inspired conjectures from inequalities due to Nicholson (see [1]) and Visser [2]. If my reasonings are right should be stronger versions of ...
user142929's user avatar
5 votes
0 answers
614 views

is there a link with the probabilistic model for prime numbers?

Let $x \in \mathbb{R}_+$ and $k \in \mathbb{N}^{*}$. Let : $$\mathcal{A}(x)=\#\{(a_1, a_2, \ldots, a_k) \in \mathbb{P}^k \mid (a_1, a_2, \ldots, a_k \text{ verifying some properties}) \, , a_k \...
Lagrida Yassine's user avatar
0 votes
0 answers
82 views

Inequalities $\pi(x^a+y^b)^\alpha\leq \pi(x^c)^\beta+\pi(y^d)^\gamma$ involving the prime-counting function, where the constants are very close to $1$

Let $\pi(x)$ be the prime-counting function, I'm curious about if a suitable variant of the second Hardy–Littlewood conjecture (this corresponding Wikipedia) $$\pi(x^a+y^b)^\alpha\leq \pi(x^c)^\beta+\...
user142929's user avatar
5 votes
1 answer
472 views

Is the following weak version of second Hardy-Littlewood conjecture already known?

Very recently I was going through my previous MSE posts and I stumbled upon some of them regarding the Second Hardy-Littlewood Conjecture which states that, For all $x,y\ge 2$ we have, $$\pi(x)+\...
user avatar
7 votes
2 answers
438 views

Generalization of Legendre`s conjecture

Legendre`s conjecture states that there is always a prime between $n^2$ and $(n+1)^2$ for every natural $n$. It is natural to create following generalization: Is it true that for every $\...
Paladin's user avatar
  • 131
1 vote
0 answers
301 views

Is this a proof of the Hardy-Littlewood inequality? [closed]

V.V. Miasoyedov posted a paper to the arXiv claiming a proof of the Hardy-Littlewood conjecture $\pi(x+y) \le \pi(x)+\pi(y)$. It seems a bit off, and not only because the conjecture is widely believed ...
Charles's user avatar
  • 9,114
2 votes
0 answers
617 views

Arithmetic progression and average of two prime numbers

Let $A=(a_n : n \in \mathbb{N})$ be the sequence given by: $$ \ a_n = a_1 + (n - 1)d,\quad a_1,\ d,\ n \in \mathbb N,\quad d\gt a_1,\quad \gcd(a_1,\ d)=1. $$ For all terms of $A$ greater than $\ \...
Mike's user avatar
  • 359