All Questions
Tagged with conjectures prime-numbers
44 questions
1
vote
0
answers
77
views
Conjecture about Euler quotients related to non-Wieferich numbers $W(n)=\frac{2^n+1}{3}$
For odd natural $n$ define the Euler quotient:
$$ a(n)=\frac{(2^{\phi(n)}-1) \bmod n^2}{n}=\frac{2^{\phi(n)}-1}{n} \bmod n$$
$a(n)=0$ is $n$ being Wieferich number (not necessarily prime).
For odd $n$,...
- 25.4k
0
votes
0
answers
241
views
Conjecture about some recurrent primes
I want to know if there are conjectures similar to this one, I know there is the Bell primes conjecture or Gardner conjecture (mentioned in this page https://en.wikipedia.org/wiki/Bell_number), but ...
0
votes
0
answers
374
views
Is the Conjecture of Representing Integers as Differences of Semiprimes and Primes Extendable to Products of Distinct Primes?
Conjecture:
Let $k$ and $l$ be fixed distinct positive integers ($k≠l$). Then, for every positive integer $n$, there exist prime numbers $p_1,p_2,…,p_k∈\mathbb{P}$ and $q_1,q_2,…,q_l∈\mathbb{P}$ such ...
- 17
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
3
votes
0
answers
327
views
Conjecture about primes and Fibonacci numbers
I posted this conjecture on math.stackexchange, but I received no answer proving or disproving it: if $ m > 4 $ is a positive integer not divisible by $ 2 $ or $ 3 $, it's ever possible to find a ...
- 387
3
votes
1
answer
2k
views
What do we know about Lucky numbers?
I'm really fascinated by lucky numbers (Wikipedia; OEIS A000959) and their prime-like characteristics.
Wolfram states: write "out all odd numbers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, .... The ...
- 39
1
vote
1
answer
190
views
Infinitely many $k \in \mathbb{N}$ such that the closed interval $[k, k+99]$ contains from $2$ to $23$ prime numbers
Let $k \in \mathbb{Z}^+$.
Is it possible to prove that, for some given
$m \in \{0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23\}$,
there are only finitely many $k$ such that the closed ...
- 1,451
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
2
votes
0
answers
300
views
How soon can we represent a number as the sum of two primes?
Posting in MO since it was unanswered in MSE.
Goldbach's conjecture says that every even number can be represented as the sum of two primes. But how soon can we find such a representation. Taking $20 =...
- 5,470
2
votes
1
answer
307
views
Analogue of Fermat's little theorem for Bernoulli numbers
Is the following analogue of Fermat's Little Theorem for Bernoulli numbers true?
Let $D_{2n}$ be the denominator of $\frac{B_{2n}}{4n}$ where $B_n$ is
the $n$-th Bernoulli number. If $\gcd(a, D_{2n}) ...
- 5,470
20
votes
1
answer
594
views
Distinct exponents in the factorization of the factorial, a problem of Erdős
In the 1982 paper below, Paul Erdős proved that if $h(n)$ is the number of distinct exponents in the prime factorization of $n!$ then $$c_1\Big(\frac{n}{\log n}\Big)^{1/2} < h(n) < c_2\Big(\frac{...
- 203
2
votes
0
answers
269
views
A relation of the prime counting function $\pi$ to counting the ordered ways of a number $n$ as a sum of two primes and two questions?
The definitions are from these two questions:
https://math.stackexchange.com/questions/3164216/a-series-related-to-prime-numbers
https://math.stackexchange.com/questions/4349186/trying-to-understand-...
- 3,064
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 ...
- 3,098
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
-4
votes
1
answer
881
views
Are there infinitely many $n$ such that $n!-1$ and $n!+1$ are prime numbers? [closed]
Are there infinitely many $n$ such that $n!−1$ and $n!+1$ are prime numbers?
- 9
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
9
votes
1
answer
858
views
Prove that there are no composite integers $n=am+1$ such that $m \ | \ \phi(n)$
Let $n=am+1$ where $a $ and $m>1$ are positive integers and let $p$ be the least prime divisor of $m$. Prove that if $a<p$ and $ m \ | \ \phi(n)$ then $n$ is prime.
This question is a ...
- 319
6
votes
1
answer
242
views
Inductively computing Mersenne primes / perfect numbers?
For two sets $A,B$ set $A+B = \{a +b | a \in A,b \in B\}$.
Let $(x_n)_{n \in \mathbb{N}}$ be independent variables. Let $\sigma(n)$ be the sum of divisors of $n$.
Set $\hat{\phi}(1) = \{x_1\}$ and ...
user6671
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
7
votes
1
answer
493
views
About semiprimal representations of $1$
Conjecture $A_1$ : For every $m \in \mathbb N \setminus \{1\}$ there exist mutually different primes $p_{r_1},...,p_{r_m}$ and mutually different primes $b_{w_1},...,b_{w_m}$ and numbers $i_1,...,i_m \...
user153451
9
votes
1
answer
418
views
Conjectured primality test for specific class of $N=4kp^n+1$
Can you provide a proof or counterexample for the following claim?
Let $P_m(x)=2^{-m}\cdot((x-\sqrt{x^2-4})^m+(x+\sqrt{x^2-4})^m)$ .
Let $N= 4kp^{n}+1 $ where $k$ is a positive natural number , $...
- 2,661
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 ...
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
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+\...
-2
votes
1
answer
396
views
Published articles in journals about the Firoozbakht's conjecture, whose main goal or focus is the study of this conjecture
I would like to know what articles are in the literature about the known as Firoozbakht's conjecture, see the Wikipedia Firoozbakht's conjecture.
Question. What articles have been published in ...
20
votes
4
answers
2k
views
Can anything deep be said uniformly about conjectures like Goldbach's?
This is a soft question sparked by my curiosity about the intrinsic depth of Goldbach-like conjectures as perceived by current experts in number theory. The incompleteness theorem implies that, if our ...
- 2,912
1
vote
0
answers
123
views
Testing polynomials irreducible over the integers
Let $f\in\operatorname{int}(\mathbb Z)$, the ring of integer-valued rational polynomials. Define $\operatorname{P}^+(f)$ as the number of primes $>0$ that $f$ assumes at distinct integral arguments....
- 862
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
2
votes
1
answer
14k
views
Are concatenations of two consecutive Mersenne numbers which are congruent to 6 mod 7 necessarily composite?
In this question on MSE, Enzo Creti asks for a prime number formed by concatenating the Mersenne numbers $2^n-1$ and $2^{n-1}-1$, for example, 40952047. For all residues modulo 7, he found primes ...
- 1,203
0
votes
1
answer
660
views
The difference between two coprime semiprimes
Conjecture:
Any positive integer can be written as the difference between two
coprime semiprimes.
Tested up to 1,000,000.
See also:
https://math.stackexchange.com/questions/2579578/the-...
- 862
62
votes
2
answers
3k
views
A conjecture regarding prime numbers
For $n,m \geq 3$, define $ P_n = \{ p : p$ is a prime such that $ p\leq n$ and $ p \nmid n \}$ .
For example :
$P_3= \{ 2 \}$
$P_4= \{ 3 \}$
$P_5= \{ 2, 3 \}$,
$P_6= \{ 5 \}$ and so on.
Claim: $...
- 653
5
votes
0
answers
238
views
The set of numbers $a+b$ such that $ma^2+nb^2$ is prime
Conjecture:
If $m,n$ are coprime it exist a minimal natural number $N_{mn}$ such
that:
$\{a+b>N_{mn}\mid a,b\in\mathbb N^+\wedge ma^2+nb^2\in\mathbb P_{>2}\} = \{ k > N_{mn} \mid \...
- 862
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
1
vote
0
answers
142
views
Primes dividing functions defined by linear recurrence relations with constant coefficients
For Fibonacci numbers $F_n$ it holds that $p|F_{p-(\frac{5}{p})}$, if $p$ is an odd prime (Legendre symbol).
I guessed that the number $5$ came from the roots of the characteristic polynomial and ...
- 862
26
votes
1
answer
1k
views
What is the status on this conjecture on arithmetic progressions of primes?
The Green-Tao theorem states that for every $n$, there is an arithmetic sequence of length $n$ consisting of primes.
For primes, $p$, let $P(p)$ be the maximum length of an arithmetic progression of ...
- 1,835
2
votes
1
answer
222
views
Primes and the factorial
Conjectures:
For all prime numbers $p>5$ there exist a prime number $q<p$ such that
$q\equiv m!\!\pmod p$, for some $m$ with $2<m<p$.
and
For all primes $p$ there is a prime $q&...
- 862
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
5
votes
0
answers
425
views
Conjectured new primality test for Mersenne numbers
How to prove that this conjecture about a new primality test for Mersenne numbers is true ?
Definition: Let $M_{q}=2^{q}-1 , S_{0} = 3^{2} + 1/3^{2} , \ and: \ S_{i+1} = S_{i}^{2}-2 \pmod{M_{q}}$
...
- 161
1
vote
1
answer
362
views
A conjecture on the prime counting function
I was thinking about the Second Hardy-Littlewood conjecture for quite sometime (some of my posts are related to this). In one of my earlier post I conjectured that the inequality ($\pi(x)$ denotes the ...
user57432
4
votes
0
answers
748
views
Second Hardy-Littlewood Conjecture theme
If Second Hardy-Littlewood Conjecture is true then we can claim that $\pi(x)-\pi(y)\leq \pi(x-y)$. Thus the conjecture gives an upper bound for the number of primes between $x$ and $y$. I have found ...
user57432
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
11
votes
6
answers
3k
views
What are conjectures that are true for primes but then turned out to be false for some composite number?
Note: This is an update formulation since many people misunderstood the question before.
Of course it is easy to make a statement like "Every n is a prime or at most 1000", which is true for every ...
- 18.8k
7
votes
3
answers
1k
views
Prime constellation conjectures
This is a simple question about terminology and provenance.
I just need to sort out the circle of conjectures that generalize and refine the twin prime conjecture.
I've encountered Polignac's ...
- 17.6k
17
votes
5
answers
2k
views
Is there a progress on a solution of the inequality $\pi (m+n) \leq \pi (m) + \pi (n)$
in 1923 Hardy and Littlewood proposed the conjecture $\pi (m+n) \leq \pi (m) + \pi (n)$. Is there any progress towards solving this conjecture?
- 479