All Questions
18 questions
24
votes
2
answers
2k
views
A conjecture based on Wilson's theorem
Definitions:
Lagrange's theorem implies that for each prime $p$, the factors of $(p − 1)!$ can be arranged in unequal pairs, with the exception of $±1$, where the product of each pair $≡ 1 \pmod p$. ...
- 1,903
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 ...
- 5,470
10
votes
1
answer
2k
views
Is new $n$-conjecture as follows correct?
Given a positive integer $P>1$, let its prime factorization be written as$$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}.$$
Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,...
- 1,776
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 ...
- 2,912
8
votes
2
answers
2k
views
Why is the Simple Zeros Conjecture said to be stronger than the Riemann Hypothesis?
Let the "Simple Zeros Conjecture (SZC)" be the statement that all zeros of the Riemann zeta function are simple.
I have often heard of the statement that the SZC is stronger than the Riemann ...
- 149
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 $\...
- 131
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, ...
- 3,064
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)+\...
user57432
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 \...
- 521
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$ ...
- 3,098
2
votes
1
answer
230
views
On $\sum_{\substack{p\leq x\\p,p+2\text{ twin primes}}}\frac{(\log p)^m}{p}$, on assumption of the first Hardy–Littlewood conjecture
I wondered, inspired in a result from [1] (Proposition 17) what should be the asymptotic behaviour of the sequence, on assumption of the First Hardy–Littlewood conjecture,
$$\sum_{\substack{\text{...
2
votes
0
answers
113
views
On a subset of the $abc$ triples
The $abc$ conjecture states that, for every positive real $\varepsilon$, there exist only finitely many triples $(a, b, c)$ of coprime positive integers such that $a + b = c$ and
$$c > \...
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 $\,...
- 1,008
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 $\ \...
- 359
1
vote
1
answer
265
views
"Halfway" approach to Landau's 4th problem (special case of Bateman-Horn)
Landau's 4th problem asks if $n^2 + 1$ is prime for infinitely many $n \in \Bbb{Z}$. It is known that $n^2 + 1$ can only be divisible by Pythagorean primes, and that for any $p$ congruent to $1 \pmod ...
- 263
1
vote
0
answers
222
views
Attempt of exploit the equation $1/\operatorname{rad}(n)=1/2-2\varphi(n)/\sigma(n)$ in the context of even perfect numbers, and a related conjecture
It is well known that the problem concerning even perfect numbers is to prove or refute if there are infinitely many of them. Few weeks ago I wrote the following conjecture, where $\varphi(n)$ denotes ...
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 ...
- 9,114
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+\...