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

5
votes
0answers
125 views

Congruences involving binary forms and primes of the form $x^2+y^2$

Let $a_s$ be \begin{align*} a_s=\sum_{k=0}^s{s+k\choose k}2^k, \end{align*} which is the coefficient of $x^s$ in \begin{align*} \frac{3-\sqrt{1-8x}}{2(x+1)\sqrt{1-8x}}. \end{align*} ( see ...
7
votes
1answer
286 views

Bounded gaps between primes in arithmetic progressions

Has Zhang's work on bounded gaps between primes been extended to the following theorem? For any arithmetic progression $an+b,\gcd(a,b)=1$, there is a constant $H$ (depending only on $a$) such that ...
0
votes
0answers
95 views

The maximum lengthed sequence of prime numbers with certain conditions (denizens)

Definition - Denizen A sequence $\lbrace a_k \rbrace$ is a denizen if all of it's members are prime numbers, i.e $a_0, a_1, ... a_n \in \mathbb{P} $; and it satisfies the following condition; ...
0
votes
0answers
113 views

A proof for a stronger version of the prime number theorem [closed]

Is there a proof for a strong version of a Prime Number Theorem? (Could not find the answer anywhere...) The theorem states the following: $$\pi(x)\ is \ a \ function\ that\ gives\ the\ number\ of\ ...
1
vote
1answer
31 views

Prime constant graphicial representation [closed]

I have something to check. It is about prime constant (I don't know if it is officially so called), but it is created on following way. We start with binary point number represenation. Zero followed ...
-4
votes
1answer
177 views

Gauss-Wantzel theorem, Fermat primes and solvability of S_n [closed]

Gauss-Wantzel theorem asserts that a polygon with $n$ sides is constructible if and only if $n$ is a product of a power of $2$ and distinct prime Fermat numbers, where the Fermat number of index $k$ ...
2
votes
4answers
272 views

Prime divisors of values of a polynomial on an infinite set

This may be a well known problem: Let $f$ be a polynomial with integer coefficients. Is it possible for the set of prime divisors of values of $f$ on an infinite set of integers, to be finite? I ...
4
votes
1answer
351 views

Unexpectedly prime rich cubic polynomial

We got a cubic polynomial which is unexpectedly prime rich. Let $f(x)=29160 x^3 + 30132 x^2 + 8046 x + 643$ and $\pi_f(n)$ the number of primes values of $f(x)$ for $x \in [1,n]$. Let ...
0
votes
0answers
64 views

Polynomial identities for congruent numbers and Bunyakovsky's conjecture

Bunyakovsky's conjecture states that polynomial with integer coefficients takes infinitely many prime values unless there are obvious reasons not to. It appears to imply something about polynomial ...
10
votes
0answers
330 views

Between Fermat's primes and the twin primes

Let me start with a curiosity. The integers $11,13,17,19$ are prime numbers, and $101,103,107,109$ are prime as well. One might wonder whether there is another occurrence where $10^m+1,10^m+3,10^m+7$ ...
6
votes
0answers
158 views

Intersection between the sums of the first positive integers, primes and non primes

Is the following conjecture true ? $$\left\{\sum\limits_{\begin{array}{c}k=1\\k\in\mathbb{Z}\end{array}}^nk \ |\ n\in\Bbb Z\right\} \cap \left\lbrace ...
0
votes
0answers
93 views

Can someone explain some of the steps in this paper clearly?

I'm having trouble understanding the steps this paper makes to come to the conclusion $p_{f}(d) \sim e^d\sqrt{d}$ Marek Wolf, First occurrence of a given gap between consecutive primes, preprint, ...
5
votes
1answer
435 views

Are there effective small intervals in which primes are dense?

As mentioned in Terry Tao's comment to this question, it is constructively known that there are primes between sufficiently large cubes. $\:$ According to wikipedia, "there exists a constant $\: ...
1
vote
1answer
189 views

reference on Dirichlet theorem on primes in arithmetic progression

I appreciate if you could help me to find a reference (and a proof). Combining Dirichlet theorem on primes in arithmetic progression with Chebotarev densitiy theorem, we know that given two positive ...
0
votes
1answer
224 views

Are there infinitely many $k$ for which $\frac{\sigma(k)}{k}=n^p$ and $p$ is an odd prime? [closed]

I would like to know if there are infinitely many $k$ for which $$\sigma(k)/k=n^p$$ such that $m=k{n}^{p-1}$ with $m,n>0$ and $p$ is an odd prime? Note: $\sigma(\frac{m}{{n}^{p-1}})$ is the sum of ...
0
votes
0answers
146 views

arithmetic progressions with few primes

Is this true ? Let $\beta_0$ be a positive number. One may find $\beta>\beta_0$, $0<\lambda<1$, and infinitely many $q>1$ so that there exists an arithmetic progression of step $q$, $a_1, ...
2
votes
1answer
196 views

Counting function for prime pair with bounded gaps between them [duplicate]

I'll start by noting that I am not at all an expert on number theory. However I do use it in a proof and would like your assistance if possible. Yitang Zhang breakthrough result established that ...
13
votes
1answer
573 views

Elementary Proof of Infinitely many primes $\mathfrak{p} \in \mathbb{Z}[i]$ in the sector $\theta < \arg \mathfrak{p} <\phi $

A quick look at the primes in $\mathbb{Z}[i]$ suggests they might be evenly distributed by angle if we zoom out on a coarse enough scale. I would like ask about the much weaker statement forgetting ...
-1
votes
0answers
167 views

Straight line complexity of $k!a$ where $(a,p)=1$

In Qi Cheng's paper, an algorithm is provided to calculate $k!a$ at some random $a∈ℕ$ ($a$ is not input to algorithm, only $k$ is), what is the probability that given a prime $p$ such that ...
1
vote
0answers
157 views

Does the proof of Conjectures B and D of Hardy and Littlewood have any implication on the generalized Riemann hypothesis they used?

Does the proof of Conjectures B and D of Hardy and Littlewood have any implication on the generalized Riemannn hypothesis they used? In their paper, Some problems of 'Partitio numerorum'; III - On ...
7
votes
0answers
495 views

“Forthcoming paper” of Goldston-Graham-Pintz-Yıldırım

The above-named authors of [1] and its (significantly different) published version [2] write: In a forthcoming paper, we will show how the methods here can be extended to prove corresponding ...
6
votes
1answer
401 views

Approximating a real by a ratio of primes

Let $x$ and $y$ be positive reals in $(0,1)$ with $x < y$ and $y-x =\epsilon$. I seek smallest primes $p$ and $q$ such that $$x \le \frac{p}{q} \le (x+\epsilon) = y \;.$$ Q. What upper bound ...
3
votes
1answer
197 views

Least prime for which a square-free integer is a non-residue

Suppose $a$ is a square-free integer and $\left(\frac{a}{p}\right)=1$ for the primes $p\leq k$. I'll call $a$ a quasi-square of order $k$. What I am interested in is the maximum value of $k$ in terms ...
4
votes
0answers
109 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
215 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
155 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 ...
5
votes
3answers
363 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
296 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)$$ ...
2
votes
1answer
376 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
571 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
143 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 ...
0
votes
2answers
83 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
2answers
440 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 ...
10
votes
3answers
586 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 ...
9
votes
3answers
698 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: ...
10
votes
0answers
128 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 ...
42
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 ...
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
376 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
164 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
76 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
50 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 ...
4
votes
0answers
272 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 ...
3
votes
3answers
392 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, ...
14
votes
1answer
540 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 ...
1
vote
4answers
616 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
131 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
170 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
319 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
433 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 ...