Questions where prime numbers play a key-role, such as: questions on the distribution of prime numbers (twin primes, gaps between primes, Hardy–Littlewood conjectures, etc); questions on prime numbers with special properties (Wieferich prime, Wolstenholme prime, etc.). This tag is often used as a ...

learn more… | top users | synonyms

-4
votes
0answers
118 views

Must a proof of the asymptotic Goldbach conjecture be effective to imply GRH?

It was shown by Hardy and Littlewood that GRH (i.e. the Generalized Riemann Hypothesis for Dirichlet L-functions) implies that every large enough odd number is the sum of three primes. Later on (circa ...
4
votes
0answers
79 views

Visibility in a prime orchard

This suggests a variant on Polya's orchard problem. That problem asks1 for which radius $\epsilon$ of trees at each lattice point within a distance $R$ of the origin block all lines of sight to the ...
2
votes
2answers
195 views

binomial/factorial identity mod p

In trying to determine the spectrum of a well-known ergodic transformation, I came up with the following useful (for me) result. Let $p$ be a prime and $a$ a positive integer. Then for $M$ a positive ...
0
votes
1answer
134 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 ...
13
votes
1answer
368 views

Small quotients of smooth numbers

Assume that $N=2^k$, and let $\{n_1, \dots, n_N\}$ denote the set of square-free positive integers which are generated by the first $k$ primes, sorted in increasing order. Question: what is a good ...
5
votes
2answers
271 views

Logarithmic integral, $π(x)$ and $x/(\ln x)$

The function $\text{Li}$ (logarithmic integral) is defined for $x>0$ by $$ \text{Li}(x)=\int_2^{x}\frac{dt}{\ln t}. $$ The prime number theorem, proven by Hadamard and de la Vallée-Poussin in 1896 ...
4
votes
1answer
275 views

Does the Euler product for $L(s,\chi_4)$ also converge in the right half of the critical strip?

This question expands on this one from MSE. In the literature about Dirichlet $L$-series, I found that their Euler products: $$L(s, \chi) =\prod_p \bigg(\frac {1}{1-\frac{\chi(p)}{p^s}} \bigg)$$ ...
10
votes
3answers
556 views

About the prime divisors of values of polynomials

Let $P(x)$ be a polynomial having integer coefficients (and degree $\geq 3$), and let $p_1<p_2<\dots$ be the prime divisors occurring in the set of values $\{P(n):\ n\in\mathbb{Z}\}$. Is it ...
16
votes
1answer
1k views

When is the product $(1+1)(1+4)…(1+n^2)$ a perfect square?

This is a modification of an unanswered problem on the math StackExchange. When is the product $(1+1)(1+4)…(1+n^2)$ a perfect square? If $(1+1)(1+4)…(1+n^2)=k^2$ then one possibility is $n=3$, ...
7
votes
1answer
1k views

The large sieve for primes

Let $\Lambda(n)$ be the von Mangoldt function, i.e., $\Lambda(n) = \log p$ for $n$ a prime power $p^k$ and $\Lambda(n) = 0$ for all $n$ that not prime powers. Let $$S(\alpha) = \sum_{n \leq N} ...
2
votes
1answer
364 views

Number of twin primes

Consider number of twin primes less than $x$. We know that this number less than $\frac{Cx}{\log^2 x}$ for some constant $C$. Denote by $p_n$ the $n$-th prime number. Do we have the same result ...
2
votes
2answers
556 views

If $\binom{2p}{p}$ is $(-1)^{p-1} \bmod 2p+1$ is then $2p+1$ prime?

Let $p$ be a positive integer; if $2p+1$ is prime then it is easily checked that $$(2p+1)\mid\left(\binom{2p}{p}+(-1)^{p-1}\right);$$ conversely I conjecture that if the above divisibility assumption ...
4
votes
0answers
134 views

Are there infinitely many zeros of $\chi(s)+ \dfrac{2^{s}- 2^{2s-1}}{2^{s}-1}$ on the critical line?

Take $\chi(s)= 2^s\,\pi^{s-1}\,\sin\left(\frac{\pi\,s}{2}\right)\,\Gamma(1-s)$, so that $\zeta(s)=\chi(s)\,\zeta(1-s)$. The zeros of $\chi(s)=-1$ and the non-trivial zeros $\rho$ of $\zeta(s)$, seem ...
8
votes
2answers
420 views

Existence of polynomials of degree $\geq 2$ which represent infinitely many prime numbers

To my knowledge it is open so far whether the polynomial $x^2+1 \in \mathbb{Z}[x]$ takes infinitely many prime numbers as values. Is it known so far whether there is at all any polynomial $P \in ...
23
votes
8answers
11k views

What are the connections between pi and prime numbers?

I watched a video that said the probability for Gaussian integers to be relatively prime is an expression in $\pi$, and I also know about $\zeta(2) = \pi^2/6$ but I am wondering what are more ...
0
votes
2answers
73 views

Min number of primes up to n

According to the prime number theorem there are about $n/\ln(n)$ primes less than $n$. This value is a limit but it could fluctuate. My question is, is there a known bound on this fluctuation? i.e. ...
8
votes
3answers
685 views

Lower density of {primes} times themselves

We say that a set $A\subseteq \mathbb{N}$ has lower density 0 if $$\text{lim inf}_{n\to\infty}\frac{|A\cap\{1,\ldots,n\}|}{n} = 0.$$ Given $A,B\subseteq \mathbb{N}$ we set $A\cdot B = \{a\cdot b: ...
33
votes
4answers
3k views

Why could Mertens not prove the prime number theorem?

We know that $$ \sum_{n \le x}\frac{1}{n\ln n} = \ln\ln x + c_1 + O(1/x) $$ where $c_1$ is a constant. Again Mertens' theorem says that the primes $p$ satisfy $$ \sum_{p \le x}\frac{1}{p} = \ln\ln ...
9
votes
0answers
119 views

The multiplicative group generated by shifted primes

I am asking for references about the following problem. In particular, it is still open? If not, what is the state of the art result? Problem 1. Let $\Gamma$ be the multiplicative subgroup of ...
41
votes
4answers
1k views

How did Cole factor $2^{67}-1$ in 1903

I just heard a This American Life episode which recounted the famous anecdote about Frank Nelson Cole factoring $N:=2^{67}-1$ as $193707721 \times 761838257287$. There doesn't seem to be a historical ...
4
votes
0answers
220 views

Analog of Euler's factoring technique

Is there an analog of Euler's Two Squares factoring theorem over polynomial rings $\Bbb Z[x]$ by considering a version for non-negative polynomials? Euler's two squares factoring states that numbers ...
6
votes
0answers
66 views

Prime divisors of the norm of the first coefficient of an elliptic newform at width-1 cusps.

Let $E/\mathbb{Q}$ be an elliptic curve of conductor $N$ and let $f$ be its newform. Suppose $p \geq 5$ is a prime such that $p^2 \mid N$. We assume $f$ is $p$-minimal, which is equivalent to that the ...
3
votes
2answers
369 views

Non-standard Gauss sums

I have the following problem. Let $p$ be some prime. What is the value of \begin{equation} \sum_{k=1}^{p-1} \left(\frac{k+1}{p}\right) \omega_p^{kl}, \end{equation} where $\left(\frac{k+1}{p}\right)$ ...
0
votes
2answers
162 views

Smallest constant so that there are at least $n/\log_2{n}$ primes between $n$ and a constant multiple of $n$

What is the smallest known $c$ so that for any $n\geq 2$ there are at least $n/\log_2{n}$ primes between $n$ and $cn$ (inclusive)? The prime number theorem seems to give an asymptotic result so I am ...
0
votes
0answers
73 views

Expliciting the distance between consecutive Goldbach numbers assuming it's finite

In this paper, the author shows unconditionally that at least one of the following statements holds: i) the distance between two consecutive Goldbach numbers is finite, i.e. there exists an ...
1
vote
0answers
48 views

Asymptotics on number of bounded prime gaps [duplicate]

It's been over 2 years since the groundbreaking paper by Yitang Zhang in which he has shown that infinitely many prime pairs are by some constant $H$, with $H\leq 70000000$. Over the course of the ...
13
votes
1answer
453 views

A Collatz-like function that bifurcates on primes

This is likely piling one mystery on another, but ... I was exploring a function $f(n): \mathbb{N} \mapsto \mathbb{N}$ defined as follows: $$ f(n) = \begin{cases} n^2 & \text{if} \;n \;\text{is ...
3
votes
3answers
383 views

Are There Infinitly Many $n$ Which $a\times n!+1$ Be Composite?

$ax+1$ is a linear polynomial with integral coefficients. Are there infinitly many $n$ which $a\times n!+1$ be composite? As I know this problem is true for polynomials with degree greater that 1, ...
4
votes
0answers
257 views

Are there always at least *five* divisions?

@JosephO'Rourke asked a question about a Collatz like function related to primes: $f(n) = \begin{cases} n^2 & \text{if} \;n \;\text{is prime} \\ \lfloor n/2 \rfloor & \text{if} \;n ...
1
vote
4answers
605 views

Distribution of composite numbers

I have moved this question to math.stackexchange.com. People who are interested in this question can discuss at :http://math.stackexchange.com/questions/1272431/distribution-of-composite-numbers ...
3
votes
0answers
116 views

Farey Fractions Estimate Equivalent to the Prime Number Theorem?

Wikipedia's article on Farey Fractions points to an article of Jerome Franel that some averages are equivalent to the Riemann hypothesis. Let $F_n$ be the $n$-th Farey sequence, then the number of ...
0
votes
1answer
167 views

Is the following conjecture equivalent to the Second Hardy-Littlewood Conjecture? [closed]

Let $y$ be an arbitrary positive real number such that $y\ge 2$. Then if we can prove that, $$\lim_{x\to\infty}\dfrac{\pi(x)+\pi(y)}{\pi(x+y)}=1$$will it imply that for all sufficiently large $x$ ...
1
vote
3answers
308 views

Has this formula for $G_{k}:=\lim\inf_{n\to\infty}p_{n+k}-p_{n}$ been conjectured?

I give here a heuristics that suggests that the quantity $\displaystyle{G_{k}:=\liminf_{n\to\infty}p_{n+k}-p_{n}}$ should be approximately equal to $k(1+H_{k})$, where $H_{k}$ is the $k$-th harmonic ...
11
votes
0answers
428 views

Why are solutions to $\sqrt[k]{x_1^k+x_2^k+x_3^k+x_4^k}$ for $k=2,3$ curiously smooth?

Given an integer solution $s_m$ to the system, $$x_1^2+x_2^2+\dots+x_n^2 = y^2$$ $$x_1^3+x_2^3+\dots+x_n^3 = z^3$$ and define the function, $$F(s_m) = x_1+x_2+\dots+x_n$$ For $n\geq3$, using an ...
6
votes
1answer
392 views

Are reduced residue systems relative primorials an active area of research? If not, why not?

As a math amateur, I am finding the study reduced residue systems relative a primorial a very interesting way to understand the distribution of primes. For example, it is fascinating to me that it is ...
8
votes
1answer
979 views

Primes that are the sum of three squares

This is in some sense an extension of the earlier MO question, "Gaussian prime spirals." Gaussian primes in the complex plane, $a+b i$, require $a^2 +b^2$ prime off the axes. The generalization to ...
3
votes
4answers
230 views

Uniform upper bound for the sum over primes $\sum_{p \leq x} p^{-1+\varepsilon}$

I am reading the article D. M. Gordon and C. Pomerance, The distribution of Lucas and elliptic pseudoprime, Math. Comp. (1991) (click). In equation (27) the authors, apparently, used the following ...
8
votes
1answer
261 views

Asymptotic limit of truncated Legendre sieve

Consider the truncated sum $$ S(x):=\sum_{\substack{{d\mid P(\sqrt{x})}\\{d\leq x}}}\mu(d)/d, $$ where $P(z)$ is the product of all primes less than or equal to $z$, and $\mu(d)$ is the Möbius ...
18
votes
3answers
1k views

A Polynomial With Positive Prime Density

Let $P(x)$ be a non-constant polynomial with real coefficients. Can natural density of $$\{n\ |\ \lfloor P(n)\rfloor \ \text{is prime.}\}$$ be positive?
2
votes
0answers
146 views

Squarefree part of a Mersenne number

Consider the Mersenne number; $M_p=2^p−1$. Let $M_p=a_pb^2_p$ where $a_p$ is positive, squarefree, and $p$ is prime. A chinese paper written by Le Maohua "“On Mersenne Numbers”" states that the ...
6
votes
1answer
293 views

Primes isolated by large gaps to either side

Say that the $n$-th prime $p_n$ is isolated to degree $k$ (my notation) if the prime gap to either side is larger than $\log p_n$ to the $k$-th power: \begin{eqnarray*} p_n - p_{n-1} & > & ...
28
votes
2answers
3k views

Is Li(x) the best possible approximation to the prime-counting function?

The Prime Number Theorem says that $\lim_{n \to \infty} \frac{\pi(n)}{\mathrm{Li}(n)} = 1$, where $\mathrm{Li}(x)$ is the Logarithm integral function $\mathrm{Li}(x) = \int_2^x \frac{1}{\log(x)}dx$. ...
2
votes
2answers
346 views

Primes as uncorrelated random variables [closed]

The heuristic justification section of the Wikipedia article about Goldbach's conjecture says that the argument that suggests that the number of twin primes below $x$ should be roughly ...
14
votes
3answers
2k views

A variant of Goldbach Conjecture

I'm asking if this variant of weak Goldbach's Conjecture is already known. Let $N$ be an odd number. Does there exists prime numbers $p_1$, $p_2$ and $p_3$ such that $p_1+p_2-p_3=N$? Ideally, can we ...
7
votes
1answer
375 views

What does the sum of the reciprocals of all the highly composite numbers converge to?

I've calculated the sum of the reciprocals of all the $156$ first highly composite numbers up to $10^{18}$: $\sum \dfrac{1}{HCC(n)} = \dfrac{1}{2} + \dfrac{1}{4} + \dfrac{1}{6} + \dfrac{1}{12} + ...
-4
votes
2answers
308 views

Brocard's problem [closed]

According to Brocard's problem $$x^{2}-1=n!=4!*(5+1)(5+2)...(5+s)$$ here,$(5+1)(5+2)...(5+s)=\mathcal{O}(5^{r}),4!=k$. So, $$x^{2}-1=k *\mathcal{O}(5^{r})$$ Here, $\mathcal{O}$ is Big O ...
8
votes
2answers
871 views

divisible by all standard prime numbers

This question is about prime numbers in nonstandard models of Peano Arithmetic. Every such model looks like N+AxZ, where A is a dense linear order without end points. There are many nonstandard ...
6
votes
0answers
249 views

Can integers be distorted to make primes more regular?

Given a set $P$ of real numbers $\ge 1$, define the gap among different products in $P$ as $$g(P) = \inf \big\{\prod_{i=1}^n p_i^{a_i} - \prod_{i=1}^n p_i^{b_i} \mid p_i\in P;\,\, p_i\ne p_j \,\text{ ...
1
vote
0answers
135 views

Generalization of Little Fermat Theorem for a particular $a$ and perfect shuffles

I'm looking for the smallest $n\in \mathbb{N}$ that solves the following equation: $$2^n=1 \mod m$$ For an odd $m$. I know that Little Fermat Theorem and Euler Totient give me a solution but they ...
4
votes
2answers
721 views

How to calculate the sum of remainders of N?

I'm trying to sum the remainders when dividing N by numbers from 1 up to N $$\sum_{i = 1}^{N} N \bmod i$$ It's easy to write a program to evaluate the sum if N is small in O(N) but what if N is large ...